2006•IEEE Transactions on CommunicationsRequires access

The soft-feedback equalizer for turbo equalization of highly dispersive channels

Renato Lopes, John R. Barry

Open publisher page 74 citations

Abstract

The complexity of a turbo equalizer based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is manageable only for mildly dispersive channels having a small amount of memory. To enable turbo equalization of highly dispersive channels, we propose the soft-feedback equalizer(SFE). The SFE combines linear equalization and soft intersymbol-interference cancellation. Its coefficients are chosen to minimize the mean-squared error(MSE) between the equalizer output and the transmitted sequence, under a Gaussian approximation to the a priori information and the SFE output. The resulting complexity grows only linearly with the number of coefficients, as opposed to the quadratic complexity of previously reported minimum-MSE structures. We will see that an SFE-based turbo equalizer consistently outperforms another structure of similar complexity, and can outperform a BCJR-based scheme when complexity is taken into account.

About this research paper

What this paper is about

The complexity of a turbo equalizer based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is manageable only for mildly dispersive channels having a small amount of memory. To enable turbo equalization of highly dispersive channels, we propose the soft-feedback equalizer(SFE). The SFE combines linear equalization and soft intersymbol-interference cancellation. Its coefficients are chosen to minimize the mean-squared error(MSE) between the equalizer output and the transmitted sequence, under a Gaussian approximation to the a priori information and the SFE output. The resulting complexity grows only linearly with the number of coefficients, as opposed to the quadratic complexity of previously reported minimum-MSE structures. We will see that an SFE-based turbo equalizer consistently outperforms another structure of similar complexity, and can outperform a BCJR-based scheme when complexity is taken into account.

Why it matters

OpenAlex reports 74 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The complexity of a turbo equalizer based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is manageable only for mildly dispersive channels having a small amount of memory. To enable turbo equalization of highly dispersive channels, we propose the soft-feedback equalizer(SFE). The SFE combines linear equalization and soft intersymbol-interference cancellation. Its coefficients are chosen to minimize the mean-squared error(MSE) between the equalizer output and the transmitted sequence, under a Gaussian approximation to the a priori information and the SFE output. The resulting complexity grows only linearly with the number of coefficients, as opposed to the quadratic complexity of previously reported minimum-MSE structures. We will see that an SFE-based turbo equalizer consistently outperforms another structure of similar complexity, and can outperform a BCJR-based scheme when complexity is taken into account.

Key concepts: Turbo equalizer, Intersymbol interference, Turbo, Equalization (audio), Turbo code, Adaptive equalizer, BCJR algorithm, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
The soft-feedback equalizer for turbo equalization of highly dispersive channels — Research Paper | ScholarLens