DocumentCode :
1693729
Title :
STBCs with Reduced Sphere Decoding Complexity for Two-User MIMO-MAC
Author :
Harshan, J. ; Rajan, B. Sundar
Author_Institution :
Dept of ECE, Indian Inst. of Sci., Bangalore, India
fYear :
2009
Firstpage :
1
Lastpage :
6
Abstract :
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.
Keywords :
MIMO communication; access protocols; block codes; fading channels; space-time codes; STBC; fading multiple access channels; reduced sphere decoding complexity; space-time block codes; two-user MIMO-MAC; Block codes; Covariance matrix; Fading; Lattices; MIMO; Matrix decomposition; Maximum likelihood decoding; Sufficient conditions; Symmetric matrices; Variable speed drives;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
Conference_Location :
Honolulu, HI
ISSN :
1930-529X
Print_ISBN :
978-1-4244-4148-8
Type :
conf
DOI :
10.1109/GLOCOM.2009.5425864
Filename :
5425864
Link To Document :
بازگشت