Abstract
A number of important advances have been made in the area of joint equalization and decoding of data transmitted over intersymbol interference (ISI) channels. Turbo equalization is an iterative approach to this problem, in which a maximum a posteriori probability (MAP) equalizer and a MAP decoder exchange soft information in the form of prior probabilities over the transmitted symbols. A number of reduced-complexity methods for turbo equalization have recently been introduced in which MAP equalization is replaced with suboptimal, low-complexity approaches. In this paper, we explore a number of low-complexity soft-input/soft-output (SISO) equalization algorithms based on the minimum mean square error (MMSE) criterion. This includes the extension of existing approaches to general signal constellations and the derivation of a novel approach requiring less complexity than the MMSE-optimal solution. All approaches are qualitatively analyzed by observing the mean-square error averaged over a sequence of equalized data. We show that for the turbo equalization application, the MMSE-based SISO equalizers perform well compared with a MAP equalizer while providing a tremendous complexity reduction.
Original language | English (US) |
---|---|
Pages (from-to) | 673-683 |
Number of pages | 11 |
Journal | IEEE Transactions on Signal Processing |
Volume | 50 |
Issue number | 3 |
DOIs | |
State | Published - Mar 2002 |
Keywords
- Equalization
- Iterative decoding
- Low complexity
- Minimum mean square error
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering