Uniform scalar quantization of linear prediction coefficients with B bits is traditionally done by multiplying each coefficient with Q = 2B and rounding it to the nearest integer. We propose an improved, optimal quantization method by replacing the rounding with a more elaborated procedure. It uses on average 2 bits less per quantized prediction coefficient for a similar sum of squared errors and allows an accurate estimate of the mean squared error misadjustment as a function of Q for a given subframe and predictor order M. We introduce several efficient time-constrained probabilistic search methods for obtaining near optimal solutions. There are no required changes at the decoder and the method is applicable on a wider area of cases (mono, stereo, and multichannel prediction) than quantization of reflection coefficients. Moreover, the method enables near optimal compression for 24 bit audio using only 32 bit arithmetic operations.
Click to purchase paper as a non-member or you can login as an AES member to see more options.
No AES members have commented on this paper yet.
To be notified of new comments on this paper you can
subscribe to this RSS feed.
Forum users should login to see additional options.
If you are not yet an AES member and have something important to say about this paper then we urge you to join the AES today and make your voice heard. You can join online today by clicking here.
