Change search
ReferencesLink to record
Permanent link

Direct link
Convergence and Complexity Analysis of Delayless Subband Adaptive Filters
Responsible organisation
2004 (English)Report (Other academic)
Abstract [en]

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.

Place, publisher, year, edition, pages
Blekinge Tekniska Högskola Forskningsrapport, ISSN 1103-1581 ; 4
National Category
Signal Processing
URN: urn:nbn:se:bth-00243Local ID: diva2:838087
Available from: 2012-09-18 Created: 2004-04-07 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(837 kB)66 downloads
File information
File name FULLTEXT01.pdfFile size 837 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 66 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 31 hits
ReferencesLink to record
Permanent link

Direct link