Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2003 | Published
Book Section - Chapter Open

Efficient near-ML decoding via statistical pruning

Abstract

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.

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.

Attached Files

Published - 01228289.pdf

Files

01228289.pdf
Files (114.1 kB)
Name Size Download all
md5:9d2daf6c8c9fc11fb23a8f17943b250a
114.1 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024