Matrix computations (3rd ed.)
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Integer least squares: sphere decoding and the LLL algorithm
Proceedings of the 2008 C3S2E conference
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
The hardness of the closest vector problem with preprocessing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The integer least squares problem arises from many applications such as communications, cryptography, and GPS. In this paper, we consider the sphere decoding method in communication applications. One of key issues in sphere decoding is the selection of an initial radius of the search hypersphere. We first present a deterministic radius selection algorithm using the Babai estimate. However, due to the rounding errors in floating-point computation, this method may produce a too small radius and cause sphere decoding to fail to find a solution. In this paper, we perform an error analysis and propose a modified radius selection algorithm by taking computational error into account. Our numerical experiments show that this modified method achieves high success rate without compromising performance.