By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chiao-En Chen ; Dept. of Electr./Commun. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan ; Sheen, Wern-Ho

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.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:10 ,  Issue: 8 )