By Topic

Linear time and frequency domain turbo equalization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Tuchler ; Lehrstuhl fur Nachrichtentechnik, Technische Univ. Munchen, Germany ; J. Hagenauer

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 2m-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, ie, maximum a-posteriori probability symbol detection

Published in:

Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th  (Volume:4 )

Date of Conference: