Matrix computations (3rd ed.)
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
Integer parameter estimation in linear models with applications toGPS
IEEE Transactions on Signal Processing
Radius selection algorithms for sphere decoding
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
A deterministic method for choosing search radii in sphere decoding
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A complexity analysis of a Jacobi method for lattice basis reduction
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
| Hi-index | 0.00 |
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss the sphere decoding method in communications. One of the key issues in sphere decoding is the determination of the radius of search sphere. We propose a deterministic method for finding a radius of search sphere. Also, we investigate the impact of the LLL algorithm on the computational complexity of the sphere decoding method.