Low ML Decoding Complexity STBCs via Codes over GF(4)

2010/08/15 by Natarajan, Lakshmi Prasad, B. Sundar Rajan, Rajan, B. Sundar
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1008.2526

openalex publication_date 2010/08/15 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field \mathbbF₄. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over \mathbbF₄, for number of transmit antennas N=2^m, m ≥ 1, and rates R>1 complex symbols per channel use. When R=N, the new STBCs are information-lossless as well. The new class of STBCs have the least known ML decoding complexity among all the codes available in the literature for a large set of (N,R) pairs.

Related

• Reduced ML-Decoding Complexity, Full-Rate STBCs for 2^a Transmit Antenna Systems
• A New Family of Low-Complexity STBCs for Four Transmit Antennas
• Reduced ML-Decoding Complexity, Full-Rate STBCs for 2^a Transmit Antenna Systems
• Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems
• Revisited Design Criteria For STBCs With Reduced Complexity ML Decoding