An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization
作者： Chang-Da Bei , R. Gray
DOI: 10.1109/TCOM.1985.1096214
关键词: Distortion 、 Reduction (complexity) 、 Vector quantization 、 Algorithm 、 Quantization (signal processing) 、 Encoding (memory) 、 Linde–Buzo–Gray algorithm 、 Mathematics 、 Simple (abstract algebra) 、 Theoretical computer science 、 Tree (data structure)
摘要: In this note we present a very simple method for improving the efficiency of minimum distortion encoding vector quantization. Simulations indicates reduction up to 70 percent in number multiplications full search quantizer with large codewords, and about 25-40 tree quantizer. Similar improvement can be achieved other quantization systems.
sci-hub.se 参考文章(2)
A. Gersho, V. Cuperman, Vector quantization: A pattern-matching technique for speech coding IEEE Communications Magazine. ,vol. 21, pp. 15- 21 ,(1983) , 10.1109/MCOM.1983.1091516
R. Gray, Vector quantization IEEE Assp Magazine. pp. 75- 100 ,(1984)