Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs

Published 27 Apr 2011 in cs.IT and math.IT | (1104.5117v2)

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 $\frac{2a}{2a}$ complex symbols per channel use (cspcu) for $2a$ 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 $2{a}$ transmit antennas, are $\frac{3(a-1)}{2{a}}$ and $\frac{4(a-1)}{2{a}}$ 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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.