Efficient Least-Squares Adaptive Filters for non-Tapped Delay-Line Structures

This talk provides an overview of recent work on efficient adaptive filters of the least-squares type for filter structures that are not restricted to tapped-delay lines. While it is commonly believed in the literature that shift-structure in the data is necessary for the derivation of fast least-squares algorithms, this work shows that fixed-order and order- recursive filters can still be derived for more general data structures. The results are applied in particular to Laguerre filters.