Efficient near-ML decoding via statistical pruning

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 274-

  Gowaikar, Radhika ^a   Hassibi, Babak ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; PHASE SHIFT KEYING; PROBABILITY; RECEIVING ANTENNAS; SIGNAL TO NOISE RATIO; VECTORS;

MULTIPLE ANTENNA CHANNEL MODEL; SPHERE DECODER; TRANSMIT ANTENNAS;

DECODING;

EID: 0141904516     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228289     Document Type: Conference Paper

References (1)

1. B. Hassibi and H. Vikalo, "The complexity of sphere decoding. pt. I Expected Complexity," Submitted to IEEE Trans. Sig. Proc.; 2003