A rate-3/2 full-diversity 4×4 space-time code with fast Maximum-Likelihood Decoding

Recently, Space-Time Block Codes (STBCs) with fast Maximum-Likelihood Decoding (MLD) have gained a lot of interest from a practical perspective. In [1] and [2], B. Rajan et.al proposed a systematic approach to build such codes from the representations of the real Clifford algebras. In the Sari-Sezginer code [8], another approach was proposed to build fast MLD STBC's. Indeed, the authors used the conditional detection principle and numerical optimization in order to have a large coding gain (thus full diversity) while maintaining a reduced complexity level at the receiver. In this paper we are interested in extending the principle of conditional detection to the case of four transmit antennas. We propose here a full-diversity 4×4 STBC achieving a rate of 3/2 complex symbols per channel use. To the best knowledge of the authors, the highest rate for full transmit diversity 4×4 codes with the same complexity level was reported to be 5/4 complex symbols per channel use (such codes were found independently in [10] and in [11]).

[1]  Chau Yuen,et al.  On the search for high-rate quasiorthogonal space-time block code , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[2]  Frédérique E. Oggier,et al.  Cyclic Division Algebras: A Tool for Space-Time Coding , 2007, Found. Trends Commun. Inf. Theory.

[3]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[4]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

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

[6]  Constantinos B. Papadias,et al.  Improved quasi-orthogonal codes through constellation rotation , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[7]  Yong Liang Guan,et al.  On the Search for High-Rate Quasi-Orthogonal Space–Time Block Code , 2006, Int. J. Wirel. Inf. Networks.

[8]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.

[9]  Serdar Sezginer,et al.  On High-Rate Full-Diversity 2 × 2 Space-Time Codes with Low-Complexity Optimum Detection , 2009, IEEE Transactions on Communications.

[10]  Serdar Sezginer,et al.  Full-rate full-diversity 2 x 2 space-time codes of reduced decoder complexity , 2007, IEEE Communications Letters.

[11]  B. Sundar Rajan,et al.  High-rate, 2-group ML-decodable STBCs for 2m transmit antennas , 2009, 2009 IEEE International Symposium on Information Theory.

[12]  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..

[13]  B. Sundar Rajan,et al.  Multigroup Decodable STBCs From Clifford Algebras , 2009, IEEE Transactions on Information Theory.

[14]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[15]  Pranav Dayal,et al.  An optimal two transmit antenna space-time code and its stacked extensions , 2005, IEEE Transactions on Information Theory.

[16]  B. Sundar Rajan,et al.  High-Rate, Multisymbol-Decodable STBCs From , 2009 .