Finite lattice-size effects in MIMO detection

Authors

Christoph Studer, Dominik Seethaler, and Helmut Bölcskei

Reference

Proc. of Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, pp. 2032-2037, Oct. 2008, (invited paper).

DOI: 10.1109/ACSSC.2008.5074789

[BibTeX, LaTeX, and HTML Reference]

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

MIMO wireless, data detection, sphere decoding, lattice decoding, lattice reduction

Download this document:

 

Copyright Notice: © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.