Closest point search in lattices

13 years 4 months ago

Download www-ee.ccny.cuny.edu

In this semitutorial paper, a comprehensive survey of closest point search methods for lattices without a regular structure is presented. The existing search strategies are described in a unified framework, and differences between them are elucidated. An efficient closest point search algorithm, based on the Schnorr

Erik Agrell, Thomas Eriksson, Alexander Vardy, Ken

Real-time Traffic

Algorithm | Closest Point Search | Point Search Methods | TIT 2002 |

claim paper

» Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm vi...

» Randomized Lattice Decoding

» Constraints for closest point finding

» A coordinate system for articulated 2D shape point correspondences

» Cached kd tree search for ICP algorithms

» Lattices that admit logarithmic worstcase to averagecase connection factors

» On further reduction of complexity in tree pruning based sphere search

» Searching in the Delta Lattice An Efficient MIMO Detection for Iterative Receivers

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TIT
Authors	Erik Agrell, Thomas Eriksson, Alexander Vardy, Kenneth Zeger

Comments (0)

Sciweavers

Closest point search in lattices

Algorithm | Closest Point Search | Point Search Methods | TIT 2002 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers