Computer Science – Information Theory
Scientific paper
2008-11-26
Proc. 42th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Oct. 2008
Computer Science
Information Theory
presented at the 42th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, 2008
Scientific paper
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.
Bölcskei Helmut
Seethaler Dominik
Studer Christoph
No associations
LandOfFree
Finite Lattice-Size Effects in MIMO Detection 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 Finite Lattice-Size Effects in MIMO Detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite Lattice-Size Effects in MIMO Detection will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-274812