Abstract
The authors present a fast search algorithm for the encoding of variable-rate vector quantisers (VQs). The optimal encoder for the variable-rate full-search VQs considers both the squared distance and channel index length for the search of codewords. Therefore, the existing fast search algorithms for the fixed-rate full-search VQs might not be able to effectively reduce the computational complexities for the variable-rate VQs. An algorithm is presented which solves this problem using a two-stage search process. A large number of undesired codewords are removed at the first stage of the search with a small computational overhead. At the second stage, the optimal codeword are searched among the remaining codewords using the partial distance search technique in the transform domain. Simulation results show that the algorithm is more effective than other fast search algorithms for the variable-rate VQs.
Sign-in/Register to access full text options 
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 callMore From: IEE Proceedings - Vision, Image, and Signal Processing
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.
