Low ML Decoding Complexity STBCs via Codes over GF(4)

Details Low ML Decoding Complexity STBCs via Codes over GF(4) Low ML Decoding Complexity STBCs via Codes over GF(4)

2010-08-15

arxiv.org/abs/1008.2526v1

Computer Science

Information Theory

20 pages, 1 table

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Low ML Decoding Complexity STBCs via Codes over GF(4) 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 Low ML Decoding Complexity STBCs via Codes over GF(4), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low ML Decoding Complexity STBCs via Codes over GF(4) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-295688