Convergence and Complexity Analysis of Delayless Subband Adaptive Filters

Document type: Researchreports
Full text:
Author(s): Jan Mark de Haan
Title: Convergence and Complexity Analysis of Delayless Subband Adaptive Filters
Series: Research Report
Year: 2004
Issue: 4
ISSN: 1103-1581
Organization: Blekinge Institute of Technology
Department: School of Engineering - Dept. of Signal Processing (Sektionen för teknik – avd. för signalbehandling)
School of Engineering S- 372 25 Ronneby
+46 455 38 50 00
Authors e-mail:
Language: English
Abstract: Subband adaptive filters have been proposed to circumvent the
drawbacks of slow convergence and high computational complexity
associated with time domain adaptive filters. Subband processing
introduces transmission delays and signal degradations due to
aliasing effects. In order to overcome the transmission delays,
delayless adaptive filtering has been introduced where the
coefficient adaptation is performed in the subband domain while
signal filtering is performed in fullband. In this paper
convergence behavior and computational complexity of two different
types of delayless adaptive filters are considered. Both open loop
and closed loop configurations are studied. The theoretical
results are compared with simulations of algorithms in a system
identification scenario.
Subject: Signal Processing\General
Signal Processing\Speech Enhancement
Signal Processing\Filter Design
URN: urn:nbn:se:bth-00243