Abstract
The optimal joint decoder utilizing NLIVQ (nonlinear interpolative vector quantization) introduced by Gersho [1990] results in vector quantizers which have reduced encoding complexity at the expense of coding performance loss due to the inferiority of their space-filling property. We show a method of improving a high resolution NLIVQ codebook by partitioning its cells in such a way that the resulting lower resolution codebook consists of cells with better space-filling properties. The resolution reduction method is also extended to the case where the quantizer indices are entropy-constrained. From the simulations it is seen that the unconstrained and constrained entropy versions of the proposed vector quantizer have comparable performance to vector quantizers designed by LEG and ECVQ algorithms.
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 callDisclaimer: 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.
