arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.00147eess.SP
收藏

带延迟块系数自适应的LMS算法的随机分析

Stochastic Analysis of LMS Algorithm with Delayed Block Coefficient Adaptation

Mohd. Tasleem Khan, Oscar Gustafsson

AI总结:

本文提出延迟块LMS算法,联合考虑流水线和块处理,通过随机分析估计步长界限、精度和速度,并发现延迟与块大小对收敛速度的影响,模拟验证了理论估计。

摘要:

在最小均方(LMS)自适应滤波算法的高采样率应用中,需要采用流水线处理和/或块处理。与早期工作不同,本文联合考虑了流水线处理和块处理,从而得到了我们称之为延迟块LMS(DBLMS)算法。基于延迟块超额均方误差(MSE)的递推关系,提出了稳态和瞬态两种不同的随机分析方法,以估计步长界限、自适应精度和自适应速度。研究了不同流水线延迟量和块大小对不同滤波器长度和加速比下自适应滤波器的自适应精度和速度的影响。结论是,在恒定加速比下,大延迟和小块大小相比小延迟和大块大小,收敛速度较慢,但稳态MSE几乎相同。蒙特卡洛模拟表明,对于高斯输入,所提出的估计与模拟结果吻合良好。

英文摘要:

In high sample-rate applications of the least-mean-square (LMS) adaptive filtering algorithm, pipelining or/and block processing is required. As opposed to earlier work, pipelining and block processing are jointly considered to obtain what we refer to as the delayed block LMS (DBLMS) algorithm. Different stochastic analyses for the steady and transient states to estimate the step-size bound, adaptation accuracy, and adaptation speed based on the recursive relation of delayed block excess mean square error (MSE) are presented. The effect of different amounts of pipelining delays and block sizes on the adaptation accuracy and speed of the adaptive filter with different filter lengths and speed-ups are studied. It is concluded that for a constant speed-up, a large delay and small block size lead to a slower convergence rate compared to a small delay and large block size with almost the same steady-state MSE. Monte Carlo simulations indicate a good agreement with the proposed estimates for Gaussian inputs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑