Multiuser Successive Refinement and Multiple Description Coding
We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct the source in a successive-refinement fashion.An achievable region is given for the two-user, twolayer case and it provides the complete rate-distortion region for the Gaussian source under the MSE distortion measure. The key observation is that this problem includes multiple description (MD) coding as a subsystem, and the techniques useful in the MD problem can be extended to this case. We show that the coding scheme based on the universality of random binning is sub-optimal, because multiple Gaussian side informations only at the decoders do incur performance loss, in contrast to the case of single side information at the decoder. We further show that unlike the single user case, when there are multiple users, the loss of performance by a multistage coding approach can be unbounded for the Gaussian source.The result suggests that in such a setting, the benefit of using successive refinement is not likely to justify the accompanying performance loss.
Chao Tian Jun Chen Suhas N.Diggavi
Laboratory for Information and Communication Systems (LICOS) School of Computer and Communication Sc IBM T.J.Watson Research Center Yorktown Heights, NY 10598
国际会议
2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)
成都
英文
293-297
2006-10-22（万方平台首次上网日期，不代表论文的发表时间）