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.


Published in:
CISS 2000, 2, 1159-1163
Presented at:
IEEE Annual Conference on Information Sciences and Systems (CISS 2000), Boston, MA, USA, March 15-17, 2000
Year:
2000
Laboratories:




 Record created 2007-02-05, last modified 2018-03-17

n/a:
Download fulltext
PS

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)