Title :
n-channel symmetric multiple descriptions-part II:An achievable rate-distortion region
Author :
Puri, Rohit ; Pradhan, S. Sandeep ; Ramchandran, Kannan
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA
fDate :
4/1/2005 12:00:00 AM
Abstract :
In this Part II of a two-part paper, we present a new achievable rate-distortion region for the symmetric n-channel multiple-descriptions coding problem (n>2) where the rate of every description is the same, and the reconstruction distortion depends only on the number of descriptions received. Using a new approach for the random coding constructions, along with a generalization of the technique used in the two-channel El Gamal and Cover region to any n, the rate region presented here achieves points that have not been known in the literature previously. This rate region is derived from a concatenation of source-channel erasure codes developed in Part I of this work by deploying the framework of source coding with side information ("random binning"). The key idea is that by using the framework of source coding with side information, multiple statistically identical realizations representing the coarse version of a source can be simultaneously refined by a single encoding. We point out that there is an important conceptual difference in random coding construction for the multiple-descriptions coding problem between the case of n=2 and n>2. To illustrate the framework, we also present the important case of the Gaussian source in detail.
Keywords :
combined source-channel coding; random codes; rate distortion theory; Gaussian source; MDS erasure codes; achievable rate-distortion region; maximum-distance separable; multiple statistically identical realization; multiple-descriptions coding problem; n-channel symmetric multiple descriptions; random coding; source-channel erasure codes; Decoding; Distortion measurement; Information theory; Rate-distortion; Robustness; Source coding; Maximum-distance separable (MDS) erasure codes; multiple descriptions coding; random binning; source– channel erasure codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2005.844063