Time-Out Lattice Sequential Decoding for the MIMO ARQ Channel

TL;DR

This paper introduces a time-out lattice sequential decoding algorithm for MIMO ARQ channels that achieves optimal diversity-multiplexing-delay tradeoff with significantly reduced computational complexity compared to traditional sphere decoding methods.

Contribution

It proposes a novel time-out lattice sequential decoder that improves decoding efficiency while maintaining optimal tradeoff performance in MIMO ARQ channels.

Findings

Achieves optimal tradeoff with lower complexity

Analytical and simulation validation of the decoder

Significant complexity reduction over sphere decoding

Abstract

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.