Skip to content Skip to navigation

Connexions

You are here: Home » Content » Beyond LMS: an overview of other adaptive filter algorithms

Navigation

Content Actions
  • Download module PDF
  • Add to ...
    Add the module to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is 'My Favorites'?)
      'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.
    • A lens (What is a lens?)

      Definition of a lens

      Lenses

      A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

      What is in a lens?

      Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

      Who can create a lens?

      Any individual Connexions member, a community, or a respected organization.

    • External bookmarks
  • E-mail the author

Lenses

What is a lens?

Definition of a lens

Lenses

A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

What is in a lens?

Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

Who can create a lens?

Any individual Connexions member, a community, or a respected organization.

This content is ...

In these lenses

  • richb's DSP

    This module is included inLens: richb's DSP resources
    By: Richard BaraniukAs a part of collection:"Adaptive Filters"

    Comments:

    "A good introduction in adaptive filters, a major DSP application."

    Click the "richb's DSP" link to see all content selected in this lens.

Recently Viewed

Tags

(What is a tag?)

These tags come from the endorsement, affiliation, and other lenses that include this content.

Beyond LMS: an overview of other adaptive filter algorithms

Module by: Douglas L. Jones

RLS algorithms

FIR adaptive filter algorithms with faster convergence. Since the Wiener solution can be obtained on one step by computing W opt =R-1P W opt R P , most RLS algorithms attept to estimate R-1 R and PP and compute W opt W opt from these.

There are a number of ON2 O N 2 algorithms which are stable and converge quickly. A number of ON O N algorithms have been proposed, but these are all unstable except for the lattice filter method. This is described to some extent in the text. The adaptive lattice filter converges quickly and is stable, but reportedly has a very high noise floor.

Many of these approaches can be thought of as attempting to "orthogonalize" RR, or to rotate the data or filter coefficients to a domain where RR is diagonal, then doing LMS in each dimension separately, so that a fast-converging step size can be chosen in all directions.

Frequency-domain methods

Frequency-domain methods implicitly attempt to do this:

Figure 1
Figure 1 (fig1BeyondLMS.png)
If QRQ-1 Q R Q is a diagonal matrix, this yields a fast algorithm. If QQ is chosen as an FFT matrix, each channel becomes a different frequency bin. Since RR is Toeplitz and not a circulant, the FFT matrix will not exactly diagonalize RR, but in many cases it comes very close and frequency domain methods converge very quickly. However, for some RR they perform no better than LMS. By using an FFT, the transformation QQ becomes inexpensive ONlogN O N N . If one only updates on a block-by-block basis (once per NN samples), the frequency domain methods only cost OlogN O N computations per sample. which can be important for some applications with large NN. (Say 16,000,000)

Comments, questions, feedback, criticisms?

Send feedback