共查询到20条相似文献,搜索用时 218 毫秒
1.
2.
研究无线通信中多路径传播优化信号质量问题,针对传统的RAKE接收机需要通过增加分支来提高系统性能,提出了一种模糊步长LMS算法的自适应RAKE接收机,采用对抽头延迟线的权值进行自适应调整的方法可以有效地合并多径信号,克服多径干扰,并且消除信号间的干扰和噪声.对LMS算法的步长进行了改进,提出一种新的模糊步长的方法,以便提高LMS算法的收敛速度和降低稳态误差.在MATLAB上进行仿真.仿真结果表明,模糊步长的RAKE接收机性能优于传统的RAKE接收机性能. 相似文献
3.
针对现有直接序列扩频(DSSS)通信抗干扰系统中的传统频域块最小均方误差(FBLMS)算法在收敛速度和稳态误差之间存在矛盾的问题,提出了一种新的变步长算法--VSS-FBLMS算法,该算法通过输出信号中剩余干扰所占整体噪声信号的比例来调节变步长因子,步长因子随着干扰的被滤除而逐渐减小,使得DSSS通信抗干扰系统获得更好的抑制干扰效果。首先对传统FBLMS算法的DSSS抗干扰系统进行了介绍,然后对提出的VSS-FBLMS算法进行分析,最后将新算法和传统算法加入DSSS通信抗干扰系统中进行仿真对比。理论分析和仿真结果表明,VSS-FBLMS算法不仅可以有效滤除窄带干扰,而且抗干扰性能优于传统FBLMS算法,收敛速率和稳态误差也都优于传统FBLMS算法。 相似文献
4.
自适应滤波在生活中有非常广泛的应用,对于未知信号的滤波效果非常显著,本文主要对常规的LMS自适应滤波算法进行改进.常规的LMS算法由于步长因子是固定的,不能同时满足滤波的收敛速度、稳态误差和初始噪声的有效滤除等性能要求.针对上述问题,本文提出了一种改进型LMS算法,改进型LMS算法是通过提出误差因子这一概念,利用误差因... 相似文献
5.
一种新的LMS自适应滤波算法分析仿真研究 总被引:1,自引:0,他引:1
传统变步长最小均方(LMS)算法存在收敛速度慢、易受噪声干扰等缺点,为了提高算法的性能,通过对变步长LMS算法进行分析研究,在步长因子x(n)与误差信号e(n)的相关统计量之间建立一种新的非线性函数关系,提出了一种新的变步长LMS自适应滤波算法。该算法采用误差信号的自相关时间均值来调节步长,并用绝对估计误差的扰动量以加快自适应滤波器抽头权向量的收敛。理论分析与计算机仿真结果表明:与SVSLMS和G-SVSLMS算法比较,该算法具有较快的收敛速度、较小的稳态误差以及较强的抗干扰能力。 相似文献
6.
7.
8.
提出一种基于双曲函数的变步长最小均方(LMS)算法.通过对双曲余弦函数进行数学变换,建立起误差信号与步长因子的LMS算法,根据误差信号的变化来自动调节步长的大小.仿真结果证明:所提出的LMS算法比标准的LMS算法有着更快的收敛速度等优点. 相似文献
9.
在分析传统定步长LMS(Least Mean Square)算法和变步长LMS算法的基础上,提出了一种改进的变步长LMS算法.新算法利用瞬时误差绝对值三次方的指数形式和遗忘因子同时调整步长,更好地解决了收敛速度和稳态误差的矛盾.将三种算法均用到噪声对消中进行比较,仿真结果表明:新算法收敛速率优于传统定步长LMS算法和变步长LMS算法. 相似文献
10.
针对有源噪声控制中滤波-e LMS(最小均方算法)算法收敛速度慢,收敛步长取值范围小及受参考信号自相关矩阵特征值分散程度影响较大的缺点,提出一种改进的滤波-e LMS箅法一动量滤波-e LMS算法.算法在滤波-e LMS算法的基础上,结合动量LMS算法,在权系数更新迭代时引入一个动量项,此动量项包含了先前梯度的估计值.理论推导证明算法不仅可以加快系统的收敛速度还可以扩大收敛因子的取值范围.仿真结果表明,动量滤波-e LMS算法具有收敛速度快、稳态误差小的优点.还讨论了算法中不同动量因子对算法收敛性能的影响,确定了它们的最优取值范围. 相似文献
11.
针对滤波器在亚模型(under-modeling)工作状态下定步长自适应算法收敛速度和稳态误差之间的矛盾,提出一种变步长分割式比例仿射投影算法(VSS-SPAPA)。该算法考虑到系统干扰噪声和滤波器权系数个数小于回声路径长度时引起的亚模型噪声对回声消除系统性能的影响,利用后验误差去补偿这两类噪声的负面作用,建立一个新的目标函数,根据该目标函数,导出一种适用于比例仿射投影算法整体步长的调节方法。仿真结果表明:在增加少量计算量的情况下,新算法的收敛速度和稳态性能与定步长比例仿射投影算法以及已有变步长算法相比得到了明显提高。 相似文献
12.
Khaled Mayyas 《Digital Signal Processing》2013,23(1):75-85
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. 相似文献
13.
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. 相似文献
14.
Mohammad Shams Esfand Abadi Author Vitae Ali Mahlooji Far Author Vitae 《Computers & Electrical Engineering》2008,34(3):232-249
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. 相似文献
15.
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. 相似文献
16.
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. 相似文献
17.
GU Yuantao TANG Kun & CUI Huijuan State Key Laboratory on Microwave Digital Communications Department of Electronics Engineering Tsinghua University Beijing China Correspondence should be addressed to Gu Yuantao 《中国科学F辑(英文版)》2004,(2)
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… 相似文献
18.
19.
现有的单载波频域均衡技术中的定步长频域批处理LMS(Frequency-Domain Block Least Mean Square,FBLMS)算法,在收敛速度和稳态误差之间存在矛盾。针对这个问题,基于对变步长LMS算法的研究分析,提出了一种新的改进的变步长频域批处理LMS自适应滤波算法,通过变步长因子以及频域权系数抽头泄漏能很好地协调收敛速度和稳态误差之间的矛盾,并且还具有较低的算法复杂度的特点。通过Matlab对提出的新算法进行计算机仿真验证,结果表明该算法有较好的收敛速度和较小的稳态误差。 相似文献