By analyzing algorithms available for variable step size least mean square(LMS)adaptive filter,a new modified LMS adaptive filtering algorithm with variable step size is proposed,along with performance analysis based ...By analyzing algorithms available for variable step size least mean square(LMS)adaptive filter,a new modified LMS adaptive filtering algorithm with variable step size is proposed,along with performance analysis based on different parameters.Compared with the existing algorithms through the simulation,the proposed algorithm has faster convergence speed and smaller steady state error.展开更多
This paper puts forward a new variable step size LMS adaptive algorithm based on variable region. The step size μ(k) in the algorithm varies with the variation of the region of deviation e(k) to ensure the optimizati...This paper puts forward a new variable step size LMS adaptive algorithm based on variable region. The step size μ(k) in the algorithm varies with the variation of the region of deviation e(k) to ensure the optimization of the three performance objectives including initial convergent speed, trace ability of the time-varying system and steady disregulation. The paper demonstrates the convergence of the algorithm accompanied by random noise.展开更多
The contradiction of variable step size least mean square(LMS)algorithm between fast convergence speed and small steady-state error has always existed.So,a new algorithm based on the combination of logarithmic and sym...The contradiction of variable step size least mean square(LMS)algorithm between fast convergence speed and small steady-state error has always existed.So,a new algorithm based on the combination of logarithmic and symbolic function and step size factor is proposed.It establishes a new updating method of step factor that is related to step factor and error signal.This work makes an analysis from 3 aspects:theoretical analysis,theoretical verification and specific experiments.The experimental results show that the proposed algorithm is superior to other variable step size algorithms in convergence speed and steady-state error.展开更多
A newly proposed competent population-based optimization algorithm called RUN,which uses the principle of slope variations calculated by applying the Runge Kutta method as the key search mechanism,has gained wider int...A newly proposed competent population-based optimization algorithm called RUN,which uses the principle of slope variations calculated by applying the Runge Kutta method as the key search mechanism,has gained wider interest in solving optimization problems.However,in high-dimensional problems,the search capabilities,convergence speed,and runtime of RUN deteriorate.This work aims at filling this gap by proposing an improved variant of the RUN algorithm called the Adaptive-RUN.Population size plays a vital role in both runtime efficiency and optimization effectiveness of metaheuristic algorithms.Unlike the original RUN where population size is fixed throughout the search process,Adaptive-RUN automatically adjusts population size according to two population size adaptation techniques,which are linear staircase reduction and iterative halving,during the search process to achieve a good balance between exploration and exploitation characteristics.In addition,the proposed methodology employs an adaptive search step size technique to determine a better solution in the early stages of evolution to improve the solution quality,fitness,and convergence speed of the original RUN.Adaptive-RUN performance is analyzed over 23 IEEE CEC-2017 benchmark functions for two cases,where the first one applies linear staircase reduction with adaptive search step size(LSRUN),and the second one applies iterative halving with adaptive search step size(HRUN),with the original RUN.To promote green computing,the carbon footprint metric is included in the performance evaluation in addition to runtime and fitness.Simulation results based on the Friedman andWilcoxon tests revealed that Adaptive-RUN can produce high-quality solutions with lower runtime and carbon footprint values as compared to the original RUN and three recent metaheuristics.Therefore,with its higher computation efficiency,Adaptive-RUN is a much more favorable choice as compared to RUN in time stringent applications.展开更多
Nano-volt magnetic resonance sounding(MRS) signals are sufficiently weak so that during the actual measurement, they are affected by environmental electromagnetic noise, leading to inaccuracy of the extracted characte...Nano-volt magnetic resonance sounding(MRS) signals are sufficiently weak so that during the actual measurement, they are affected by environmental electromagnetic noise, leading to inaccuracy of the extracted characteristic parameters and hindering effective inverse interpretation. Considering the complexity and non-homogeneous spatial distribution of environmental noise and based on the theory of adaptive noise cancellation, a model system for noise cancellation using multi-reference coils was constructed to receive MRS signals. The feasibility of this system with theoretical calculation and experiments was analyzed and a modified sigmoid variable step size least mean square(SVSLMS) algorithm for noise cancellation was presented. The simulation results show that, the multi-reference coil method performs better than the single one on both signal-to-noise ratio(SNR) improvement and signal waveform optimization after filtering, under the condition of different noise correlations in the reference coils and primary detecting coils and different SNRs. In particular, when the noise correlation is poor and the SNR<0, the SNR can be improved by more than 8 dB after filtering with multi-reference coils. And the average fitting errors for initial amplitude and relaxation time are within 5%. Compared with the normalized least mean square(NLMS) algorithm and multichannel Wiener filter and processing field test data, the effectiveness of the proposed method is verified.展开更多
为改善滤波-x最小均方(filtered-x least mean square,FxLMS)算法在噪声主动控制时无法兼顾收敛速度和稳态误差的问题,提出了基于sigmoid-sinh分段函数的FxLMS(SSFxLMS)算法,并引入蚁狮算法对SFxLMS(sigmoid filtered-x least mean squa...为改善滤波-x最小均方(filtered-x least mean square,FxLMS)算法在噪声主动控制时无法兼顾收敛速度和稳态误差的问题,提出了基于sigmoid-sinh分段函数的FxLMS(SSFxLMS)算法,并引入蚁狮算法对SFxLMS(sigmoid filtered-x least mean square)、ShFxLMS(sinh filtered-x least mean square)、SSFxLMS算法的参数进行优化。分别采用高斯白噪声和实测簇绒地毯织机噪声为输入信号,采用FxLMS、SFxLMS、ShFxLMS、SSFxLMS算法进行噪声主动控制仿真,对比分析这4种算法的性能。结果表明:与其他3种算法相比,采用SSFxLMS算法对高斯白噪声和簇绒地毯织机噪声进行控制时,误差信号的平均绝对值更小,平均降噪量与收敛速度也有大幅度提升。由此可知,SSFxLMS算法有效改善了FxLMS算法无法兼顾收敛速度和稳态误差的问题,研究结果为噪声主动控制算法设计提供了一定的参考。展开更多
A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization f...A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization factor(RF) is then employed to control the contribution made by the MD constraint in the cost function. Analysis results show that the RF can be taken as a combination of the step size and regularization parameter in the conventional NLMS. This implies that these parameters can be jointly controlled by simply tuning the RF as the proposed algorithm does. It also demonstrates that the RF can accelerate the convergence rate of the proposed algorithm and its optimal value can be obtained by minimizing the squared noise-free posteriori error. A method for automatically determining the value of the RF is also presented, which is free of any prior knowledge of the noise. While simulation results verify the analytical ones, it is also illustrated that the performance of the proposed algorithm is superior to the state-of-art ones in both the steady-state misalignment and the convergence rate. A novel algorithm is proposed to solve some problems. Simulation results show the effectiveness of the proposed algorithm.展开更多
The problem of inter symbol interference( ISI) in wireless communication systems caused by multipath propagation when using high order modulation like M-Q AMis solved. Since the wireless receiver doesn't require a ...The problem of inter symbol interference( ISI) in wireless communication systems caused by multipath propagation when using high order modulation like M-Q AMis solved. Since the wireless receiver doesn't require a training sequence,a blind equalization channel is implemented in the receiver to increase the throughput of the system. To improve the performances of both the blind equalizer and the system,a joint receiving mechanismincluding variable step size( VSS) modified constant modulus algorithms( MC-MA) and modified decision directed modulus algorithms( MD DMA) is proposed to ameliorate the convergence speed and mean square error( MSE) performance and combat the phase error when using high order QAM modulation. The VSS scheme is based on the selection of step size according to the distance between the output of the equalizer and the desired output in the constellation plane. Analysis and simulations showthat the performance of the proposed VSS-MCMA-MD DMA mechanismis better than that of algorithms with a fixed step size. In addition,the MCMA-MDDMA with VSS can performthe phase recovery by itself.展开更多
为解决自适应最小均方误差(least mean squares,LMS)滤波算法难以平衡稳态误差和收敛速度的问题,提出了基于对称非线性函数的变步长LMS自适应滤波算法。通过自变量取绝对值、叠加非线性拉伸量改进Sig-moid函数,构造一个对称非线性函数...为解决自适应最小均方误差(least mean squares,LMS)滤波算法难以平衡稳态误差和收敛速度的问题,提出了基于对称非线性函数的变步长LMS自适应滤波算法。通过自变量取绝对值、叠加非线性拉伸量改进Sig-moid函数,构造一个对称非线性函数用于刻画步长因子与稳态误差的非线性关系。该对称非线性函数具有能够根据误差动态调整步长、更快达到收敛状态的特点。根据构造的对称非线性函数和输入信号功率生成归一化变步长因子,解决噪声逐级放大的问题,进一步提高算法的滤波效果同时,加速收敛。实验表明:该算法在低信噪比、信噪比变化、信号频率变化、滤波器阶数变化、延迟采样点数变化条件下均具有更好的滤波效果、更优的稳定性和更快的收敛速度。展开更多
针对非高斯环境下传统变步长LMS(Variable step-size least mean square,VSS-LMS)算法性能不佳的问题,基于传统的VSS-LMS算法利用双曲正弦函数构建变步长的更新策略,提出一种基于双曲正弦函数的变步长LMS算法。并在理论上分析了新提出VS...针对非高斯环境下传统变步长LMS(Variable step-size least mean square,VSS-LMS)算法性能不佳的问题,基于传统的VSS-LMS算法利用双曲正弦函数构建变步长的更新策略,提出一种基于双曲正弦函数的变步长LMS算法。并在理论上分析了新提出VSS-LMS算法的收敛性与算法复杂度,并给出在不同输入信号时对两种特性的线性系统的VSS-LMS算法的辨识结果,且每次仿真中都在不同分布的非高斯噪声下进行。结果表明,提出的算法相比Log-NLMS算法和改进G-SVSLMS算法,新提出的VSS-LMS算法具有更快的收敛速度和较好的稳态特性,且稳态误差趋于理论的SNR。展开更多
针对油浸式电力变压器瞬态温升计算效率过低的问题,该文提出本征正交分解-αATS(proper orthogonal decomposition-adaptive time stepping based onαfactor,POD-αATS)降阶自适应变步长瞬态计算方法。首先,推导变压器绕组瞬态温升计...针对油浸式电力变压器瞬态温升计算效率过低的问题,该文提出本征正交分解-αATS(proper orthogonal decomposition-adaptive time stepping based onαfactor,POD-αATS)降阶自适应变步长瞬态计算方法。首先,推导变压器绕组瞬态温升计算的有限元离散方程;其次,采用POD降阶算法改善传统瞬态计算中存在的条件数过大及方程阶数过高的问题;同时对于瞬态计算中的时间步长选择问题,提出适用于非线性问题的αATS变步长策略;然后,为验证方法的有效性,基于110 kV油浸式电力变压器绕组的基本结构建立二维八分区数值计算模型,同时将计算结果与基于110 kV绕组的温升实验结果进行对比。数值计算及实验结果表明,所提算法与全阶定步长算法在流场和温度场中的精度几乎相同,且流场计算效率提升约45倍,温度场计算效率提升约38倍,计算速度得到显著提高。这一点在温升实验中同样得到验证,说明该文所提算法的准确性、高效性及一定的工程实用性。展开更多
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...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.展开更多
基金Natural Science Foundation of Shandong Province of China(No.ZR2012FM011)Shandong University of Science and Technology Research Fund(No.2010KYTD101)
文摘By analyzing algorithms available for variable step size least mean square(LMS)adaptive filter,a new modified LMS adaptive filtering algorithm with variable step size is proposed,along with performance analysis based on different parameters.Compared with the existing algorithms through the simulation,the proposed algorithm has faster convergence speed and smaller steady state error.
基金Supported by Natural Science Foundation of Beijing of China (No.2005AA501140)
文摘This paper puts forward a new variable step size LMS adaptive algorithm based on variable region. The step size μ(k) in the algorithm varies with the variation of the region of deviation e(k) to ensure the optimization of the three performance objectives including initial convergent speed, trace ability of the time-varying system and steady disregulation. The paper demonstrates the convergence of the algorithm accompanied by random noise.
基金the National Natural Science Foundation of China(No.51575328,61503232).
文摘The contradiction of variable step size least mean square(LMS)algorithm between fast convergence speed and small steady-state error has always existed.So,a new algorithm based on the combination of logarithmic and symbolic function and step size factor is proposed.It establishes a new updating method of step factor that is related to step factor and error signal.This work makes an analysis from 3 aspects:theoretical analysis,theoretical verification and specific experiments.The experimental results show that the proposed algorithm is superior to other variable step size algorithms in convergence speed and steady-state error.
文摘A newly proposed competent population-based optimization algorithm called RUN,which uses the principle of slope variations calculated by applying the Runge Kutta method as the key search mechanism,has gained wider interest in solving optimization problems.However,in high-dimensional problems,the search capabilities,convergence speed,and runtime of RUN deteriorate.This work aims at filling this gap by proposing an improved variant of the RUN algorithm called the Adaptive-RUN.Population size plays a vital role in both runtime efficiency and optimization effectiveness of metaheuristic algorithms.Unlike the original RUN where population size is fixed throughout the search process,Adaptive-RUN automatically adjusts population size according to two population size adaptation techniques,which are linear staircase reduction and iterative halving,during the search process to achieve a good balance between exploration and exploitation characteristics.In addition,the proposed methodology employs an adaptive search step size technique to determine a better solution in the early stages of evolution to improve the solution quality,fitness,and convergence speed of the original RUN.Adaptive-RUN performance is analyzed over 23 IEEE CEC-2017 benchmark functions for two cases,where the first one applies linear staircase reduction with adaptive search step size(LSRUN),and the second one applies iterative halving with adaptive search step size(HRUN),with the original RUN.To promote green computing,the carbon footprint metric is included in the performance evaluation in addition to runtime and fitness.Simulation results based on the Friedman andWilcoxon tests revealed that Adaptive-RUN can produce high-quality solutions with lower runtime and carbon footprint values as compared to the original RUN and three recent metaheuristics.Therefore,with its higher computation efficiency,Adaptive-RUN is a much more favorable choice as compared to RUN in time stringent applications.
基金Projects(41204079,41504086)supported by the National Natural Science Foundation of ChinaProject(20160101281JC)supported by the Natural Science Foundation of Jilin Province,ChinaProjects(2016M590258,2015T80301)supported by the Postdoctoral Science Foundation of China
文摘Nano-volt magnetic resonance sounding(MRS) signals are sufficiently weak so that during the actual measurement, they are affected by environmental electromagnetic noise, leading to inaccuracy of the extracted characteristic parameters and hindering effective inverse interpretation. Considering the complexity and non-homogeneous spatial distribution of environmental noise and based on the theory of adaptive noise cancellation, a model system for noise cancellation using multi-reference coils was constructed to receive MRS signals. The feasibility of this system with theoretical calculation and experiments was analyzed and a modified sigmoid variable step size least mean square(SVSLMS) algorithm for noise cancellation was presented. The simulation results show that, the multi-reference coil method performs better than the single one on both signal-to-noise ratio(SNR) improvement and signal waveform optimization after filtering, under the condition of different noise correlations in the reference coils and primary detecting coils and different SNRs. In particular, when the noise correlation is poor and the SNR<0, the SNR can be improved by more than 8 dB after filtering with multi-reference coils. And the average fitting errors for initial amplitude and relaxation time are within 5%. Compared with the normalized least mean square(NLMS) algorithm and multichannel Wiener filter and processing field test data, the effectiveness of the proposed method is verified.
文摘为改善滤波-x最小均方(filtered-x least mean square,FxLMS)算法在噪声主动控制时无法兼顾收敛速度和稳态误差的问题,提出了基于sigmoid-sinh分段函数的FxLMS(SSFxLMS)算法,并引入蚁狮算法对SFxLMS(sigmoid filtered-x least mean square)、ShFxLMS(sinh filtered-x least mean square)、SSFxLMS算法的参数进行优化。分别采用高斯白噪声和实测簇绒地毯织机噪声为输入信号,采用FxLMS、SFxLMS、ShFxLMS、SSFxLMS算法进行噪声主动控制仿真,对比分析这4种算法的性能。结果表明:与其他3种算法相比,采用SSFxLMS算法对高斯白噪声和簇绒地毯织机噪声进行控制时,误差信号的平均绝对值更小,平均降噪量与收敛速度也有大幅度提升。由此可知,SSFxLMS算法有效改善了FxLMS算法无法兼顾收敛速度和稳态误差的问题,研究结果为噪声主动控制算法设计提供了一定的参考。
基金supported by the National Natural Science Foundation of China(61571131 11604055)
文摘A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization factor(RF) is then employed to control the contribution made by the MD constraint in the cost function. Analysis results show that the RF can be taken as a combination of the step size and regularization parameter in the conventional NLMS. This implies that these parameters can be jointly controlled by simply tuning the RF as the proposed algorithm does. It also demonstrates that the RF can accelerate the convergence rate of the proposed algorithm and its optimal value can be obtained by minimizing the squared noise-free posteriori error. A method for automatically determining the value of the RF is also presented, which is free of any prior knowledge of the noise. While simulation results verify the analytical ones, it is also illustrated that the performance of the proposed algorithm is superior to the state-of-art ones in both the steady-state misalignment and the convergence rate. A novel algorithm is proposed to solve some problems. Simulation results show the effectiveness of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China(6100201461101129+1 种基金6122700161072050)
文摘The problem of inter symbol interference( ISI) in wireless communication systems caused by multipath propagation when using high order modulation like M-Q AMis solved. Since the wireless receiver doesn't require a training sequence,a blind equalization channel is implemented in the receiver to increase the throughput of the system. To improve the performances of both the blind equalizer and the system,a joint receiving mechanismincluding variable step size( VSS) modified constant modulus algorithms( MC-MA) and modified decision directed modulus algorithms( MD DMA) is proposed to ameliorate the convergence speed and mean square error( MSE) performance and combat the phase error when using high order QAM modulation. The VSS scheme is based on the selection of step size according to the distance between the output of the equalizer and the desired output in the constellation plane. Analysis and simulations showthat the performance of the proposed VSS-MCMA-MD DMA mechanismis better than that of algorithms with a fixed step size. In addition,the MCMA-MDDMA with VSS can performthe phase recovery by itself.
文摘为解决自适应最小均方误差(least mean squares,LMS)滤波算法难以平衡稳态误差和收敛速度的问题,提出了基于对称非线性函数的变步长LMS自适应滤波算法。通过自变量取绝对值、叠加非线性拉伸量改进Sig-moid函数,构造一个对称非线性函数用于刻画步长因子与稳态误差的非线性关系。该对称非线性函数具有能够根据误差动态调整步长、更快达到收敛状态的特点。根据构造的对称非线性函数和输入信号功率生成归一化变步长因子,解决噪声逐级放大的问题,进一步提高算法的滤波效果同时,加速收敛。实验表明:该算法在低信噪比、信噪比变化、信号频率变化、滤波器阶数变化、延迟采样点数变化条件下均具有更好的滤波效果、更优的稳定性和更快的收敛速度。
文摘针对非高斯环境下传统变步长LMS(Variable step-size least mean square,VSS-LMS)算法性能不佳的问题,基于传统的VSS-LMS算法利用双曲正弦函数构建变步长的更新策略,提出一种基于双曲正弦函数的变步长LMS算法。并在理论上分析了新提出VSS-LMS算法的收敛性与算法复杂度,并给出在不同输入信号时对两种特性的线性系统的VSS-LMS算法的辨识结果,且每次仿真中都在不同分布的非高斯噪声下进行。结果表明,提出的算法相比Log-NLMS算法和改进G-SVSLMS算法,新提出的VSS-LMS算法具有更快的收敛速度和较好的稳态特性,且稳态误差趋于理论的SNR。
文摘针对油浸式电力变压器瞬态温升计算效率过低的问题,该文提出本征正交分解-αATS(proper orthogonal decomposition-adaptive time stepping based onαfactor,POD-αATS)降阶自适应变步长瞬态计算方法。首先,推导变压器绕组瞬态温升计算的有限元离散方程;其次,采用POD降阶算法改善传统瞬态计算中存在的条件数过大及方程阶数过高的问题;同时对于瞬态计算中的时间步长选择问题,提出适用于非线性问题的αATS变步长策略;然后,为验证方法的有效性,基于110 kV油浸式电力变压器绕组的基本结构建立二维八分区数值计算模型,同时将计算结果与基于110 kV绕组的温升实验结果进行对比。数值计算及实验结果表明,所提算法与全阶定步长算法在流场和温度场中的精度几乎相同,且流场计算效率提升约45倍,温度场计算效率提升约38倍,计算速度得到显著提高。这一点在温升实验中同样得到验证,说明该文所提算法的准确性、高效性及一定的工程实用性。
基金This work was supported in part by the National Fundamental Research Program(Grant No.G1998030406)the National Natural Science Foundation of China(Grant No.69972020)by the State Key Lab on Microwave and Digital Communications,Department of Electronics Engineering,Tsinghua University.
文摘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.