Conference paper

On reduced trellis equalization using the M-BCJR Algorithm

The complexity of channel equalization using the BCJR algorithn [1] grows exponentially with the channel memory. The M-BCJR algorithm [2], provides a method for reduced-trellis channel equalization. This paper examines the algorithm performance for different finite impulse response channels, identifies pathological cases, and introduces designer choices such as the decision delay, maximum and minimum phase transformation, and selection of states used by the algorithm. Simulation results demonstrate the effect of the different parameters in the algorithm's performance.


    • ARNI-CONF-2007-019

    Record created on 2007-02-05, modified on 2016-08-08

Related material


EPFL authors