Computer Science – Information Theory
Scientific paper
2007-01-20
Computer Science
Information Theory
5 pages, to appear in ISIT, June 2007, Nice, France
Scientific paper
We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can be varied from ML decoding of $2^{\lceil \log_2M \rceil -1}$ symbols together to single symbol ML decoding. For ML decoding of $2^{\lceil \log_2M \rceil - n}$ ($n=1,2,...$) symbols together, a diversity of $\min(M,2^{\lceil \log_2M \rceil-n+1})$ can be achieved. Numerical results show that the performance of the constructed code when $2^{\lceil \log_2M \rceil-1}$ symbols are decoded together is quite close to the performance of ideal rate-1 orthogonal codes (that are non-existent for more than 2 transmit antennas).
Papadias Constantinos B.
Pinnamraju Pavan R.
Sharma Naresh
No associations
LandOfFree
Space-time codes with controllable ML decoding complexity for any number of transmit antennas 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 Space-time codes with controllable ML decoding complexity for any number of transmit antennas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Space-time codes with controllable ML decoding complexity for any number of transmit antennas will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-651644