Low Complexity Turbo Equalization: A Clustering Approach

Date

2014

Authors

Kim, K.
Choi, J. W.
Kozat, S. S.
Singer, A. C.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

IEEE Communication Letters

Print ISSN

1089-7798

Electronic ISSN

Publisher

IEEE

Volume

18

Issue

6

Pages

1063 - 1066

Language

English

Journal Title

Journal ISSN

Volume Title

Series

Abstract

We introduce a low complexity approach to iterative equalization and decoding, or 'turbo equalization', which 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 turbo equalizers and low-complexity least mean square (LMS)-based linear turbo equalizers can be narrowed. © 2014 IEEE.

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)