Effect of ordering the codebook on the efficiency of the partial distance search algorithm for vector quantization

Author

Paliwal, K.K. ; Ramasubramanian, V.

Author_Institution

Comput. Res. & Commun. Group, Tata Inst. of Fundamental Res., Bombay, India

Volume

37

Issue

5

fYear

1989

fDate

5/1/1989 12:00:00 AM

Firstpage

538

Lastpage

540

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

analogue-digital conversion; computational complexity; encoding; picture processing; signal processing; speech analysis and processing; codebook ordering; codevectors ordering; computational complexity; image coding; minimum distortion encoding; partial distance search algorithm; signal processing; speech coding; vector quantization; Bit rate; Clustering algorithms; Computational complexity; Distortion measurement; Encoding; Image coding; Speech coding; Speech recognition; Testing; Vector quantization;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.24608

Filename

24608