Linear time and frequency domain turbo equalization

For coded data transmission over channels introducing inter-symbol interference, one approach for joint equalization and decoding in the receiver is turbo equalization. We rederive existing linear equalization algorithms applicable to turbo equalization for 2^m-ary signal alphabets and compare their computational complexity. Moreover by evaluating the algorithm performance properly, we select for each iteration the most suitable of the two algorithms with lowest computational complexity and achieve at low bit error rates a performance close to that of optimal approaches for equalization, i.e., maximum a-posteriori probability symbol detection