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 rated istortion bound, and of sources related to a practical problem are discussed.
[1]
ROGER C. WOOD,et al.
On optimum quantization
,
1969,
IEEE Trans. Inf. Theory.
[2]
Thomas M. Cover,et al.
Enumerative source encoding
,
1973,
IEEE Trans. Inf. Theory.
[3]
Joel Max,et al.
Quantizing for minimum distortion
,
1960,
IRE Trans. Inf. Theory.
[4]
P. Schultheiss,et al.
Block Quantization of Correlated Gaussian Random Variables
,
1963
.
[5]
D. Huffman.
A Method for the Construction of Minimum-Redundancy Codes
,
1952
.
[6]
Bennett Fox,et al.
Discrete Optimization Via Marginal Analysis
,
1966
.