.png){kind=icon}
.png){kind=icon}
Return
Normalized Subband Adaptive Filtering Algorithm With Reduced Computational Complexity
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2015.2468952.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Subband structures are suitable for improving convergence properties of adaptive filtering algorithms, particularly for colored input signals. This brief proposes a new subband adaptive algorithm with sparse adaptive subfilters, which employs the principle of minimal disturbance with multiple-constraint optimization. A performance analysis is carried out, resulting in an expression for the steady-state mean-square error. It is shown that the proposed algorithm, under some particular parameter choices, presents the same performance as that of the normalized subband adaptive filter, but with reduced computational complexity.
Keywords:
Adaptive filtering
multirate processing
subband structures
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W