A linear-time nearest point algorithm for the Lattice A*n

McKilliam, R., Clarkson, I.V.L., Smtih, W. D. and Quinn, B. G. (2008). A linear-time nearest point algorithm for the Lattice A*n. In: Yamamoto, H. and Morita, H. International Symposium on Information Theory and its Applications, Auckland, New Zealand, (1239-1243). 7 - 10 December, 2008.


Author McKilliam, R.
Clarkson, I.V.L.
Smtih, W. D.
Quinn, B. G.
Title of paper A linear-time nearest point algorithm for the Lattice A*n
Formatted title 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    (ERA 2010 Rank B)
Conference location Auckland, New Zealand
Conference dates 7 - 10 December, 2008
Convener Speidel, U.
Editor Yamamoto, H.
Morita, H.
Place published USA
Publisher IEEE
Publication date 2008
ISBN 978-1-4244-2069-8
Start page 1239
End page 1243
Total pages 5
Language eng
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 E4
970101 Expanding Knowledge in the Mathematical Sciences
970109 Expanding Knowledge in Engineering
090609 Signal Processing
Q-Index Code E4

Document type: Conference Paper
Sub-type: Fully Published Paper
Collections: Temporary duplicates
School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Access Statistics: 55 Abstract Views  -  Detailed Statistics
Created: Thu, 09 Apr 2009, 14:06:12 EST by Ms Kimberley Nunes on behalf of School of Information Technol and Elec Engineering