N-Dimensional LLL Reduction Algorithm with Pivoted Reflection
AbstractThe Lenstra-Lenstra-Lovász (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 Lovász 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. View Full-Text
Share & Cite This Article
Deng, Z.; Zhu, D.; Yin, L. N-Dimensional LLL Reduction Algorithm with Pivoted Reflection. Sensors 2018, 18, 283.
Deng Z, Zhu D, Yin L. N-Dimensional LLL Reduction Algorithm with Pivoted Reflection. Sensors. 2018; 18(1):283.Chicago/Turabian Style
Deng, Zhongliang; Zhu, Di; Yin, Lu. 2018. "N-Dimensional LLL Reduction Algorithm with Pivoted Reflection." Sensors 18, no. 1: 283.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.