TY - GEN
T1 - On the symmetric Gaussian multiple description rate-distortion function
AU - Tian, Chao
AU - Mohajer, Soheil
AU - Diggavi, Suhas
PY - 2008
Y1 - 2008
N2 - We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the main contributions of this work is a novel lower bound on the sum rate under symmetric distortion constraints, which yields a lower bound on the individual rate for the symmetric case. Two upper bounds are derived, the first of which is based on successive refinement coding coupled with multilevel diversity coding (SR-MLD), and the second is based on the multi-layer coding scheme proposed in literature. We show that the gaps between the lower bound and the upper bounds are no larger than certain constants depending only on the number of descriptions, but not the distortion constraints. Moreover, regardless of the number of descriptions, the gap between the lower bound and the upper bound using the SR-MLD coding scheme is less than 1.5 bits, and for the other case, the gap is less than 1 bit.
AB - We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the main contributions of this work is a novel lower bound on the sum rate under symmetric distortion constraints, which yields a lower bound on the individual rate for the symmetric case. Two upper bounds are derived, the first of which is based on successive refinement coding coupled with multilevel diversity coding (SR-MLD), and the second is based on the multi-layer coding scheme proposed in literature. We show that the gaps between the lower bound and the upper bounds are no larger than certain constants depending only on the number of descriptions, but not the distortion constraints. Moreover, regardless of the number of descriptions, the gap between the lower bound and the upper bound using the SR-MLD coding scheme is less than 1.5 bits, and for the other case, the gap is less than 1 bit.
UR - http://www.scopus.com/inward/record.url?scp=50249093331&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50249093331&partnerID=8YFLogxK
U2 - 10.1109/DCC.2008.48
DO - 10.1109/DCC.2008.48
M3 - Conference contribution
AN - SCOPUS:50249093331
SN - 0769531210
SN - 9780769531212
T3 - Data Compression Conference Proceedings
SP - 402
EP - 411
BT - Proceedings - 2008 Data Compression Conference, DCC 2008
T2 - 2008 Data Compression Conference, DCC 2008
Y2 - 25 March 2008 through 27 March 2008
ER -