Closest point search in lattices
Artikel i vetenskaplig tidskrift, 2002

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-Euchner variation of the Pohst method, is implemented. Given an arbitrary point x is an element of R-m and a generator matrix for a lattice A, the algorithm computes the point of A that is closest to x. The algorithm is shown to be substantially faster than other known methods, by means of a theoretical comparison with the Kannan algorithm and an experimental comparison with the Pohst algorithm and its variants, such as the recent Viterbo-Boutros decoder. Modifications of the algorithm are developed to solve a number of related search problems for lattices, such as finding a shortest vector, determining the kissing number, computing the Voronoi-relevant vectors, and finding. a Korkine-Zolotareff reduced basis.

error-control

source-coding

Författare

Erik Agrell

Chalmers, Signaler och system, Kommunikations- och antennsystem, Kommunikationssystem

Thomas Eriksson

Chalmers, Signaler och system, Kommunikations- och antennsystem, Kommunikationssystem

Alexander Vardy

Kenneth Zeger

IEEE Transactions on Information Theory

0018-9448 (ISSN)

Vol. 48 8 2201-2214

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1109/TIT.2002.800499

Mer information

Senast uppdaterat

2018-03-29