Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 54, Issue 9, Pages 4378-4381Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2008.928280
Keywords
channel coding; direction-of-arrival estimation; frequency estimation; lattice theory; nearest point algorithm; quantization; synchronization
Funding
- Wireless Technologies Laboratory, CSIRO ICT Centre, Sydney, Australia
Ask authors/readers for more resources
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 logn), it is significantly simpler to describe and verify. In practice, we find that the new algorithm also runs faster.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available