Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel

In this work, we extend the nonorthogonal amplify-and-forward (NAF) cooperative diversity scheme to the multiple-input multiple-output (MIMO) channel. A family of space-time block codes for a half-duplex MIMO NAF fading cooperative channel with N relays is constructed. The code construction is based on the nonvanishing determinant (NVD) criterion and is shown to achieve the optimal diversity-multiplexing tradeoff (DMT) of the channel. We provide a general explicit algebraic construction, followed by some examples. In particular, in the single-relay case, it is proved that the Golden code and the 4times4 Perfect code are optimal for the single-antenna and two-antenna cases, respectively. Simulation results reveal that a significant gain (up to 10 dB) can be obtained with the proposed codes, especially in the single-antenna case

[1]  M. Alvo,et al.  Complex random matrices and Rayleigh channel capacity , 2003, Commun. Inf. Syst..

[2]  Jean-Claude Belfiore,et al.  Optimal Space-Time Codes for the MIMO Amplify-and-Forward Cooperative Channel , 2006 .

[3]  Antonia Maria Tulino,et al.  Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.

[4]  J. Belfiore,et al.  Optimal Space-Time Codes for the Amplify-and-Forward Cooperative Channel , 2005 .

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

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

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

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

[9]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[10]  Aria Nosratinia,et al.  Diversity through coded cooperation , 2006, IEEE Transactions on Wireless Communications.

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

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

[13]  Aria Nosratinia,et al.  Outage analysis of coded cooperation , 2006, IEEE Transactions on Information Theory.

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

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

[16]  Jean-Claude Belfiore,et al.  Quaternionic lattices for space-time coding , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[17]  Emanuele Viterbo,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[18]  P. Vijay Kumar,et al.  Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeo , 2004 .

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

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

[21]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[23]  Hofreiter.  Structure of algebras , 1941 .

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