{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":33,"n_cols":5,"rows_kept":33,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910819986703321"]
[null,null,"Autore",null,"Moreau Nicolas <1945->"]
[null,null,"Titolo",null,"Tools for signal compression / / Nicolas Moreau"]
[null,null,"Pubbl/distr/stampa",null,"London, : ISTE"]
[{"$nulls":4},"Hoboken, N.J., : John Wiley & Sons, c2011"]
[null,null,"ISBN",null,"9781118616611"]
[{"$nulls":4},"1118616618"]
[{"$nulls":4},"9781118616628"]
[{"$nulls":4},"1118616626"]
[{"$nulls":4},"9781299315228"]
[{"$nulls":4},"1299315224"]
[{"$nulls":4},"9781118616550"]
[{"$nulls":4},"1118616553"]
[null,null,"Edizione",null,"[1st edition]"]
[null,null,"Descrizione fisica",null,"1 online resource (216 p.)"]
[null,null,"Collana",null,"ISTE"]
[null,null,"Disciplina",null,"621.389/3"]
[null,null,"Soggetti",null,"Sound - Recording and reproducing"]
[{"$nulls":4},"Data compression (Telecommunication)"]
[{"$nulls":4},"Speech processing systems"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Cover; Tools for Signal Compression; Title Page; Copyright Page; Table of Contents; Introduction; PART 1. TOOLS FOR SIGNAL COMPRESSION; Chapter 1. Scalar Quantization; 1.1. Introduction; 1.2. Optimumscalar quantization; 1.2.1. Necessary conditions for optimization; 1.2.2. Quantization error power; 1.2.3. Further information; 1.2.3.1. Lloyd-Max algorithm; 1.2.3.2. Non-linear transformation; 1.2.3.3. Scale factor; 1.3. Predictive scalar quantization; 1.3.1. Principle; 1.3.2. Reminders on the theory of linear prediction; 1.3.2.1. Introduction: least squares minimization"]
[{"$nulls":4},"1.3.2.2. Theoretical approach1.3.2.3. Comparing the two approaches; 1.3.2.4. Whitening filter; 1.3.2.5. Levinson algorithm; 1.3.3. Prediction gain; 1.3.3.1. Definition; 1.3.4. Asymptotic value of the prediction gain; 1.3.5. Closed-loop predictive scalar quantization; Chapter 2. Vector Quantization; 2.1. Introduction; 2.2. Rationale; 2.3. Optimum codebook generation; 2.4. Optimum quantizer performance; 2.5. Using the quantizer; 2.5.1. Tree-structured vector quantization; 2.5.2. Cartesian "]
[{"$nulls":4},"product vector quantization; 2.5.3. Gain-shape vector quantization; 2.5.4. Multistage vector quantization"]
[{"$nulls":4},"2.5.5. Vector quantization by transform2.5.6. Algebraic vector quantization; 2.6. Gain-shape vector quantization; 2.6.1. Nearest neighbor rule; 2.6.2. Lloyd-Max algorithm; Chapter 3. Sub-band Transform Coding; 3.1. Introduction; 3.2. Equivalence of filter banks and transforms; 3.3. Bit allocation; 3.3.1. Defining the problem; 3.3.2. Optimum bit allocation; 3.3.3. Practical algorithm; 3.3.4. Further information; 3.4. Optimum transform; 3.5. Performance; 3.5.1. Transform gain; 3.5.2. Simulation results; Chapter 4. Entropy Coding; 4.1. Introduction"]
[{"$nulls":4},"4.2. Noiseless coding of discrete, memoryless sources4.2.1. Entropy of a source; 4.2.2. Coding a source; 4.2.2.1. Definitions; 4.2.2.2. Uniquely decodable instantaneous code; 4.2.2.3. Kraft inequality; 4.2.2.4. Optimal code; 4.2.3. Theorem of noiseless coding of a memoryless discrete source; 4.2.3.1. Proposition 1; 4.2.3.2. Proposition 2; 4.2.3.3. Proposition 3; 4.2.3.4. Theorem; 4.2.4. Constructing a code; 4.2.4.1. Shannon code; 4.2.4.2. Huffman algorithm; 4.2.4.3. Example 1; 4.2.5. Generalization; 4.2.5.1. Theorem; 4.2.5.2. Example 2; 4.2.6. Arithmetic coding"]
[{"$nulls":4},"4.3. Noiseless coding of a discrete source with memory4.3.1. New definitions; 4.3.2. Theorem of noiseless coding of a discrete source with memory; 4.3.3. Example of a Markov source; 4.3.3.1. General details; 4.3.3.2. Example of transmitting documents by fax; 4.4. Scalar quantizer with entropy constraint; 4.4.1. Introduction; 4.4.2. Lloyd-Max quantizer; 4.4.3. Quantizer with entropy constraint; 4.4.3.1. Expression for the entropy; 4.4.3.2. Jensen inequality; 4.4.3.3. Optimum quantizer; 4.4.3.4. Gaussian source; 4.5. Capacity of a discrete memoryless channel; 4.5.1. Introduction"]
[{"$nulls":4},"4.5.2. Mutual information"]
[null,null,null,"Sommario/riassunto","This book presents tools and algorithms required to compress/uncompress signals such as speech and music. These algorithms are largely used in mobile phones, DVD players, HDTV sets, etc.  In a first rather theoretical part, this book presents the standard tools used in compression systems: scalar and vector quantization, predictive quantization, transform quantization, entropy coding. In particular we show the consistency between these different tools. The second part explains how these tools are used in the latest speech and audio coders. The third part gives Matlab programs simulating t"]