Conference proceeding
A new exact closest lattice point search algorithm using linear constraints
2007 IEEE 8TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, VOLS 1 AND 2, p.91
2007
DOI: 10.1109/SPAWC.2007.4401291
Abstract
The problem of finding the closest lattice point arises in several communications scenarios and is known to be NP-hard. We propose a new closest lattice point search algorithm which utilizes a set of new linear inequality constraints to reduce the search of the closest lattice point to the intersection of a polyhedron and a sphere. This set of linear constraints efficiently leverage the geometric structure of the lattice to reduce considerably the number of points that must be visited. Simulation results verify that this algorithm offers substantial computational savings over standard sphere decoding when the dimension of the problem is large.
Details
- Title: Subtitle
- A new exact closest lattice point search algorithm using linear constraints
- Creators
- Weiyu XuBabak Hassibi
- Resource Type
- Conference proceeding
- Publication Details
- 2007 IEEE 8TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, VOLS 1 AND 2, p.91
- DOI
- 10.1109/SPAWC.2007.4401291
- Language
- English
- Date published
- 2007
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984239557002771
Metrics
4 Record Views