Efficient statistical pruning for maximum likelihood decoding
Published in 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). • Jan 24, 2004
Authors:,
Radhika Gowaikar
Babak Hassibi
Abstract
In many communications problems, maximum-likelihood (ML) decoding reduces to finding the closest (skewed) lattice point in N-dimensions to a given point x/spl isin/C/sup N/. In its full generality, this problem is known to be NP-complete and requires exponential complexity in N. Recently, the expect...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!