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

Sphere-constrained ML detection for channels with memory

Abstract

The maximum-likelihood (ML) detection problem for channels with memory is investigated. The Viterbi algorithm (VA) provides an exact solution. Its computational complexity is linear in the length of the transmitted sequence but exponential in the channel memory length. Hence, the VA can be computationally inefficient when employed for detection on long channels. On the other hand, the sphere decoding (SD) algorithm also solves the ML detection problem exactly and has expected complexity which is polynomial (often cubic) in the length of the transmitted sequence over a wide range of signal-to-noise ratios (SNR). We combine the sphere-constrained search strategy of SD with the dynamic programming principles of the VA. The resulting algorithm has the worst-case complexity of the VA, but often significantly lower expected complexity.

Additional Information

© 2003 IEEE. This work was supported in part by the NSF 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 - Sphere-constrained_ML_detection_for_channels_with_memory.pdf

Files

Sphere-constrained_ML_detection_for_channels_with_memory.pdf
Files (288.7 kB)

Additional details

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