Matrix computations (3rd ed.)
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
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
IEEE Transactions on Signal Processing - Part I
The hardness of the closest vector problem with preprocessing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Sphere decoding is a widely used technique in communications. Given a received noisy signal, this method retrieves the source signal by exhaustively searching for an optimal solution in a hypersphere. Apparently, choosing an appropriate radius for a search sphere has significant impact on the complexity of sphere decoding. A too large sphere requires prohibitive cost of searching, while a too small sphere contains no solution. In this paper, we first describe a radius selection method which produces tight search sphere. However, due to inexact floating-point computation, the computed radii may be too small for the search spheres to contain solutions. We then perform an error analysis and propose a modified radius selection algorithm by incorporating rounding errors. Finally, we demonstrate our experiment results.