Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems
Data(s) |
2010
|
---|---|
Resumo |
For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), 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 n(r) < 4. For any value of n(r), 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 n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/36379/1/Reduced.pdf Srinath, Pavan K and Rajan, Sundar B (2010) Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems. In: 2010 IEEE International Symposium on Information Theory, JUL 13, 2010, Austin, TX, pp. 2228-2232. |
Publicador |
IEEE |
Relação |
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5513490 http://eprints.iisc.ernet.in/36379/ |
Palavras-Chave | #Electrical Communication Engineering |
Tipo |
Conference Paper PeerReviewed |