Abstract

Design algorithms are presented for linear predictive vector quantizers with trellis structures that, when combined with appropriate search procedures, can achieve lower distortions than conventional memoryless vector quantizers. Two types of trellis structures, shift register and minimum degradation network, are considered. In the shift register case (SR-TVQ), the state of the trellis encoder corresponds to the content of the shift register; it therefore does not require an explicit state-transition matrix. The minimum degradation network is a state-transition matrix obtained through a pruning procedure (P-TVQ) to give minimum distortion degradation for an omnisearch (full-rate) vector quantizer. The role of the search procedure, the delay requirements of each type of encoder, and the performance of the designs are discussed and the two methods are compared.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.