Abstract: Abstract This paper presents a new “ordering” based suboptimal vector quantization, the successive approximation vector quantization (SAVQ). It is found that the SAVQ algorithm can be reduced to the bit arrangement mapping from vector to scalar followed by the scalar quantization. Therefore the SAVQ requires no calculation of distortion. However, the tree search vector quantization (TSVQ), another suboptimal VQ, does require calculation of distortion. This allows the real time vector quantizer to be implemented with significantly less hardware complexity than TSVQ. For the source with exponential density, the simulation results demonstrate that SAVQ provides the mean‐squared‐error equal to or less than that obtained by TSVQ.
Publication Year: 1986
Publication Date: 1986-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot