Revisited Design Criteria For STBCs With Reduced Complexity ML Decoding
Asma Mejri, Mohamed-Achraf Khsiba, Ghaya Rekaya-Ben Othmane

TL;DR
This paper revisits and refines the design criteria for space-time block codes (STBCs) to enable reduced-complexity maximum likelihood decoding, providing new conditions that improve upon existing Hurwitz-Radon theory-based methods.
Contribution
It introduces novel sufficient conditions and design criteria for low-complexity ML decodable linear STBCs applicable to any number of antennas and coding rates, surpassing traditional HR theory-based approaches.
Findings
FSD complexity depends only on weight matrices and their order.
Proposed criteria are applicable to various code families.
HR theory-based approaches are shown to be suboptimal.
Abstract
The design of linear STBCs offering a low-complexity ML decoding using the well known Sphere Decoder (SD) has been extensively studied in last years. The first considered approach to derive design criteria for the construction of such codes is based on the Hurwitz-Radon (HR) Theory for mutual orthogonality between the weight matrices defining the linear code. This appproach served to construct new families of codes admitting fast sphere decoding such as multi-group decodable, fast decodable, and fast-group decodable codes. In a second Quadratic Form approach, the Fast Sphere Decoding (FSD) complexity of linear STBCs is captured by a Hurwitz Radon Quadratic Form (HRQF) matrix based in its essence on the HR Theory. In this work, we revisit the structure of weight matrices for STBCs to admit Fast Sphere decoding. We first propose novel sufficient conditions and design criteria for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Error Correcting Code Techniques · Cellular Automata and Applications
