A New Lattice Reduction Algorithm for LR-Aided MIMO Linear Detection

Lattice reduction (LR) has recently emerged as a promising technique for improving the performance of suboptimal multiple-input-multiple-output (MIMO) detectors. For LR-aided MIMO detection, the Lenstra-Lenstra-Lovász (LLL) and Seysen's algorithm (SA) have been considered almost exclusively to...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2011-08, Vol.10 (8), p.2417-2422
Main Authors: CHEN, Chiao-En, SHEEN, Wern-Ho
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Bit error rate
Complexity theory
Detection, estimation, filtering, equalization, prediction
Detectors
Error detection
Exact sciences and technology
Information, signal and communications theory
Lattice reduction
Lattices
Mathematical analysis
MIMO
Reduction
Seysen's algorithm
Signal and communications theory
Signal, noise
Telecommunications and information theory
Vectors (mathematics)
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Lattice reduction (LR) has recently emerged as a promising technique for improving the performance of suboptimal multiple-input-multiple-output (MIMO) detectors. For LR-aided MIMO detection, the Lenstra-Lenstra-Lovász (LLL) and Seysen's algorithm (SA) have been considered almost exclusively to date. In this paper, we introduced a new LR algorithm for LR-aided linear detection (LD). In contrast to the LLL and SA, which are targeted to search for bases with relatively short basis vectors, the proposed algorithm has been designed to improve the minimum Euclidean distance of the LR-aided linear detector, thus exhibiting improved error rate at high SNR. The error-rate performance of the proposed algorithm as well as the required complexity has been demonstrated through extensive computer simulations.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2011.061311.101297