Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs
Teja Damodaram Bavirisetti, B. Sundar Rajan

TL;DR
This paper determines the maximum achievable rates for 3- and 4-real-symbol ML decodable unitary weight space-time block codes with square structure, providing constructions and conditions for full diversity.
Contribution
It extends the known maximum rate results from 2-real-symbol codes to 3- and 4-real-symbol codes, including code constructions and diversity conditions.
Findings
Maximum rate for 3-real-symbol codes: (3(a-1))/2^a cspcu
Maximum rate for 4-real-symbol codes: (4(a-1))/2^a cspcu
Derived conditions for full-diversity achievement
Abstract
It has been shown recently that the maximum rate of a 2-real-symbol (single-complex-symbol) maximum likelihood (ML) decodable, square space-time block codes (STBCs) with unitary weight matrices is complex symbols per channel use (cspcu) for number of transmit antennas \cite{KSR}. These STBCs are obtained from Unitary Weight Designs (UWDs). In this paper, we show that the maximum rates for 3- and 4-real-symbol (2-complex-symbol) ML decodable square STBCs from UWDs, for transmit antennas, are and cspcu, respectively. STBCs achieving this maximum rate are constructed. A set of sufficient conditions on the signal set, required for these codes to achieve full-diversity are derived along with expressions for their coding gain.
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 · Wireless Communication Networks Research · Cooperative Communication and Network Coding
