Multiple description quantization via Gram-Schmidt orthogonalization

被引:47
作者
Chen, Jun [1 ]
Tian, Chao [1 ]
Berger, Toby [1 ]
Hemami, Sheila S. [1 ]
机构
[1] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14853 USA
基金
美国国家科学基金会;
关键词
Gram-Schmidt orthogonalization; lattice quantization; minimum mean-square error (MMSE); multiple descriptions (MDs); quantization splitting;
D O I
10.1109/TIT.2006.885498
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The multiple description (MD) problem has received considerable attention as a model of information transmission over unreliable channels. A general framework for designing efficient MD quantization schemes is proposed in this paper. We provide a systematic treatment of the El Gamal-Cover (FGC) achievable MD rate-distortion region, and show it can be decomposed into a simplified-EGC (SEGC) region and a superimposed refinement operation. Furthermore, any point in the SEGC region can be achieved via a successive quantization scheme along with quantization splitting. For the quadratic Gaussian case, the proposed scheme has an intrinsic connection with the Gram-Schmidt orthogonalization, which implies that the whole Gaussian MD rate-distortion region is achievable with a sequential dithered lattice-based quantization scheme as the dimension of the (optimal) lattice quantizers becomes large. Moreover, this scheme is shown to be universal for all independent and identically distributed (i.i.d.) smooth sources with performance no worse than that for an i.i.d. Gaussian source with the same variance and asymptotically optimal at high resolution. A class of MD scalar quantizers in the proposed general framework is also constructed and is illustrated geometrically; the performance is analyzed in the high-resolution regime, which exhibits a noticeable improvement over the existing MD scalar quantization schemes.
引用
收藏
页码:5197 / 5217
页数:21
相关论文
共 68 条
[1]   ON MULTIPLE DESCRIPTIONS AND TEAM GUESSING [J].
AHLSWEDE, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (04) :543-549
[3]  
[Anonymous], 2003, PROC 41 ANN ALLERTON
[4]  
[Anonymous], 1973, 2 INT S INF THEOR
[5]   Index assignment for two-channel quantization [J].
Balogh, J ;
Csirik, JA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (11) :2737-2751
[6]   UPPER BOUND ON THE RATE DISTORTION FUNCTION FOR SOURCE CODING WITH PARTIAL SIDE INFORMATION AT THE DECODER [J].
BERGER, T ;
HOUSEWRIGHT, KB ;
OMURA, JK ;
TUNG, S ;
WOLFOWITZ, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (06) :664-666
[7]   MINIMUM BREAKDOWN DEGRADATION IN BINARY SOURCE ENCODING [J].
BERGER, T ;
ZHANG, Z .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (06) :807-814
[8]  
Berger T., 1978, The Information Theory Approach to Communications, P171
[9]   Index assignment for multichannel communication under failure [J].
Berger-Wolf, TY ;
Reingold, EM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (10) :2656-2668
[10]  
CARLEIAL AB, 1975, THESIS STANFORD U ST