期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 54, 期 9, 页码 4378-4381出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2008.928280
关键词
channel coding; direction-of-arrival estimation; frequency estimation; lattice theory; nearest point algorithm; quantization; synchronization
资金
- Wireless Technologies Laboratory, CSIRO ICT Centre, Sydney, Australia
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据