We propose a compression/transmission scheme that allows the quality of the reconstructed signal to gracefully degrade as the channel quality drops, as well as steadily improve with the channel improvement. The main idea is to partition the channel and/or network resources into m units (e.g., sub-bands, packets) and compress the source independently m times to perfectly match single unit resources, thus creating m independently distorted source versions. Consequently, we create a multiple-description, joint source-channel like architecture, that enables efficient reconstruction starting from a single received description with improvements onward. We further split the compression rate in two parts, allocating one to a rate-distortion optimal encoder, and the other to transmitting uncoded source symbols. We show how this architecture can easily leverage modularity in terms of adjustable rate-splitting ratio and the maximum number of descriptions, e.g., through software parameters, to simultaneously and robustly (i.e. avoiding the cliff effect) achieve operating points close to rate-distortion curve for many channel states. We demonstrate how statistical description of channel states (or performance statistics of content delivery network) can be used to set the two parameters constructively in terms of converging to optimal operation in the range of interest.
[1]
Jacob Ziv,et al.
On universal quantization
,
1985,
IEEE Trans. Inf. Theory.
[2]
Dina Katabi,et al.
SoftCast: one-size-fits-all wireless video
,
2010,
SIGCOMM '10.
[3]
Ebad Ahmed,et al.
Binary erasure multiple descriptions: Average-case distortion
,
2009,
2009 IEEE Information Theory Workshop on Networking and Information Theory.
[4]
Vivek K. Goyal,et al.
Multiple description coding with many channels
,
2003,
IEEE Trans. Inf. Theory.
[5]
Kannan Ramchandran,et al.
n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes
,
2004,
IEEE Transactions on Information Theory.
[6]
Kannan Ramchandran,et al.
n-channel symmetric multiple descriptions-part II:An achievable rate-distortion region
,
2005,
IEEE Transactions on Information Theory.
[7]
Jessica J. Fridrich,et al.
Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes
,
2007,
ArXiv.
[8]
Chao Tian,et al.
New Coding Schemes for the Symmetric $K$-Description Problem
,
2010,
IEEE Transactions on Information Theory.
[9]
Vivek K. Goyal,et al.
Multiple description coding: compression meets the network
,
2001,
IEEE Signal Process. Mag..