Computer Science – Information Theory
Scientific paper
2011-04-27
Computer Science
Information Theory
To be presented at ISIT 2011
Scientific paper
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.
Bavirisetti Teja Damodaram
Rajan Sundar B.
No associations
LandOfFree
Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-475646