Generalized Capacity and Source-Channel Coding for Packet Erasure Channels

We study the transmission of a stationary ergodic Gaussian source over a packet erasure channel, which is a composite channel with degraded states. A broadcast channel code can be applied to a composite channel to obtain different rates in the different channel states. However, we show that a non-broadcast direct transmission strategy achieves a higher expected rate than the broadcast code, although it does not meet Shannon's definition of reliable communication since it does not guarantee which bits will be received. Each channel code has a matching source code: the multiresolution source code allows the broadcast channel code to transmit prioritized information, and the symmetric multiple description source code enables direct transmission of unprioritized information. The end-to-end expected distortions of these schemes are also compared.

[1]  Shlomo Shamai,et al.  Systematic Lossy Source/Channel Coding , 1998, IEEE Trans. Inf. Theory.

[2]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[3]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[4]  Deniz Gündüz,et al.  Joint Source–Channel Codes for MIMO Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[5]  Andrea J. Goldsmith,et al.  Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive Refinement , 2007, 2007 IEEE International Symposium on Information Theory.

[6]  Andrea J. Goldsmith,et al.  Capacity Definitions of General Channels with Receiver Side Information , 2007, 2007 IEEE International Symposium on Information Theory.

[7]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.

[8]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .

[9]  Madhu Sudan,et al.  Priority encoding transmission , 1996, IEEE Trans. Inf. Theory.

[10]  Daniela Tuninetti,et al.  Multiple Description Coding over Erasure Channels , 2008, 2008 IEEE International Conference on Communications.

[11]  Yifan Liang,et al.  Separation optimality and generalized source -channel coding for time -varying channels , 2008 .

[12]  Michelle Effros.  Distortion-rate bounds for fixed- and variable-rate multiresolution source codes , 1999, IEEE Trans. Inf. Theory.

[13]  A~nsw~dr.  The Weak Capacity of Averaged Channels , 1967 .

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  A. Goldsmith,et al.  Capacity definitions and coding strategies for general channels with receiver side information , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[16]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[17]  Raymond Knopp,et al.  On the performance of multiple description codes over bit error channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[18]  Kannan Ramchandran,et al.  n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes , 2004, IEEE Transactions on Information Theory.