A Caltech Library Service

Efficient near-ML decoding via statistical pruning

Gowaikar, Radhika and Hassibi, Babak (2003) Efficient near-ML decoding via statistical pruning. In: IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE , Piscataway, Nj, p. 274. ISBN 0-7803-7728-1.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


Maximum-likelihood (ML) decoding often reduces to finding the closest (skewed) lattice point in N-dimensions to a given point x ϵ C^N. Sphere decoding is an algorithm that does this. We modify the sphere decoder to reduce the computational complexity of decoding while maintaining near-ML performance.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2003 IEEE. This work was supported in part by the National Science Foundation under grant no. CCR-0133818, by the office of Naval Research under grant no. N00014-02-1-0578, and by Caltech's Lee Center for Advanced Networking.
Funding AgencyGrant Number
Office of Naval Research (ONR)N00014-02-1-0578
Caltech's Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20150227-071358104
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:55295
Deposited By: Shirley Slattery
Deposited On:27 Feb 2015 19:18
Last Modified:10 Nov 2021 20:44

Repository Staff Only: item control page