Abstract

This paper shows that tree search encoders are ineffective when used to determine the closest code vector in residual quantizer (RQ) alphabets. In particular, the equivalent cell boundaries are poorly chosen and the labelling of equivalent code vectors produced by the decoder and by a tree-structured encoder are inconsistent. This problem does not arise when two-level RQ alphabets are used in trellis coded vector quantizers. Trellis-coded RQs are designed for the memoryless Gaussian, Laplacian, and Gauss-Markov sources at a rate of R=1 bit per sample with encouraging results; a SQNR of 5.92 dB has been achieved on the Gaussian source. >

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.