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.
![]() |
PDF
Reduced.pdf - Published Version Restricted to Registered users only Download (237kB) | Request a copy |
Abstract
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.
Item Type: | Conference Paper |
---|---|
Series.: | IEEE International Symposium on Information Theory |
Publisher: | IEEE |
Additional Information: | Copyright 2010 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 01 Apr 2011 08:03 |
Last Modified: | 01 Apr 2011 08:04 |
URI: | http://eprints.iisc.ac.in/id/eprint/36379 |
Actions (login required)
![]() |
View Item |