Fast sliding transforms in transform-domain adaptive filtering

Transform-domain adaptive signal processing proved to be very successful in very many applications especially where systems with long impulse responses are to be evaluated. The popularity of these methods is due to the efficiency of the fast signal transformation algorithms and that of the block oriented adaptation mechanisms. The applicability of the fast sliding transformation algorithms is investigated for transform domain adaptive signal processing. It is shown that these sliding transformers may contribute to a better distribution of the computational load along time and therefore enable higher sampling rates. It is also shown that the execution time of the widely used overlap-save and overlap-add algorithms can also be shortened. The prize to be paid for this improvements is the increase of the end-to-end delay which in certain configurations may cause some degradation of the tracking capabilities of the overall system. Fortunately, however, there are versions where this delay does not hurt the capabilities of the adaptation technique applied.