Finding the Closest Lattice Point by Iterative Slicing

Most of the existing methods to solve the closest lattice point problem are based on an efficient search of the lattice points. In this paper, a novel alternative approach is suggested where the closest point to a given vector is found by calculating which Voronoi cell contains this vector in an iterative manner. Each iteration is made of simple "slicing" operations, using a list of the Voronoi relevant vectors that define the basic Voronoi cell of the lattice. The algorithm is guaranteed to converge to the closest lattice point in a finite number of steps. The method is suitable, for example, for decoding of multi-input multi-output (MIMO) communication problems. The average computational complexity of the proposed method is comparable to that of the efficient variants of the sphere decoder, but its computational variability is smaller.

[1]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[2]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[3]  Daniele Micciancio,et al.  The hardness of the closest vector problem with preprocessing , 2001, IEEE Trans. Inf. Theory.

[4]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[5]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[6]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[7]  Meir Feder,et al.  Closest point search in lattices using sequential decoding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[8]  Meir Feder,et al.  Low-Density Lattice Codes , 2007, IEEE Transactions on Information Theory.

[9]  Meir Feder,et al.  Signal codes , 2008, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).