新的变块长频域批处理LMS算法

针对传统的频域批处理LMS（Frequency-domain Block Least Mean Square,FBLMS）算法在收敛速度和稳态误差之间存在矛盾的问题,不同于变步长LMS算法,提出了一种新的变块长频域批处理LMS算法,采用自适应改变的批处理块块长的方法来协调解决这个矛盾。通过Matlab对提出的算法进行计算机仿真,结果表明相比于传统的FBLMS算法,新算法具有更快的收敛速度和更小的稳态误差。     

一种改进变步长LMS算法的性能研究

在对传统LMS算法、变步长LMS算法及其改进算法分析的基础上,提出了一种改进的变步长LMS算法。新算法通过建立步长因子与误差信号之间的非线性函数关系,使其初始阶段和时变阶段步长自适应增大和稳态阶段步长很小,理论分析及计算机的仿真结果表明,该算法可保证较快的收敛速度和较小的失调,能更好地解决收敛速度和稳态误差的内在矛盾,可更好地应用于自适应系统中。     

改进的自适应LMS算法

LMS（Least Mean Square）算法因其结构简单、稳定性好等优点,得到了广泛的应用,但在收敛速度和稳态失调之间存在着固有矛盾,通过对步长因子的调整可以克服这一矛盾。分析研究了已有的变步长LMS算法,在此基础上提出了一种改进的变步长LMS算法。理论分析和计算机仿真表明该算法不但具有较快的收敛速率,并且具有更小的稳态误差。     

一种新变步长LMS算法及在自适应波束形成中的应用

LMS算法是智能天线自适应波束形成算法中的经典算法,由于其步长固定,造成收敛速度和稳态失调之间的矛盾。为了解决这一问题,提出一种新的变步长LMS算法,并在算法中引入误差信号的自相关估计,大大降低了噪声的干扰,对算法进行仿真,得到了最优的参数设置。利用蒙特卡罗方法对算法进行了性能评估,与传统的LMS算法、NLMS算法相比,新的变步长LMS算法具有更快的收敛速度和较小的稳态误差及优良的抗噪性能。     

一种改进的LMS算法及其在噪声对消中的应用

在分析传统定步长LMS(Least Mean Square)算法和变步长LMS算法的基础上,提出了一种改进的变步长LMS算法.新算法利用瞬时误差绝对值三次方的指数形式和遗忘因子同时调整步长,更好地解决了收敛速度和稳态误差的矛盾.将三种算法均用到噪声对消中进行比较,仿真结果表明:新算法收敛速率优于传统定步长LMS算法和变步长LMS算法.     

基于指数函数的归一化变步长LMS算法

在研究归一化最小均方误差(NLMS)算法的基础上,提出一种基于指数函数的变步长LMS算法。通过建立误差 和步长 的函数关系,实时调整步长,并对输入信号完成时域信号解相关,解决稳态失调系数与收敛速度的矛盾。仿真实验结果证明,该算法与传统LMS算法、SVS_LMS算法、NLMS算法以及双曲正切变步长LMS算法相比,具有更高的收敛速度和较小的稳态失调系数。     

一种新的变步长LMS自适应滤波算法

传统LMS算法的优点是计算简单、易于实现，缺点是收敛速度慢，如果为加快收敛速度而增大步长因子μ，则会导致大的稳态误差，甚至引起算法发散。固定步长因子无法解决收敛速度和稳态误差之间的矛盾。本文通过建立步长因子μ与误差信号之间的非线性函数关系，得出一种新的变步长自适应滤波算法（SVSLMS）。理论分析和计算机仿真结果表明该算法的性能优于传统的LMS算法和NLMS算法。即在计算量增加不多的前提下，能同时获得较快的收敛、跟踪速度和较小的稳态误差。     

一种变步长最小均方算法

最小均方算法（LMS）以计算简单,易于实现等优点被广泛用于自适应滤波领域。但其固定的步长导致了收敛速度和稳态误差之间的矛盾。通过引入非线性函数提出一种新的基于非线性函数的变步长最小均方算法,仿真结果表明该算法具有较好的收敛性能和较小的稳态误差。     

改进的LMS算法自适应滤波器的DSP实现

分析了变步长LMS算法自适应滤波器基本原理,使用MATLAB对其进行仿真,并应用SZ-EPP5402评估板进行了DSP实现,结果表明,变步长LMS算法能够克服固定步长LMS算法的矛盾,具有较快收敛速度与较小稳态误差.     

一种改进的变步长LMS自适应滤波算法及性能分析

针对现有LMS（Least Mean Square）算法不能同时提高收敛速度及降低稳态误差的矛盾,提出一种改进的变步长LMS算法,建立了步长参数μ(n)与误差信号e(n)之间的一种新的非线性函数关系: 与现有的算法相比,同时引入记忆因子λ和控制函数取值的参数β(n),使当前步长与上一次迭代所得步长及前M个误差的平方相关。理论分析和计算机仿真结果表明,与现有几种常见的LMS算法相比,改进的算法收敛速度和稳态误差的性能指标得到提高。     

一种新的变步长频域块LMS算法

针对现有直接序列扩频（DSSS）通信抗干扰系统中的传统频域块最小均方误差（FBLMS）算法在收敛速度和稳态误差之间存在矛盾的问题,提出了一种新的变步长算法--VSS-FBLMS算法,该算法通过输出信号中剩余干扰所占整体噪声信号的比例来调节变步长因子,步长因子随着干扰的被滤除而逐渐减小,使得DSSS通信抗干扰系统获得更好的抑制干扰效果。首先对传统FBLMS算法的DSSS抗干扰系统进行了介绍,然后对提出的VSS-FBLMS算法进行分析,最后将新算法和传统算法加入DSSS通信抗干扰系统中进行仿真对比。理论分析和仿真结果表明,VSS-FBLMS算法不仅可以有效滤除窄带干扰,而且抗干扰性能优于传统FBLMS算法,收敛速率和稳态误差也都优于传统FBLMS算法。     

一种改进的变步长LMS自适应算法及分析

现有的变步长LMS算法中,大都采用建立步长因子与误差信号的函数关系的方法,以提高算法的收敛速度和跟踪性能,但由于未考虑输入信号对算法性能的影响,使得当输入信号发生变化后,稳态误差明显增大。为此,在现有算法的基础上,引入了输入信号因子,提出了一种改进算法。该算法可根据瞬时误差和输入信号来调整步长因子,使算法不仅能保持较高的收敛速度和跟踪性能,还可在输入信号变化的情况下,保证较小的稳态误差。理论分析及仿真实验表明新算法的性能优于现有算法。     

A variable step-size selective partial update LMS algorithm

Selective partial update of the adaptive filter coefficients has been a popular method for reducing the computational complexity of least mean-square (LMS)-type adaptive algorithms. These algorithms use a fixed step-size that forces a performance compromise between fast convergence speed and small steady state misadjustment. This paper proposes a variable step-size (VSS) selective partial update LMS algorithm, where the VSS is an approximation of an optimal derived one. The VSS equations are controlled by only one parameter, and do not require any a priori information about the statistics of the system environment. Mean-square performance analysis will be provided for independent and identically distributed (i.i.d.) input signals, and an expression for the algorithm steady state excess mean-square error (MSE) will be presented. Simulation experiments are conducted to compare the proposed algorithm with existing full-update VSS LMS algorithms, which indicate that the proposed algorithm performs as well as these algorithms while requiring less computational complexity.     

一种快速收敛的变步长自适应谐波检测算法

为解决传统固定步长LMS自适应算法在电网谐波检测中存在的收敛速度和稳态误差之间的矛盾,本文提出了一种快速收敛的变步长自适应谐波检测算法。该算法以误差反馈信号、误差信号在总误差信号中所占的比率以及负载电流的相邻两个采样值之差的和作为自适应反馈量,并通过自适应反馈量的相干平均估计来控制步长的更新;同时对系统权值迭代公式进行改进提高收敛速度;并改传统的固定步长变化范围为时变范围,使步长变化更加平滑。该方法在负载突变的情况下有很好的跟踪性能,可有效的提高初始收敛速度、减小稳态失调。仿真分析及实验证明了该算法在谐波检测中的有效性和准确性。     

Optimal variable step-size LMS model and algorithm with independence assumption

To solve the contradiction between convergence rate and steady-state error in least mean square (LMS) algorithm, basing on independence assumption, this paper proposes and proves the optimal step-size theorem from the view of minimizing mean squared error (MSE). The theorem reveals the one-to-one mapping between the optimal step-size and MSE. Following the theorem, optimal variable step-size LMS (OVS-LMS) model, describing the theoretical bound of the convergence rate of LMS algorithm, is constructed. Then we discuss the selection of initial optimal step-size and updating of optimal step-size at the time of unknown system changing. At last an optimal step-size LMS algorithm is proposed and tested in various environments. Simulation results show the proposed algorithm is very close to the theoretical bound.     

A unified framework for adaptive filter algorithms with variable step-size

Employing a recently introduced framework within which a large number of classical and modern adaptive filter algorithms can be viewed as special cases, we extend this framework to cover block normalized LMS (BNLMS) and normalized data reusing LMS (NDRLMS) adaptive filter algorithms. Accordingly, we develop a generic variable step-size adaptive filter. Variable step-size normalized LMS (VSSNLMS) and VSS affine projection algorithms (VSSAPA) are particular examples of adaptive algorithms covered by this generic variable step-size adaptive filter. In this paper we introduce two new VSS adaptive filter algorithms named the variable step-size BNLMS (VSSBNLMS) and the variable step-size NDRLMS (VSSNDRLMS) based on the generic VSS adaptive filter. The proposed algorithms show the higher convergence rate and lower steady-state mean square error compared to the ordinary BNLMS and NDRLMS algorithms.     

Superior step-size theorem and its application

With independence assumption, this paper proposes and proves the superior step-size theorem on least mean square (LMS) algorithm, from the view of minimizing mean squared error (MSE). Following the theorem we construct a parallel variable step-size LMS filters algorithm. The theoretical model of the proposed algorithm is analyzed in detail. Simulations show the proposed theoretical model is quite close to the optimal variable step-size LMS (OVS-LMS) model. The experimental learning curves of the proposed algorithm also show the fastest convergence and fine tracking performance. The proposed algorithm is therefore a good realization of the OVS-LMS model.     

Superior step-size theorem and its application——Parallel variable step-size LMS filters algorithm

In several branches of adaptive filtering algorithms, the least mean square (LMS) algorithm is widely applied in many areas because of its low computational cost, good numerical stability and other features[1]. However, the contradiction between faster convergence and smaller steady-state mean squared error (MSE) affects its performance considerably. Step-size, as the key to the problem, can but offer only one choice of the two demands. Therefore, many variable step-size algorithms were prop…     

Superior step-size theorem and its application-Parallel variable step-size LMS filters algorithm

With independence assumption, this paper proposes and proves the superior step-size theorem on least mean square (LMS) algorithm, from the view of minimizing mean squared error (MSE). Following the theorem we construct a parallel variable step-size LMS filters algorithm. The theoretical model of the proposed algorithm is analyzed in detail. Simulations show the proposed theoretical model is quite close to the optimal variable step-size LMS (OVS-LMS) model. The experimental learning curves of the proposed algorithm also show the fastest convergence and fine tracking performance.The proposed algorithm is therefore a good realization of the OVS-LMS model.