Low-Complexity SQR-Based Decoding Algorithm for Quasi-Orthogonal Space-Time Block Codes

In this paper, we propose a new decoding algorithm for quasiorthogonal space-time block codes (QOSTBCs) which achieves near maximum likelihood (ML) performance while substantially reducing the decoding complexity. We show that for a system with rate r = ns/T, where ns is the number of transmitted symbols per T time slots; the proposed algorithm decomposes the original complex-valued system into a parallel system with ns 2times2 real-valued components, thus allowing for a simple decoding of one real symbol at a time. For a square QAM constellation with L points (L-QAM), this algorithm achieves full diversity by properly incorporating two-dimensional rotation using the optimal rotation angle and the same rotating matrix for any number of transmit antennas (Nges4). We show that the complexity of this algorithm is linear with the number of transmitted symbols ns, and is independent of the constellation size L.

[1]  Il-Min Kim,et al.  Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes , 2006, IEEE Transactions on Communications.

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

[3]  K. Kammeyer,et al.  Efficient algorithm for decoding layered space-time codes , 2001 .

[4]  Georgios B. Giannakis,et al.  Sphere decoding algorithms with improved radius search , 2005, IEEE Trans. Commun..

[5]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[6]  Inkyu Lee,et al.  An Efficient Decoding Algorithm for STBC with Multi-dimensional Rotated Constellations , 2006, 2006 IEEE International Conference on Communications.

[7]  Chau Yuen,et al.  Quasi-orthogonal STBC with minimum decoding complexity: further results , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[8]  Hamid Jafarkhani,et al.  Space-Time Coding - Theory and Practice , 2010 .

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

[10]  Ender Ayanoglu,et al.  Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[11]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[12]  Chau Yuen,et al.  Quasi-orthogonal STBC with minimum decoding complexity , 2005, IEEE Transactions on Wireless Communications.

[13]  Wolfgang Rave,et al.  On the Complexity of Sphere Decoding , 2004 .

[14]  Emanuele Viterbo,et al.  Good lattice constellations for both Rayleigh fading and Gaussian channels , 1996, IEEE Trans. Inf. Theory.

[15]  Emanuele Viterbo,et al.  Signal Space Diversity: A Power- and Bandwidth-Efficient Diversity Technique for the Rayleigh Fading Channel , 1998, IEEE Trans. Inf. Theory.

[16]  Hamid Jafarkhani.  A quasi-orthogonal space-time block code , 2001, IEEE Trans. Commun..

[17]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.