Spectral line RLS adaptive filtering algorithm

A family of adaptive filtering algorithms for processing signals which have energy concentrated in a relatively small number of component subspaces in the spectral domain is introduced. The approach is based on transform domain signal decomposition and linear least squares filtering of the selected subset of transform domain signal components. The derivation is based on the linear least squares adaptive filtering framework introduced in previous work (1997). Fast convergence and computational efficiency are the main characteristics of the resulting algorithms. The method is applied to the problem of adaptive line enhancement comb filtering and DFT is used as a transform method. It is also shown that the resulting adaptive structure is capable of handling the case of non-coinciding frequencies. The performance of the algorithm is evaluated through a series of simulation experiments