|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Low ML Decoding Complexity STBCs via Codes over GF(4) | | Lakshmi Prasad Natarajan
; B. Sundar Rajan
; | | Date: |
15 Aug 2010 | | Abstract: | In this paper, we give a new framework for constructing low ML decoding
complexity Space-Time Block Codes (STBCs) using codes over the finite field
$mathbb{F}_4$. Almost all known low ML decoding complexity STBCs can be
obtained via this approach. New full-diversity STBCs with low ML decoding
complexity and cubic shaping property are constructed, via codes over
$mathbb{F}_4$, for number of transmit antennas mbox{$N=2^m$}, mbox{$m geq
1$}, and rates mbox{$R>1$} complex symbols per channel use. When mbox{$R=N$},
the new STBCs are information-lossless as well. The new class of STBCs have the
least known ML decoding complexity among all the codes available in the
literature for a large set of mbox{$(N,R)$} pairs. | | Source: | arXiv, 1008.2526 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
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)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER