Design and Implementation of a Low-Complexity Symbol Detector for Sparse Channels

In this paper, the authors present a low-complexity symbol detector for communication channels which have long spanning durations but a sparse multipath structure. Traditional maximum-likelihood sequence estimation using the Viterbi algorithm can provide optimal error performance for eliminating the multipath effect, but the hardware complexity grows exponentially with channel length and it is not practical for long sparse channels. They implement a near-optimal algorithm and its architecture by cascading an adaptive Partial Response Equalizer (PRE) with an iterative Belief Propagation (BP) detector.

Provided by: Institute of Electrical and Electronics Engineers Topic: Networking Date Added: Dec 2012 Format: PDF

Find By Topic