Skip to main content
Article thumbnail
Location of Repository

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

By Teja Damodaram Bavirisetti and B. Sundar Rajan

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}{2^a}$ complex symbols per channel use (cspcu) for $2^a$ 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.Comment: To be presented at ISIT 201

Topics: Computer Science - Information Theory
Year: 2011
OAI identifier: oai:arXiv.org:1104.5117
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.5117 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.