An Algorithm to compute the nearest point in the lattice A*n

McKilliam, R., Clarkson, I. V. L. and Quinn, B. G. (2008) An Algorithm to compute the nearest point in the lattice A*n. IEEE Transactions on Information Theory, 54 9: 4378-4381. doi:10.1109/TIT.2008.928280

Author McKilliam, R.
Clarkson, I. V. L.
Quinn, B. G.
Title An Algorithm to compute the nearest point in the lattice A*n
Formatted title
An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
Journal name IEEE Transactions on Information Theory   Check publisher's open access policy
ISSN 0018-9448
Publication date 2008-09-09
Year available 2008
Sub-type Article (original research)
DOI 10.1109/TIT.2008.928280
Open Access Status
Volume 54
Issue 9
Start page 4378
End page 4381
Total pages 4
Editor H. V. Poor
Place of publication USA
Publisher IEEE
Collection year 2009
Language eng
Subject C1
010101 Algebra and Number Theory
970109 Expanding Knowledge in Engineering
970101 Expanding Knowledge in the Mathematical Sciences
080401 Coding and Information Theory
Formatted 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.
Keyword Channel Coding
Direction-of-arrival estimation
frequency estimation
lattice theory
nearest point algorithm
Q-Index Code C1
Q-Index Status Confirmed Code

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 10 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 12 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 10 Apr 2009, 13:27:58 EST by Ms Kimberley Nunes on behalf of School of Information Technol and Elec Engineering