On the expected complexity of sphere decoding

Conference Record of the Asilomar Conference on Signals, Systems and Computers

Volumn 2, Issue , 2001, Pages 1051-1055

  Hassibi, Babak ^a   Vikalo, Haris ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LEAST SQUARES APPROXIMATIONS; LINEAR EQUATIONS; POLYNOMIALS; PROBLEM SOLVING;

INTEGER LEAST-SQUARES PROBLEM; SPHERE DECODING;

DECODING;

EID: 0035574496     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acssc.2001.987655     Document Type: Conference Paper

References (13)

1. Euclidean space lattice decoding for joint detection in CDMA systems
2. High-rate codes that are linear in space and time
3. Integer parameter estimation in linear models with applications to GPS
4. 2 is NP-hard for randomized reductions
5. Generating hard instances of lattice problems
6. Public-key cryptosystems from lattice reduction problems
7. Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas
8. An efficient square-root algorithm for BLAST
9. Improved algorithms on integer programming and related lattice problems
10. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
11. Lattice code decoder for space-time codes