Abstract

Simple but effective fast codebook searching algorithms for vector quantisation are presented. The Euclidean distance (L/sub 2/ norm) calculation requires a number of multiplications. The proposed algorithms use the L/sub 1/ norm between the input vector and codeword to discard many unlikely codewords. Since the proposed algorithms significantly reduce the number of multiplications, a considerable reduction in encoding time is achieved. Simulation results confirm the effectiveness of the proposed algorithms.

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.