Computer Science – Information Theory
Scientific paper
2011-01-07
Computer Science
Information Theory
30 pages, 5 figures, submitted to IEEE Transactions on Information Theory
Scientific paper
The optimal diversity-multiplexing-delay tradeoff for the multi-input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using incremental redundancy lattice space-time codes coupled with a list decoder for joint error detection and correction. Such a decoder is based on the minimum mean-square error lattice decoding principle which is implemented using sphere decoding algorithms. However, sphere decoders suffer from high computational complexity for low-to-moderate signal-to-noise ratios, especially for large signal dimensions. In this paper, we would like to construct a more efficient decoder that is capable of achieving the optimal tradeoff with much lower complexity. In particular, we will study the throughput-performance-complexity tradeoffs in sequential decoding algorithms and the effect of preprocessing and termination strategies. We show, analytically and via simulation, that using the \textit{lattice sequential decoder} that implements a time-out algorithm for joint error detection and correction, the optimal tradeoff of the MIMO ARQ channel can be achieved with significant reduction in decoding complexity.
Abediseid Walid
Damen Mohamed Oussama
No associations
LandOfFree
Time-Out Lattice Sequential Decoding for the MIMO ARQ Channel 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 Time-Out Lattice Sequential Decoding for the MIMO ARQ Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time-Out Lattice Sequential Decoding for the MIMO ARQ Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-483367