STBCs with Reduced Sphere Decoding Complexity for Two-User MIMO-MAC

In this paper, Space-Time Block Codes (STBCs) with reduced Sphere Decoding Complexity (SDC) are constructed for two-user Multiple-Input Multiple-Output (MIMO) fading multiple access channels. In this set-up, both the users employ identical STBCs and the destination performs sphere decoding for the symbols of the two users. First, we identify the positions of the zeros in the R matrix arising out of the Q-R decomposition of the lattice generator such that (i) the worst case SDC (WSDC) and (ii) the average SDC (ASDC) are reduced. Then, a set of necessary and sufficient conditions on the lattice generator is provided such that the R matrix has zeros at the identified positions. Subsequently, explicit constructions of STBCs which results in the reduced ASDC are presented. The rate (in complex symbols per channel use) of the proposed designs is at most 2/Nt where Nt denotes the number of transmit antennas for each user. We also show that the class of STBCs from complex orthogonal designs (other than the Alamouti design) reduce the WSDC but not the ASDC.

[1]  B. Sundar Rajan,et al.  Finite signal-set capacity of two-user Gaussian Multiple Access Channel , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[3]  Yi Hong,et al.  On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.

[4]  B. Sundar Rajan,et al.  High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks , 2009, IEEE Transactions on Information Theory.

[5]  Xue-Bin Liang,et al.  Orthogonal designs with maximal rates , 2003, IEEE Trans. Inf. Theory.

[6]  John R. Barry,et al.  Fast maximum-likelihood decoding of the golden code , 2010, IEEE Transactions on Wireless Communications.

[7]  B. Sundar Rajan,et al.  Coding for two-user Gaussian MAC with PSK and PAM signal sets , 2009, 2009 IEEE International Symposium on Information Theory.

[8]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[9]  B. Sundar Rajan,et al.  Coding for Two-User SISO and MIMO Multiple Access Channels , 2009, ArXiv.

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

[11]  B.S. Rajan,et al.  Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 $\times$ 2 and 4 $\times$ 2 MIMO Systems , 2008, IEEE Journal of Selected Topics in Signal Processing.

[12]  Helmut Bölcskei,et al.  Multiuser Space-Time/Frequency Code Design , 2006, ISIT.

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

[14]  Il-Min Kim,et al.  Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks , 2006, IEEE Transactions on Information Theory.