Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme

In a slow-fading channel, how to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decode-and-forward (DF) schemes do not improve with the number of relays in terms of the diversity-multiplexing tradeoff (DMT) for multiplexing gains r higher than 0.5. In this work, the class of slotted amplify-and-forward (SAF) schemes is studied. First, an upper bound on the DMT for any SAF scheme with an arbitrary number of relays N and number of slots M is established. Then, a sequential SAF scheme that can exploit the potential diversity gain in the high multiplexing gain regime is proposed. More precisely, in certain conditions, the sequential SAF scheme achieves the proposed DMT upper bound which tends to the transmit diversity bound when M goes to infinity. In particular, for the two-relay case, the three-slot sequential SAF scheme achieves the proposed upper bound and outperforms the two-relay nonorthorgonal amplify-and-forward (NAF) scheme of Azarian for multiplexing gains r les 2/3. Numerical results reveal a significant gain of our scheme over the previously proposed AF schemes, especially in high spectral efficiency and large network size regime.

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

[2]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[3]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[4]  Jean-Claude Belfiore,et al.  Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel , 2005, IEEE Transactions on Information Theory.

[5]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

[6]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[7]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

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

[9]  Helmut Bölcskei,et al.  Fading relay channels: performance limits and space-time signal design , 2004, IEEE Journal on Selected Areas in Communications.

[10]  P. Vijay Kumar,et al.  Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks , 2005, ArXiv.

[11]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[12]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[13]  Patrick Mitran,et al.  Space-time diversity enhancements using collaborative communications , 2005, IEEE Transactions on Information Theory.

[14]  Aggelos Bletsas,et al.  A simple Cooperative diversity method based on network path selection , 2005, IEEE Journal on Selected Areas in Communications.

[15]  P. Vijay Kumar,et al.  Perfect space-time codes with minimum and non-minimum delay for any number of antennas , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

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

[17]  Shlomo Shamai,et al.  Transmitting to colocated users in wireless ad hoc and sensor networks , 2005, IEEE Transactions on Information Theory.

[18]  Pramod Viswanath,et al.  Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.