2015/01/27 by Amaro Barreal, Barreal, Amaro, Camilla Hollanti +3
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.1501.06686
openalex publication_date 2015/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Algebraic space-time coding allows for reliable data exchange across fading multiple-input multiple-output channels. A powerful technique for decoding space-time codes in Maximum-Likelihood (ML) decoding, but well-performing and widely-used codes such as the Golden code often suffer from high ML-decoding complexity. In this article, a recursive algorithm for decoding general algebraic space-time codes of arbitrary dimension is proposed, which reduces the worst-case decoding complexity from O(|S|n2) to O(|S|n).