Low Complexity Turbo-Equalization: A Clustering Approach

Computer Science – Systems and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to the IEEE Signal Processing Letters

Scientific paper

We introduce a low complexity approach to iterative equalization and decoding, or "turbo equalization", that uses clustered models to better match the nonlinear relationship that exists between likelihood information from a channel decoder and the symbol estimates that arise in soft-input channel equalization. The introduced clustered turbo equalizer uses piecewise linear models to capture the nonlinear dependency of the linear minimum mean square error (MMSE) symbol estimate on the symbol likelihoods produced by the channel decoder and maintains a computational complexity that is only linear in the channel memory. By partitioning the space of likelihood information from the decoder, based on either hard or soft clustering, and using locally-linear adaptive equalizers within each clustered region, the performance gap between the linear MMSE equalizer and low-complexity, LMS-based linear turbo equalizers can be dramatically narrowed.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Low Complexity Turbo-Equalization: A Clustering Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Low Complexity Turbo-Equalization: A Clustering Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low Complexity Turbo-Equalization: A Clustering Approach will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-213191

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.