控制理论(社会学)
趋同(经济学)
数学
噪音(视频)
收敛速度
滤波器(信号处理)
自适应滤波器
功率(物理)
计算机科学
算法
物理
计算机网络
频道(广播)
控制(管理)
量子力学
人工智能
经济
图像(数学)
计算机视觉
经济增长
出处
期刊:IEEE Transactions on Audio, Speech, and Language Processing
[Institute of Electrical and Electronics Engineers]
日期:2009-09-24
卷期号:18 (6): 1290-1299
被引量:120
标识
DOI:10.1109/tasl.2009.2032948
摘要
The normalized subband adaptive filter (NSAF) presented by Lee and Gan can obtain faster convergence rate than the normalized least-mean-square (NLMS) algorithm with colored input signals. However, similar to other fixed step-size adaptive filtering algorithms, the NSAF requires a tradeoff between fast convergence rate and low misadjustment. Recently, a set-membership NSAF (SM-NSAF) has been developed to address this problem. Nevertheless, in order to determine the error bound of the SM-NSAF, the power of the system noise should be known. In this paper, we propose a variable step-size matrix NSAF (VSSM-NSAF) from another point of view, i.e., recovering the powers of the subband system noises from those of the subband error signals of the adaptive filter, to further improve the performance of the NSAF. The VSSM-NSAF uses an effective system noise power estimate method, which can also be applied to the under-modeling scenario, and therefore need not know the powers of the subband system noises in advance. Besides, the steady-state mean-square behavior of the proposed algorithm is analyzed, which theoretically proves that the VSSM-NSAF can obtain a low misadjustment. Simulation results show good performance of the new algorithm as compared to other members of the NSAF family.
科研通智能强力驱动
Strongly Powered by AbleSci AI