Reduced ML-Decoding Complexity, Full-Rate STBCs for 2^a Transmit Antenna Systems

2010/01/12 by K. Pavan Srinath, Srinath, K. Pavan, B. Sundar Rajan +1
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research

paper · pdf · doi:10.48550/arxiv.1001.1872

openalex publication_date 2010/01/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For an n_t transmit, n_r receive antenna system (n_t × n_r system), a \itfull-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 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.

Related

• Reduced ML-Decoding Complexity, Full-Rate STBCs for 2^a Transmit Antenna Systems
• Low ML Decoding Complexity STBCs via Codes over GF(4)
• Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs
• Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems
• High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras