Four-Group Decodable Space-Time Block Codes
arXiv:0707.3959 · doi:10.1109/TSP.2007.906729
Abstract
Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, respectively. The exact pair-wise error probability is derived to allow for the performance optimization of the two codes. Compared with existing low-decoding complexity STBC, the two new codes offer several advantages such as higher code rate, lower encoding/decoding delay and complexity, lower peak-to-average power ratio, and better performance.
1 figure. Accepted for publication in IEEE Trans. on Signal Processing
Cited by in corpus (14)
- Block-Orthogonal Space-Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction
- Group-Decodable Space-Time Block Codes with Code Rate > 1
- Multi-group ML Decodable Collocated and Distributed Space Time Block Codes
- A New Low-Complexity Decodable Rate-1 Full-Diversity 4 x 4 STBC with Nonvanishing Determinants
- A Novel Construction of Multi-group Decodable Space-Time Block Codes
- Fast-Group-Decodable STBCs via Codes over GF(4)
- Low ML Decoding Complexity STBCs via Codes over GF(4)
- Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks
- Revisited Design Criteria For STBCs With Reduced Complexity ML Decoding
- Minimizing the Complexity of Fast Sphere Decoding of STBCs
- A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding
- A New Family of Low-Complexity STBCs for Four Transmit Antennas
- Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code
- Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity