n-Channel Asymmetric Multiple-Description Lattice Vector Quantization

Details n-Channel Asymmetric Multiple-Description Lattice Vector Quantization n-Channel Asymmetric Multiple-Description Lattice Vector Quantization

2005-08-02

arxiv.org/abs/cs/0508012v1

Computer Science

Information Theory

To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-

Scientific paper

We present analytical expressions for optimal entropy-constrained multiple-description lattice vector quantizers which, under high-resolutions assumptions, minimize the expected distortion for given packet-loss probabilities. We consider the asymmetric case where packet-loss probabilities and side entropies are allowed to be unequal and find optimal quantizers for any number of descriptions in any dimension. We show that the normalized second moments of the side-quantizers are given by that of an $L$-dimensional sphere independent of the choice of lattices. Furthermore, we show that the optimal bit-distribution among the descriptions is not unique. In fact, within certain limits, bits can be arbitrarily distributed.

Affiliated with

Also associated with

No associations

Rating

n-Channel Asymmetric Multiple-Description Lattice Vector Quantization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with n-Channel Asymmetric Multiple-Description Lattice Vector Quantization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and n-Channel Asymmetric Multiple-Description Lattice Vector Quantization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615481