Skip to main content

Reduced-Rank Adaptive Filtering Using Krylov Subspace

Abstract

A unified view of several recently introduced reduced-rank adaptive filters is presented. As all considered methods use Krylov subspace for rank reduction, the approach taken in this work is inspired from Krylov subspace methods for iterative solutions of linear systems. The alternative interpretation so obtained is used to study the properties of each considered technique and to relate one reduced-rank method to another as well as to algorithms used in computational linear algebra. Practical issues are discussed and low-complexity versions are also included in our study. It is believed that the insight developed in this paper can be further used to improve existing reduced-rank methods according to known results in the domain of Krylov subspace methods.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Sergueï Burykh.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Burykh, S., Abed-Meraim, K. Reduced-Rank Adaptive Filtering Using Krylov Subspace. EURASIP J. Adv. Signal Process. 2002, 535098 (2003). https://doi.org/10.1155/S1110865702209129

Download citation

Keywords

  • adaptive filters
  • reduced-rank adaptive filters
  • multiuser detection
  • array processing
  • Krylov subspace methods