Pavan Srinath, K. ; Sundar Rajan, B. (2010) Reduced ML-decoding complexity, full-rate STBCs for 4 transmit antenna systems In: 2010 IEEE International Symposium on Information Theory, 13-18 Jun 2010, Austin, TX, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/5513490/
Related URL: http://dx.doi.org/10.1109/ISIT.2010.5513490
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 110644 |
| Deposited On: | 08 Dec 2017 10:23 |
| Last Modified: | 08 Dec 2017 10:23 |
Repository Staff Only: item control page
