A Low-Complexity Delayless Selective Subband Adaptive Filtering Algorithm

Abstract

Adaptive filters of significant order, requiring high computational complexity, are necessary in many applications such as acoustic echo cancellation and wideband active noise control. Successful approaches to lessen the computational complexity of such filters are subband methods, and partial updating schemes where only a part of the filter is updated at each instant. To avoid the time delay introduced by the subband-splitting, delayless structures which reconstructs a fullband filter, producing delayless output, from the adaptive subband filters have been proposed. This paper proposes a delayless subband adaptive filter partial updating scheme, where the general idea is to only update the most misadjusted subband filter(s). Analysis in terms of mean square deviation is presented and shows that the fullband filter convergence speed is significantly increased, even for flat spectrum signals, as compared to traditional periodic subband filter update with the same computational complexity. Echo cancellation simulations with an artificial system to verify the analysis, using both flat spectrum signals and speech, is also presented, as well as offline calculations using signals from a real system.