Bit Allocation and Encoding for Vector Sources

Adrian Segall

Research output: Contribution to journalArticlepeer-review

121 Scopus citations

Abstract

This paper considers the problem of efficient transmission of vector sources over a digital noiseless channel. It treats the problem of optimal allocation of the total number of available bits to the components of a memoryless stationary vector source with independent components. This allocation is applied to various encoding schemes, such as minimum mean-square error, sample by sample quantization, or entropy quantization, We also give the optimally decorrelating scheme for a source whose components are dependent and treat the problems of selecting the optimum characteristic of the encoding scheme such that the overall mean-squared error is minimized. Several examples of encoding schemes, including the ideal encoder that achieves the ratedistortion bound, and of sources related to a practical problem are discussed.

Original languageEnglish
Pages (from-to)162-169
Number of pages8
JournalIEEE Transactions on Information Theory
Volume22
Issue number2
DOIs
StatePublished - Mar 1976
Externally publishedYes

Fingerprint

Dive into the research topics of 'Bit Allocation and Encoding for Vector Sources'. Together they form a unique fingerprint.

Cite this