Return
N-Dimensional LLL Reduction Algorithm with Pivoted Reflection
DOI:10.3390/s18010283.png)
Abstract
En 中文
The Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm and many of its variants have been widely used by cryptography, multiple-input-multiple-output (MIMO) communication systems and carrier phase positioning in global navigation satellite system (GNSS) to solve the integer least squares (ILS) problem. In this paper, we propose an n-dimensional LLL reduction algorithm (n-LLL), expanding the Lovasz condition in LLL algorithm to n-dimensional space in order to obtain a further reduced basis. We also introduce pivoted Householder reflection into the algorithm to optimize the reduction time. For an m-order positive definite matrix, analysis shows that the n-LLL reduction algorithm will converge within finite steps and always produce better results than the original LLL reduction algorithm with n > 2. The simulations clearly prove that n-LLL is better than the original LLL in reducing the condition number of an ill-conditioned input matrix with 39% improvement on average for typical cases, which can significantly reduce the searching space for solving ILS problem. The simulation results also show that the pivoted reflection has significantly declined the number of swaps in the algorithm by 57%, making n-LLL a more practical reduction algorithm.
Keywords:
LLL reduction
pivoted reflection
integer least squares (ILS)
global navigation satellite system (GNSS)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.2W
Citations:
20.9W
Organization
Cited Papers
Entropy Generation Methodology for Defect Analysis of Electronic and Mechanical Components—A Review
Entropy
IF0
Heart rate variability as a prognostic tool in cardiology. A contribution to the problem from a theoretical point of view.
Circulation
IF0

