ASYMPTOTIC ANALYSIS OF MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZATION

Recent results have shown that general K-channel multiple-description-coding (MDC) approaches often have significant advantages over conventional twochannel MDC methods. We provide new asymptotic results to describe the performance of a general K-channel symmetric MDC lattice vector quantizer (MDLVQ). We consider a memoryless L-dimensional source with probability density function f and differential entropy h(f) <∞. We control the redundancy with a parameter a ∈ (0, 1) and consider a symmetric MDC with a K-tuple of {R, R, · · · , R} as side quantizer rates. We show that if κ out of K descriptions are received, then the central distortion D and the side distortions D satisfy lim R→∞ D(K,K)22R[1+a(K−1)] = G(Λ)2, lim R→∞ D(K,κ)22R(1−a) = C(K, κ)G(SKL−L)2, where C(K, κ) = K−κ κ K − K K−1 . G(Λ) is the normalized second moment of a Voronoi cell of the lattice Λ and G(SKL−L) is the normalized second moment of a sphere in KL − L dimensions. We use our results to illustrate some relevant trade-offs that are made in configuring an MDC.

[1]  Jesper Jensen,et al.  n-channel entropy-constrained multiple-description lattice vector quantization , 2006, IEEE Transactions on Information Theory.

[2]  Xiaolin Wu,et al.  Optimal index assignment for multiple description lattice vector quantization , 2006, Data Compression Conference (DCC'06).

[3]  N. J. A. Sloane,et al.  Multiple-description vector quantization with lattice codebooks: Design and analysis , 2001, IEEE Trans. Inf. Theory.

[4]  Vinay A. Vaishampayan,et al.  Design of multiple description scalar quantizers , 1993, IEEE Trans. Inf. Theory.

[5]  Vinay A. Vaishampayan,et al.  Asymptotic Analysis of Multiple Description Quantizers , 1998, IEEE Trans. Inf. Theory.

[6]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7]  Chao Tian,et al.  Universal multiple description scalar quantization: analysis and design , 2004, IEEE Transactions on Information Theory.

[8]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

[9]  W. Bastiaan Kleijn,et al.  Adaptive resolution-constrained scalar multiple-description coding , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[10]  Edward M. Reingold,et al.  Index assignment for multichannel communication under failure , 2000, IEEE Trans. Inf. Theory.

[11]  Allen Gersho,et al.  Asymptotically optimal block quantization , 1979, IEEE Trans. Inf. Theory.