Wyner-Ziv coding for the half-duplex relay channel

Cover and El Gamal derived the tightest bounds on the capacity of the relay channel using random coding and proposed two coding strategies, namely decode-and-forward (DF) and compress-and-forward (CF), to provide the best known lower bounds of the achievable rate region. Depending on transmission parameters, either DF or CF could be superior. Several practical code designs based on DF have appeared recently. We present the first practical CF design for the half-duplex Gaussian relay channel based on Wyner-Ziv coding of the received source signal at the relay. Assuming ideal source and channel coding, our design achieves the lower bound of CF. It thus realizes the performance gain of CF over DF promised by the theory when the relay is close to the destination. Our practical implementation based on LDPC codes for error protection at the source and nested scalar quantization and IRA (irregular repeat-accumulate) codes for Wyner-Ziv coding at the relay comes as close as 0.76 dB to the theoretical limit of CF.

[1]  Junshan Zhang,et al.  Capacity Bounds and Power Allocation for the Wireless Relay Channel , 1990 .

[2]  Matthew C. Valenti,et al.  Distributed turbo codes: towards the capacity of the relay channel , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[3]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[4]  Elza Erkip,et al.  Cooperative coding for wireless networks , 2004, IEEE Trans. Commun..

[5]  Ashutosh Sabharwal,et al.  On capacity of Gaussian 'cheap' relay channel , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[6]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[7]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[8]  Zixiang Xiong,et al.  Joint source-channel coding of binary sources with side information at the decoder using IRA codes , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..

[9]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[10]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[11]  Zixiang Xiong,et al.  Distributed source coding for sensor networks , 2004, IEEE Signal Processing Magazine.

[12]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[13]  Aria Nosratinia,et al.  Coded cooperation in wireless communications: space-time transmission and iterative decoding , 2004, IEEE Transactions on Signal Processing.

[14]  Philip Schniter,et al.  Achievable diversity-vs-multiplexing tradeoffs in half-duplex cooperative channels , 2004, Information Theory Workshop.

[15]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[16]  Zheng Zhang,et al.  Capacity-approaching turbo coding and iterative decoding for relay channels , 2005, IEEE Transactions on Communications.