Effect of ordering the codebook on the efficiency of the partial distance search algorithm for vector quantization
Kuldip K. Paliwal, Viswanathan Ramasubramanian · IEEE Transactions on Communications · 1989
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.>