A New Lattice Reduction Algorithm for LR-Aided MIMO Linear Detection
Authors:
- 23 June 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 10 (8) , 2417-2422
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Improved Upper Bounds for Approximate Lattice Decoding With Dual-Basis Reduction2008
- LLL Reduction Achieves the Receive Diversity in MIMO DecodingIEEE Transactions on Information Theory, 2007
- Low-Complexity MIMO Data Detection using Seysen's Lattice Reduction Algorithm2007
- The $p$-Sphere Encoder: Peak-Power Reduction by Lattice Precoding for the MIMO Gaussian Broadcast ChannelIEEE Transactions on Communications, 2006
- Approximate Lattice Decoding: Primal Versus Dual Basis Reduction2006
- Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction2004
- An efficient square-root algorithm for BLAST2002
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsMathematical Programming, 1994
- Simultaneous reduction of a lattice basis and its reciprocal basisCombinatorica, 1993
- Analytic Inequalities1970