1 January 2011

Greedy algorithms for sparse adaptive decision feedback equalization

Lalos, A., Vlachos, E., Berberidis, K., Rontogiannis, A.
IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

Abstract

In this paper we propose two new adaptive decision feedback equalization (DFE) schemes for channels with long and sparse impulse responses. It has been shown that for a class of channels, and under reasonable assumptions concerning the DFE filter sizes, the feedforward (FF) and feedback (FB) filters possess also a sparse form. The sparsity form of both the channel impulse response (CIR) and the equalizer filters is properly exploited and two novel adaptive greedy schemes are derived. The first scheme is a channel estimation based one. In this scheme, the non-negligible taps of the involved CIR are first estimated via a new greedy algorithm, and then the FF and FB filters are adaptively computed by exploiting a useful relation between these filters and the CIR. The channel estimation part of this new technique is based on the steepest descent (SD) method and offers considerably improved performance as compared to other adaptive greedy algorithms that have been proposed. The second scheme is a direct adaptive sparse equalizer based on a SD-based greedy algorithm.

Type 1
Publication IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)
Date January 2011

Key Contributions

  • Proposing two novel adaptive greedy algorithms for sparse decision feedback equalization (DFE) in communication channels.
  • Developing a channel estimation-based approach that first identifies significant channel taps using a greedy algorithm and then adaptively computes the equalizer filters.
  • Demonstrating significantly improved performance in convergence speed, tracking capabilities, and reduced complexity compared to non-sparsity-aware methods and prior sparse-aware algorithms.
  • Offering a direct adaptive sparse equalizer based on a steepest descent (SD)-based greedy algorithm.

Results & Insights

The results demonstrate that the proposed schemes exhibit significantly improved tracking capabilities when channel parameters change dynamically, as shown in Figure 1(c). The algorithms maintain better performance and adapt faster to the evolving channel conditions compared to existing methods like the one in [7].