Closest point search in lattices using sequential decoding

Naftali Sommer, Meir Feder, Ofir Shalvi

Research output: Contribution to journalConference articlepeer-review

Abstract

The problem of finding the closest lattice point arises in several communication problems, and is known to be NP-hard. Existing methods to solve the problem are based on the sphere decoder, which searches for all the lattice points in a sphere around the received point. The sphere decoder is general and does not exploit the noise properties of the communication channel. In this paper we suggest to use sequential decoding algorithms for this problem. In particular, we propose an algorithm based on the well known Fano algorithm that naturally exploits the noise structure, hence offers a significant complexity reduction with respect to the sphere decoder with only a small penalty in error performance. Two further improvements are suggested. The first is bidirectional stack decoding, where the stack is implemented using a heap data structure to avoid sorting. The second is interleaved decoding, where the possibility to choose an arbitrary search order along the lattice coordinates is used to interleave noise bursts at the receiver. Finally, a lower bound is found for the computational cutoff rate of sequential lattice decoding.

Original languageEnglish
Article number1523500
JournalIEEE International Symposium on Information Theory - Proceedings
Volume2005-January
DOIs
StatePublished - 2005
Externally publishedYes
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005

Fingerprint

Dive into the research topics of 'Closest point search in lattices using sequential decoding'. Together they form a unique fingerprint.

Cite this