论文信息 - An improved LLL algorithm

An improved LLL algorithm

The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning an integer least squares problem. However, the workings of the algorithm are not well understood. In this paper, we present a new way to look at the LLL reduction, which leads to a new implementation method that performs better than the original LLL scheme.

Franklin T. Luk | Daniel M. Tracy | F. Luk

[1] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[2] Babak Hassibi,et al. On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.

[3] Michael E. Pohst,et al. On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.

[4] Gene H. Golub,et al. Matrix computations , 1983 .

[5] U. Fincke,et al. Improved methods for calculating vectors of short length in a lattice , 1985 .

[6] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .

[7] Babak Hassibi,et al. On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.