Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3645
Articles: 2'501'711
Articles rated: 2609

19 April 2024
 
  » arxiv » 1003.2606

 Article overview


Asymptotically-Good, Multigroup ML-Decodable STBCs
N. Lakshmi Prasad ; B. Sundar Rajan ;
Date 12 Mar 2010
AbstractFor a family/sequence of Space-Time Block Codes (STBCs) $mathcal{C}_1,mathcal{C}_2,...$, with increasing number of transmit antennas $N_i$, with rates $R_i$ complex symbols per channel use, $i=1,2,...$, the emph{asymptotic normalized rate} is defined as $lim_{i o infty}{frac{R_i}{N_i}}$. A family of STBCs is said to be emph{asymptotically-good} if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC $mathcal{C}$ is said to be g-group ML-decodable if the $K$ symbols can be partitioned into g groups, such that each group of symbols can be ML decoded independently of others. In this paper, for $g geq 2$, we construct g-group ML-decodable codes with rates greater than one complex symbol per channel use. These codes are asymptotically good too. For $g>2$, these are the first instances of g-group ML-decodable codes with rates greater than one presented in the literature. We also construct multigroup ML-decodable codes with the best known asymptotic normalized rates. Specifically, we propose delay-optimal 2-group ML-decodable codes for number of antennas $N>1$ with rate $frac{N}{4}+frac{1}{N}$ for even $N$ and rate $frac{N}{4}+frac{5}{4N}-frac{1}{2}$ for odd $N$. We construct delay optimal, g-group ML-decodable codes, $g>2$, for number of antennas $N$ that are a multiple of $g2^{lfloor frac{g-1}{2} floor}$ with rate $frac{N}{g2^{g-1}}+frac{g^2-g}{2N}$. We also construct non-delay-optimal g-group ML-decodable codes, $ggeq2$, for number of antennas $N$ that are a multiple of $2^{lfloor frac{g-1}{2} floor}$, with delay $gN$ and rate $frac{N}{2^{g-1}}+frac{g-1}{2N}$.
Source arXiv, 1003.2606
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica