By Topic

Vector quantization with size-constrained codebooks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rao, R.P. ; Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA ; Pearlman, W.A. ; Finamore, W.A.

An algorithm for calculating lower bounds to the performance of all size-constrained vector quantizers has been derived earlier. Applications to the AR(1) source have shown that these lower bounds are very close to the actual rate-distortion curves, even for small sizes of the output alphabet. In this algorithm, however, the codebook changes with rate. In a number of applications it is desirable to operate with the same codebook. The authors modify the above algorithm to calculate lower bounds to the performance of all such multirate coders. An important conclusion is that constraining the codebook vectors does not degrade performance as compared to the size-only constrained case. The authors have proposed a practical alphabet and entropy constrained vector quantizer (AECVQ). This coder is obtained by modifying the ECVQ algorithm so that the codebook remains the same for all rates

Published in:

Telecommunications Symposium, 1990. ITS '90 Symposium Record., SBT/IEEE International

Date of Conference:

3-6 Sep 1990