Title :
Reduced ML-decoding complexity, full-rate STBCs for 4 transmit antenna systems
Author :
Srinath, K. Pavan ; Rajan, B. Sundar
Author_Institution :
Dept of ECE, Indian Inst. of Sscience, Bangalore, India
Abstract :
For an nt transmit, nr receive antenna system (nt × nr system), a full-rate space time block code (STBC) transmits min (nt, nr) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any nr, with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for nr <; 4. For any value of nr, the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when nr <; 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.
Keywords :
MIMO communication; antenna arrays; block codes; communication complexity; matrix algebra; maximum likelihood decoding; receiving antennas; space-time codes; transmitting antennas; Clifford algebra; ML-decoding complexity; full-rate space time block code; high ergodic capacity; punctured perfect code; receive antenna system; transmit antenna systems; unitary matrix representations; weight matrices; Algebra; Block codes; Degradation; MIMO; Maximum likelihood decoding; OFDM; Propagation losses; Quadrature amplitude modulation; Receiving antennas; Transmitting antennas;
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
DOI :
10.1109/ISIT.2010.5513490