DocumentCode
801931
Title
New constraining method for partitioned block frequency-domain adaptive filters
Author
Derkx, René M M ; Egelmeers, Gerard P M ; Sommen, Piet C W
Author_Institution
Philips Res. Lab., Eindhoven, Netherlands
Volume
50
Issue
9
fYear
2002
fDate
9/1/2002 12:00:00 AM
Firstpage
2177
Lastpage
2186
Abstract
For adaptive filters with many taps, a short processing delay, and relative low computational complexity, the partitioned block frequency-domain adaptive filter (PBFDAF) is a good choice. The computational complexity of this algorithm is significantly reduced by using the alternated constrained PBFDAF. This particular algorithm applies gradient constraints in an alternating manner. In this paper, a serious problem in performance of the alternated constrained PBFDAF is described. Furthermore, a modification is proposed that effectively alleviates this problem. By using this modification together with a gradient constraint approximation, a new efficient alternated constrained PBFDAF is developed. Compared with the fully constrained PBFDAF, this new constraining method does not show any significant performance loss and still has a much smaller computational complexity.
Keywords
adaptive filters; adaptive signal processing; approximation theory; computational complexity; delays; filtering theory; frequency-domain synthesis; gradient methods; alternated constrained PBFDAF; computational complexity; constraining method; gradient constraint approximation; partitioned block frequency-domain adaptive filters; processing delay; Adaptive filters; Computational complexity; Convergence; Convolution; Degradation; Delay; Least squares approximation; Partitioning algorithms; Pollution; Signal processing algorithms;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/TSP.2002.801932
Filename
1025581
Link To Document