A linear-time nearest point algorithm for the lattice A(n)*

McKilliam, R. G., Clarkson, I. V. L., Smith, W. D. and Quinn, B. G. (2008). A linear-time nearest point algorithm for the lattice A(n)*. In: IEEE, 2008 International symposium on information theory and its applications (ISITA 2008). International Symposium on Information Theory and Its Applications (ISITA 2008), Auckland, New Zealand, (1239-1243). 7-10 December 2008.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author McKilliam, R. G.
Clarkson, I. V. L.
Smith, W. D.
Quinn, B. G.
Title of paper A linear-time nearest point algorithm for the lattice A(n)*
Conference Paper Type Fully Published Paper
Conference name International Symposium on Information Theory and Its Applications (ISITA 2008)    (ERA 2010 Rank B)
DOI 10.1109/ISITA.2008.4895596
Conference location Auckland, New Zealand
Conference dates 7-10 December 2008
Proceedings title 2008 International symposium on information theory and its applications (ISITA 2008)
Journal name 2008 International Symposium On Information Theory and its Applications, Vols 1-3
Editor IEEE
Place published Piscataway, NJ, U.S.A.
Publisher IEEE
Publication date 2008
ISBN 978-1-4244-2068-1; 1424420687
Start page 1239
End page 1243
Total pages 5
Language eng
Formatted Abstract/Summary The lattice An* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the literature that compute the nearest point in the lattice An*, in O(n log n) arithmetic operations. In this paper we describe a new algorithm that requires only O(n) operations. The new algorithm makes use of an approximate sorting procedure called a bucket sort. This is the fastest known nearest point algorithm for this lattice.
Subjects 0802 Computation Theory and Mathematics
Keyword Codes
Arithmetic
Computational complexity
Sorting
Approximate sorting procedure
Arithmetic operations
Bucket sort
Lattice An*
Linear-time nearest point algorithm
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ
Additional Notes Proceedings published in three volumes.

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Access Statistics: 40 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Sun, 31 Jan 2010, 00:07:38 EST