Abstract

AbstractThis 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.