English

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

Information Theory 2009-08-11 v1 math.IT

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\textbf{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\textbf{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/Nt2/N_{t} where NtN_{t} 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

Cite

@article{arxiv.0908.1162,
  title  = {STBCs with Reduced Sphere Decoding Complexity for Two-User MIMO-MAC},
  author = {J. Harshan and B. Sundar Rajan},
  journal= {arXiv preprint arXiv:0908.1162},
  year   = {2009}
}

Comments

6 pages, to appear in the proceedings of IEEE GLOBECOM 2009

R2 v1 2026-06-21T13:33:40.661Z