Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Matrix computations (3rd ed.)
Improved algorithms for integer programming and related lattice problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Euclidean distances and least squares problems for a given set of vectors
Applied Numerical Mathematics
Integer parameter estimation in linear models with applications toGPS
IEEE Transactions on Signal Processing
Solving Box-Constrained Integer Least Squares Problems
IEEE Transactions on Wireless Communications
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
Lattice decoding for joint detection in direct-sequence CDMA systems
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
A new method is proposed to solve an ellipsoid-constrained integer least squares (EILS) problem arising in communications. In this method, the LLL reduction, which is cast as a QRZ factorization of a matrix, is used to transform the original EILS problem to a reduced EILS problem, and then a search algorithm is proposed to solve the reduced EILS problem. Simulation results indicate the new method can be much more computationally efficient than the existing method. The method is extended to solve a more general EILS problem.