Bit allocation and encoding for vector sources

作者: A. Segall

DOI: 10.1109/TIT.1976.1055533

关键词: Optimal allocationAlgorithmEntropy (information theory)Mathematical optimizationMathematicsBit allocationSource codeEncoderCommunication theoryStationary vectorChannel capacity

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

参考文章(6)
R. Wood, On optimum quantization IEEE Transactions on Information Theory. ,vol. 15, pp. 248- 252 ,(1969) , 10.1109/TIT.1969.1054285
T. Cover, Enumerative source encoding IEEE Transactions on Information Theory. ,vol. 19, pp. 73- 77 ,(1973) , 10.1109/TIT.1973.1054929
David Huffman, A Method for the Construction of Minimum-Redundancy Codes Proceedings of the IRE. ,vol. 40, pp. 1098- 1101 ,(1952) , 10.1109/JRPROC.1952.273898
Bennett Fox, Discrete Optimization Via Marginal Analysis Management Science. ,vol. 13, pp. 210- 216 ,(1966) , 10.1287/MNSC.13.3.210
J. Max, Quantizing for minimum distortion IEEE Transactions on Information Theory. ,vol. 6, pp. 7- 12 ,(1960) , 10.1109/TIT.1960.1057548
J. Huang, P. Schultheiss, Block Quantization of Correlated Gaussian Random Variables IEEE Transactions on Communications. ,vol. 11, pp. 289- 296 ,(1963) , 10.1109/TCOM.1963.1088759