Performance Analysis and Code Design for Cooperative Relay Channels

We treat the LDPC code design for relay channels in this paper. The capacity of relay channels has been analyzed in current literature. How to approach such capacity with the aid of good codes is, however, a challenging problem. An efficient structure is proposed to decouple the factor graph (FG) of a B-block transmission into successive partial FGs, and then, the code design can be performed over the partial FG. Based on this efficient structure, we develop the approaches to find the optimum code ensemble. In particular, we formulate the relay and the destination operations as virtual multiple-antenna channels. Moreover, we develop the approaches based on the binary symmetric channel modelling for the relay and Gaussian approximation to fast estimate the extrinsic mutual information of the destination detector output. Then we can analyze the performance of the relay system using the EXIT technique. Differential evolution is employed to search for the optimum code ensemble. Extensive simulations are further carried out to show the results of the proposed optimum code design.

[1]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

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

[3]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[4]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[5]  M.A. Khojastepour,et al.  Code design for the relay channel and factor graph decoding , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

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

[7]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

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

[9]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

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