By Topic

Optimal Index Assignment for Multiple Description Scalar Quantization With Translated Lattice 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)
Guoqiang Zhang ; Dept. of Intell. Syst., Delft Univ. of Technol., Delft, Netherlands ; Klejsa, J. ; Kleijn, W.B.

We design a K-description scalar quantizer, whose construction is based on a structure of translated scalar lattices and a lattice in K - 1 dimensional space. The use of translated lattices provides a performance advantage by exploiting a so-called staggering gain. The use of the K -1 dimensional lattice facilitates analytic insight into the performance and significantly speeds up the computation of the index assignment compared to state-of-the-art methods. Using a common decoding method, the proposed index assignment is proven to be optimal for the K-description case. It is shown that the optimal index assignment is not unique. This is illustrated for the two-description case, where a periodic index assignment is selected from possible optimal assignments and described in detail. The performance of the proposed quantizer accurately matches theoretic analysis over the full range of operational redundancies. Moreover, the quantizer outperforms the state-of-the-art MD scheme as the redundancy among the description increases.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 8 )