An Algorithm to Compute the Nearest Point in the Lattice

Authors:
R. G. McKilliam;I. Clarkson;B. G. Quinn
Affiliations:
Sch. of Inf. Technol. & Electr. Eng., Queensland Univ., Brisbane, QLD;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 2

Frequency estimation by phase unwrapping

IEEE Transactions on Signal Processing
Linear-time nearest point algorithms for coxeter lattices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

The lattice A n * is an important lattice because of its covering properties in low dimensions. Clarkson described an algorithm to compute the nearest lattice point in A n * that requires O(n log n) arithmetic operations. In this correspondence, we describe a new algorithm. While the complexity is still O(n log n), it is significantly simpler to describe and verify. In practice, we find that the new algorithm also runs faster.