Optimization of the index assignments for multiple description vector quantizers

@article{Goertz2003OptimizationOT,
  title={Optimization of the index assignments for multiple description vector quantizers},
  author={Norbert Goertz and Pornchai Leelapornchai},
  journal={IEEE Trans. Commun.},
  year={2003},
  volume={51},
  pages={336-340}
}
The optimization criterion and a practically feasible new algorithm is stated for the optimization of the index assignments of a multiple-description unconstrained vector quantizer with an arbitrary number of descriptions. In the simulations, the index-optimized multiple-description vector quantizer achieves significant gains in source signal-to-noise ratio over scalar multiple description schemes. 

Figures and Tables from this paper

On index assignment and the design of multiple description quantizers
  • P. Yahampath
  • Computer Science
    2004 IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 2004
The practical design of multiple description quantizers for diversity-based communication is investigated. A simulated annealing based method is proposed for obtaining the optimal index assignment
Design of n-Channel Multiple Description Vector Quantizers
  • T. Andersson, M. Skoglund
  • Computer Science
    Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.
  • 2005
TLDR
A new design approach for multiple description vector quantizers over more than two channels using only one decoder is presented, inspired by the concept of channel optimized vector quantization.
Multiple Description Quantizer Design for Space-time Orthogonal Block Coded Channels
  • Yugang Zhou, W. Chan
  • Computer Science
    2007 IEEE International Symposium on Information Theory
  • 2007
TLDR
A scheme to optimize multiple description vector quantizers for space-time orthogonal block coded slow Rayleigh fading channels using an upper bound of the channel transition probability achieved by the MAP decoder is proposed.
INDEX MAPPING FOR ROBUST MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZER
TLDR
This thesis considers the construction of robust multiple description lattice vector quantizers (MDLVQ) by addressing the problem of designing an index mapping able to combat bit errors by proposing two methods to tackle this problem.
Multiple description quantizer design for multiple-antenna systems with MAP detection
TLDR
The proposed scheme of combining multiple description coding and space-time orthogonal block coding is shown to be superior to each individual coding scheme.
Design of low-resolution multiple description vector quantizers by means of the Self Organizing Maps
TLDR
This work shows that good multiple description VQ codebooks can be designed in a simple and efficient way by resorting to the Self-Organizing Maps algorithm, where just a few parameters must be reasonably selected.
Low-Complexity Multiple Description Vector Quantization With Constrained Central Codebook
  • Yugang Zhou, W. Chan
  • Computer Science
    2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings
  • 2006
TLDR
Two central-codebook-constrained MDVQ (CMDVQ) schemes are proposed to reduce the storage and search complexity and simulation results show that for low channel loss rates, a tradeoff exists between choosing CMDV Q for its low complexity and the conventional MDVZ for its higher signal-to-noise ratio (SNR) performance.
Multiple Description Image Coding Based on Multi-Stage Vector Quantization
  • T. Andersson, M. Skoglund
  • Computer Science
    2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers
  • 2007
A new design approach for multiple description coding, based on multi-stage vector quantizers, is presented. The design is not limited to systems with two descriptions, but is also well suited for
MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZATION MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZATION
TLDR
It is proved, under the assumption of high resolution, that the algorithm is optimal for K = 2, and the optimality holds for many commonly used good lattices of any dimensions, over the entire range of achievable central distortions given the side entropy rate.
...
...

References

SHOWING 1-8 OF 8 REFERENCES
Design of multiple description scalar quantizers
TLDR
The design of scalar quantizers for communication systems that use diversity to overcome channel impairments is considered and a design algorithm, a generalization of S.P. Lloyd's (1962) algorithm, is developed.
An Algorithm for Vector Quantizer Design
An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data. The basic properties of the
Multiple-description vector quantization with lattice codebooks: Design and analysis
TLDR
A general solution is given to a labeling problem which plays a crucial role in the design of L-dimensional vector quantizers and numerical performance results are obtained for quantizers based on the lattices A/sub 2/ and Z/sup i/, i=1, 2, 4, 8, that make use of this labeling algorithm.
Multiple description vector quantization with a coarse lattice
TLDR
This work alters the encoding of multiple description lattice vector quantization technique to improve performance without a significant increase in complexity by replacing the fine lattice codebook with a nonlattice code book that respects many of the symmetries of the coarse lattice.
Generalized multiple description vector quantization
  • M. Fleming, M. Effros
  • Computer Science
    Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)
  • 1999
TLDR
A new practical algorithm is presented, based on a ternary tree structure, for the design of both fixed- and variable-rate multiple description vector quantizers for an arbitrary number of channels, showing that they perform well under a wide range of packet loss scenarios.
A study of vector quantization for noisy channels
TLDR
It is concluded that the channel-optimized vector quantizer design algorithm, if used carefully, can result in a fairly robust system with no additional delay.
Pseudo-Gray coding
TLDR
The binary switching algorithm is introduced, based on the objective of minimizing a useful upper bound on the average system distortion, which yields a significant reduction in average distortion, and converges in reasonable running times.
On a source-coding problem with two channels and three receivers
  • L. Ozarow
  • Computer Science
    The Bell System Technical Journal
  • 1980
TLDR
This paper treats the problem of communicating a memoryless unit-variance Gaussian source to three receivers and obtains an expression for the simultaneously achievable distortions (mean-squared error) of this source.