A new exact closest lattice point search algorithm using linear constraints
- Creators
- Xu, Weiyu
-
Hassibi, Babak
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.
Additional Information
© 2007 IEEE. Issue Date: 17-20 June 2007; date of current version: 12 December 2007. This work was supported by the Caltech Information Science and Technology Fellowship and Caltech's Lee Center for Advanced Networking.Attached Files
Published - Xu2007p84392007_Ieee_8Th_Workshop_On_Signal_Processing_Advances_In_Wireless_Communications_Vols_1_And_2.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:05a13634b58d79a2da48e833690b47d2
|
142.7 kB | Preview Download |
Additional details
- Eprint ID
- 18184
- Resolver ID
- CaltechAUTHORS:20100507-094336274
- Information Science and Technology Fellowship, Caltech
- Lee Center for Advanced Networking, Caltech
- Created
-
2010-06-03Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9855749