TY - JOUR

T1 - An algorithm to compute the nearest point in the lattice An *

AU - McKilliam, Robby G.

AU - Clarkson, I. Vaughan L

AU - Quinn, Barry G.

N1 - Copyright [2008] IEEE. Reprinted from [IEEE transactions on information theory, 54:9, 4378-4381]. 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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2008

Y1 - 2008

N2 - The lattice An* is an important lattice because of its covering properties in low dimensions. Clarkson described an algorithm to compute the nearest lattice point in An * 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.

AB - The lattice An* is an important lattice because of its covering properties in low dimensions. Clarkson described an algorithm to compute the nearest lattice point in An * 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.

UR - http://www.scopus.com/inward/record.url?scp=51349083795&partnerID=8YFLogxK

U2 - 10.1109/TIT.2008.928280

DO - 10.1109/TIT.2008.928280

M3 - Article

AN - SCOPUS:51349083795

SN - 0018-9448

VL - 54

SP - 4378

EP - 4381

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 9

ER -