Abstract
Let us consider a 2-bit quantizer that represents quantized values using the following set of quantization indexes: f0; 1; 2; 3g: Each quantization index given above is called a source symbol, or simply a symbol, and the set is called a symbol set. When applied to quantize a sequence of input samples, the quantizer produces a sequence of quantization indexes, such as the following: 1; 2; 1; 0; 1; 2; 1; 2; 1; 0; 1; 2; 2; 1; 2; 1; 2; 3; 2; 1; 2; 1; 1; 2; 1; 0; 1; 2; 1; 2: Called a source sequence, it needs to be represented by or converted to a sequence of codewords or codes that are suitable for transmission over a variety of channels. The primary concern is that the average codeword length is minimized so that the transmission of the source sequence demands a lower bit rate.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
MacKay, D.J.C.: Information Theory, Inference and Learning Algorithms. Cambridge University Press, Cambridge (2003)
Sayood, K.: Introduction to Data Compression, second edn. Morgan Kaufmann, Burlington (2000)
Shannon, C.: A mathematical theory of communication. Bell System Technical Journal 27, 379–423 (1948)
Shannon, C.: A mathematical theory of communication. Bell System Technical Journal 27, 623–656 (1948)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer US
About this chapter
Cite this chapter
You, Y. (2010). Entropy and Coding. In: Audio Coding. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1754-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1754-6_8
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1753-9
Online ISBN: 978-1-4419-1754-6
eBook Packages: EngineeringEngineering (R0)