Finite Lattice-Size Effects in MIMO Detection

TL;DR

This paper investigates how finite lattice sizes affect the performance and complexity of MIMO detection algorithms originally designed for infinite lattices, revealing that lattice reduction offers no clear benefits when combined with sphere decoding.

Contribution

It provides a systematic analysis of finite lattice effects on MIMO detection algorithms, challenging assumptions about the advantages of lattice reduction in this context.

Findings

Lattice reduction does not improve performance when combined with sphere decoding.

Finite lattice size impacts the complexity and effectiveness of MIMO detection algorithms.

Systematic study clarifies the limitations of algorithms designed for infinite lattices in finite lattice scenarios.

Abstract

Many powerful data detection algorithms employed in multiple-input multiple-output (MIMO) communication systems, such as sphere decoding (SD) and lattice-reduction (LR)-aided detection, were initially designed for infinite lattices. Detection in MIMO systems is, however, based on finite lattices. In this paper, we systematically study the consequences of finite lattice-size for the performance and complexity of MIMO detection algorithms formulated for infinite lattices. Specifically, we find, considering performance and complexity, that LR does not seem to offer advantages when used in conjunction with SD.