.png){kind=icon}
.png){kind=icon}
Return
A Low Complexity NSAF Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2012.2215321.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter proposes a novel normalized subband adaptive filter (NSAF) algorithm, which applies variable step sizes to subband filters to improve the convergence performance of the conventional NSAF and update only a subset of the subbands per iteration to reduce its computational complexity. The selection process for each subband is based on the amount of improvement it makes to the mean square deviation at every iteration. Simulation results show significant reduction in computational complexity, faster convergence rate, and lower misadjustment error achieved using the proposed scheme.
Keywords:
Computational complexity
normalized subband adaptive filter (NSAF)
variable step size NSAF (VSS-NSAF)
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W