Abstract
The lattice A * n is an important lattice because of its covering properties in low dimensions. Conway and Sloane [3] appear to have been the first to consider the problem of computing the nearest lattice point in A * n . They developed and later improved [4] an algorithm which is able to compute a nearest point in O(n 2) arithmetic steps. In this paper, a new algorithm is developed which is able to compute a nearest point in O(n log n) steps.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Vaughan L. Clarkson. Approximation of Linear Forms by Lattice Points with Applications to Signal Processing. PhD thesis, The Australian National University, 1997.
I. Vaughan L. Clarkson, Stephen D. Howard, and Iven M. Y. Mareels. Parameter estimation and association from pulse time-of-arrival data. Submitted to Signal Process., 1997.
J. H. Conway and N. J. A. Sloane. Fast quantizing and decoding algorithms for lattice quantizers and codes. IEEE Trans. Inform. Theory, IT-28(2):227–232, March 1982.
J. H. Conway and N. J. A. Sloane. Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice. IEEE Trans. Inform. Theory, IT-32(1):41–50, January 1986.
J. H. Conway and N. J. A. Sloane. Sphere Packings, Lattices and Groups. Springer-Verlag, Berlin, 1988.
Donald E. Knuth. The Art of Computer Programming, volume 3 (Sorting and Searching). Addison-Wesley, Reading, Ma., 1973.
P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, Mathematisch Instituut, Roetersstraat 15, 1018 WB Amsterdam, The Netherlands, April 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vaughan, I., Clarkson, L. (1999). An Algorithm to Compute a Nearest Point in the Lattice A * n . In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-46796-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66723-0
Online ISBN: 978-3-540-46796-0
eBook Packages: Springer Book Archive