Fractional Cooperation using Coded Demodulate-and-Forward

Since the introduction of cooperative diversity, many different implementations have been proposed to increase the reliability and/or power efficiency of distributed networks via relaying. One simple and flexible scheme introduced is coded demodulate-and-forward, where the relay only demodulates, instead of decodes, the received data, to create and forward a new codeword to the destination. This reduces the complexity of hardware as well as the energy consumption by the relay. In this paper, we consider another flexible feature of the coded demodulate-and-forward scheme, where the relay uses only a fraction of its codeword to assist the source, and saves the rest of the codeword for transmitting its own information. Previous schemes have generally focused on all-or-nothing cooperation where a relay either contributes all its resources or none at all to the source. Depending on the channel conditions, improved diversity order of the source codeword can be achieved with some small loss in the relay's own transmission performance. Here we identify the necessary criterion for the source to achieve a diversity order of 2.

[1]  J. Nicholas Laneman,et al.  Modulation and demodulation for cooperative diversity in wireless systems , 2006, IEEE Transactions on Wireless Communications.

[2]  Matthew C. Valenti,et al.  Distributed turbo coded diversity for relay channel , 2003 .

[3]  Yongyi Mao,et al.  Rateless coding over fading channels , 2006, IEEE Communications Letters.

[4]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[5]  Raviraj S. Adve,et al.  Cooperative diversity using message passing in wireless sensor networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

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

[7]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

[8]  Gregory W. Wornell,et al.  An efficient protocol for realizing cooperative diversity in wireless networks , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[9]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

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

[11]  Aria Nosratinia,et al.  Performance analysis of coded cooperation diversity , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[12]  Raviraj S. Adve,et al.  Low-Complexity Cooperative Coding for Sensor Networks using Rateless and LDGM Codes , 2006, 2006 IEEE International Conference on Communications.

[13]  Jaekyun Moon,et al.  A low-density generator matrix interpretation of parallel concatenated single bit parity codes , 2001 .

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

[15]  R.S. Adve,et al.  A Practical Scheme for Relaying in Sensor Networks Using Repeat-Accumulate Codes , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[16]  Dariush Divsalar,et al.  Maximum likelihood decoding analysis of accumulate-repeat-accumulate codes , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[17]  Yongyi Mao,et al.  Rateless coding for wireless relay channels , 2005, ISIT.

[18]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[19]  Aria Nosratinia,et al.  CTH13-2: Relay Channel with Private Messages , 2006, IEEE Globecom 2006.