On Fast-Decodable Space-Time Block Codes

2007/08/21 by E. Biglieri, Yi Hong, Biglieri, Ezio +3
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #E.4 #Error Correcting Code Techniques #FOS: Computer and information sciences #H.1.1 #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.0708.2804

openalex publication_date 2007/08/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a unified analysis of two families of 2x2 STBCs that were recently proposed. In particular, we describe a reduced-complexity sphere decoding algorithm suitable for QAM signal constellations. Next, we derive a novel reduced-complexity 4x2 STBC, and show that it outperforms all previously known codes with certain constellations.

Citations

• Lattice basis reduction: Improved practical algorithms and solving subset sum problems

Related

• A Low-decoding-complexity, Large coding Gain, Full-rate, Full-diversity STBC for 4 X 2 MIMO System
• A New Family of Low-Complexity STBCs for Four Transmit Antennas
• Fast-Decodable MIDO Codes with Large Coding Gain
• Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems
• Minimizing the Complexity of Fast Sphere Decoding of STBCs