Four-Group Decodable Space-Time Block Codes
Dung Ngoc Dao, Chau Yuen, Chintha Tellambura, Yong Liang Guan and, Tjeng Thiang Tjhung

TL;DR
This paper introduces two novel rate-one full-diversity space-time block codes with the lowest known decoding complexity, optimized for systems with power-of-two antennas, offering improved performance and efficiency.
Contribution
The paper presents two new space-time block codes that achieve full diversity with minimal decoding complexity and delay, outperforming existing codes in multiple aspects.
Findings
Higher code rate than existing codes
Lower decoding complexity and delay
Better performance in simulations
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.
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.
