Effect of ordering the codebook on the efficiency of the partial distance search algorithm for vector quantization
- 1 May 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 37 (5) , 538-540
- https://doi.org/10.1109/26.24608
Abstract
Recently, C.D. Bei and R.M. Gray (1985) used a partial distance search algorithm that reduces the computational complexity of the minimum distortion encoding for vector quantization. The effect of ordering the codevectors on the computational complexity of the algorithm is studied. It is shown that the computational complexity of this algorithm can be reduced further by ordering the codevectors according to the sizes of their corresponding clusters. >Keywords
This publication has 4 references indexed in Scilit:
- An improvement of the minimum distortion encoding algorithm for vector quantizationIEEE Transactions on Communications, 1985
- Vector quantization in speech codingProceedings of the IEEE, 1985
- Vector quantizationIEEE ASSP Magazine, 1984
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980