Finite Lattice-Size Effects in MIMO Detection
Information Theory
2008-11-27 v1 math.IT
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.
Keywords
Cite
@article{arxiv.0811.4339,
title = {Finite Lattice-Size Effects in MIMO Detection},
author = {Christoph Studer and Dominik Seethaler and Helmut Bölcskei},
journal= {arXiv preprint arXiv:0811.4339},
year = {2008}
}
Comments
presented at the 42th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, 2008