A Linear-time nearest point algorithm for the lattice A*n | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/120436

36 Visitors

38 Hits

0 Downloads

File	Description	Size	Format
DS01	Publisher version (open access)	447 KB	Adobe Acrobat PDF	View/Open

Title: A Linear-time nearest point algorithm for the lattice A*n
Related: International Symposium on Information Theory and its Applications (7 - 10 December 2008 : Auckland)
Related: 2008 International Symposium on Information Theory and its Applications : ISITA 2008, Auckland, 7th-10th December 2008, p.1-5
DOI: 10.1109/ISITA.2008.4895596
Publisher: USA : IEEE
Date: 2008
FoR/RFCD Code(s): 010400 Statistics
Author/Creator: McKilliamy, Robby G
Author/Creator: Clarkson, I. Vaughan L
Author/Creator: Smith, Warren D
Author/Creator: Quinn, Barry G
Description: The lattice A*n 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 A*n 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.
Description: 5 page(s)
Subject Keyword: 010400 Statistics
Resource Type: conference paper
Organisation: Macquarie University. Dept. of Statistics

Identifier: http://hdl.handle.net/1959.14/120436
Identifier: ISBN:9781424420681
Identifier: mq-rm-2009008401
Language: eng
Rights: Copyright 2008 IEEE. Reprinted from 2008 International Symposium on Information Theory and its Applications : ISITA 2008, Auckland, 7th-10th December 2008. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Full Text
Reviewed

Macquarie University ResearchOnline