Reduced ML-Decoding Complexity, Full-Rate STBCs for $2^a$ Transmit Antenna Systems
K. Pavan Srinath, B. Sundar Rajan

TL;DR
This paper introduces a new full-rate space-time block code for $2^a$ transmit antennas that significantly reduces maximum likelihood decoding complexity while maintaining high performance and ergodic capacity.
Contribution
The paper presents a novel construction of full-rate STBCs for $2^a$ antennas using Clifford algebra, achieving lower ML-decoding complexity and higher ergodic capacity compared to existing codes.
Findings
Reduces ML-decoding complexity by a factor of $M^{3n_t/4}$.
Includes the Silver code as a special case.
Matches punctured Perfect codes in error performance with lower complexity.
Abstract
For an transmit, receive antenna system ( system), a {\it{full-rate}} space time block code (STBC) transmits complex symbols per channel use and in general, has an ML-decoding complexity of the order of (considering square designs), where is the constellation size. In this paper, a scheme to obtain a full-rate STBC for transmit antennas and any , with reduced ML-decoding complexity of the order of , is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. For any value of , the proposed design offers a reduction from the full ML-decoding complexity by a factor of M^{3n_t/4}}. The well known Silver code for 2 transmit antennas is a special case of the proposed scheme. Further, it is shown that the codes…
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.
