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 April 2003 | Published
Book Section - Chapter Open

Sphere-constrained ML detection for frequency-selective channels

Abstract

Maximum-likelihood (ML) detection problem for channels with memory is investigated. The Viterbi algorithm provides an elegant solution, but is computationally inefficient when employed for detection on long channels. On the other hand, sphere decoding solves the ML detection problem in polynomial expected time over a wide range of SNRs. The sphere-constrained search strategy of sphere decoding is combined with the dynamic programming principles of the Viterbi algorithm. The resulting algorithm has the worst-case complexity of the Viterbi algorithm, but significantly lower expected complexity.

Additional Information

© 2003 IEEE.

Attached Files

Published - 01202526.pdf

Files

01202526.pdf
Files (241.5 kB)
Name Size Download all
md5:b8e511c3442602fbdae4991f06b5d013
241.5 kB Preview Download

Additional details

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