Closest Point Search in Lattices：（最近在格点搜索）.pdfVIP

Submitted to the IEEE Transactions on Information Theory Octob er Closest Point Search in Lattices Erik Agrell Thomas Eriksson Alexander Vardy and Kenneth Zeger A bstract In this semitutorial pap er a comprehensive c are convex p olytop es that they are symmetrical survey of closestp oint search metho ds for lattices without with resp ect to reection in c and that they are transla a regular structure is presented The existing search strate tions of where is the origin of Rm gies are describ ed in a unied framework and dierences b e tween them are elucidated An ecient closestp oint search In communication theory lattices are used for b oth mo d algorithm based on the SchnorrEuchner variation of the ulation and quantization If a lattice is used as a co de for Pohst metho d is implemented Given an arbitrary p oint the Gaussian channel maximumlikeliho o d deco ding in the x 2 R m and a generator matrix for a lattice the algorithm computes the p oint of that is closest to x The algorithm is demo dulator is a closestp oint search Analogously if a lat shown to b e substantially faster than other known metho ds tice is used as a co deb o ok for vector quantization and the by means of a theoretical comparison with the Kannan algo meansquareerror criterion is used then the enco ding of rithm and an exp erimental comparison with the Pohst algo rithm and its variants such as the recent Viterb oBoutros each input vector is also a closestp oint search Further deco der The improvement increases with the dimension of more if the lattice is truncated into a socalled Voronoi the lattice Mo dications of the algorithm are develop ed to co de another instance of