基于LMS算法的EDC性能分析

对光纤通信系统中的电域色散补偿(EDC)技术进行了深入研究,利用Optisystem8.0和Matlab7.1联合搭建仿真系统平台,分析了基于最小均方(LMS)算法的电域色散补偿性能。仿真结果表明,滤波器参数(收敛因子,抽头数)、系统传输特性以及调制格式对最小均方算法的收敛速度和稳态误差都有较大的影响,要求合理选择滤波器参数和调制格式,使电域色散补偿达到最优性能。     

用于稀疏系统辨识的改进l0-LMS算法

该文研究和改进了l0-LMS算法以提高对稀疏系统进行辨识的性能。首先依据均方误差反映出的收敛深度信息动态调节步长,提高了算法的收敛速度;其次利用估计误差绝对值加权修正零吸引函数,减小了稳态失调误差。然后定性分析了改进算法中各个参数的取值对收敛速度和稳态性能的影响。最后,计算机仿真验证了新算法的性能明显优于原l0-LMS算法和若干现有稀疏系统辨识的方法。     

基于自调整器的CDMA系统盲自适应干扰抑制

本文给出一种能同时抑制DS-CDMA系统多址干扰(MAI)和窄带干扰(NBI)的盲自适应算法.此方法基于遗忘因子具有自调整器的迭代最小二乘算法(SR-RLS),根据系统的变化自动调整遗忘因子,当系统趋于静态时,遗忘因子趋于1,以提高稳态精度,在动态系统中,遗忘因子减小,使算法能有效的跟踪系统参数.与其它的迭代最小二乘相比,具有较小的稳态误差和良好的动态跟踪能力.文章从理论上分析了算法的收敛性.最后,对算法在静态环境和动态环境中的性能分别进行了仿真分析.     

一种用于窄带主动噪声控制系统的性能优化算法

针对窄带主动噪声控制(NANC)系统的收敛问题,提出一种变遗忘因子变步长的滤波-X加权累加最小均方算法.本文在滤波-X加权累加最小均方算法基础上,利用互相关的误差信号构建变遗忘因子策略,并通过遗忘因子构造了变步长策略使系统获得更优的参数值,更好的平衡算法的收敛速度、跟踪能力及稳态误差之间的矛盾,同时增强了抗干扰能力,有效提升算法的整体性能.仿真实验表明本文算法在平稳和非平稳环境下具有更好的性能.     

基于无噪后验错误矢量信号能量的变正则因子仿射投影算法

变正则因子技术是提高仿射投影自适应算法性能的重要方法之一.由于环境噪声的影响,现有的变正则因子自适应算法收敛速度较慢且稳态误差较大,各种测量、评估误差的存在进一步恶化了算法性能.为提高自适应算法的跟踪性能,本文在分析无噪先验错误矢量、无噪后验错误矢量和额外均方错误间关系的基础上,提出通过最小化无噪后验错误矢量信号能量来推导自适应变正则因子表达式的方法.在实践应用中,该方法利用了测量噪声的统计方差特性,并提出一种更加光滑且更加容易控制的指数缩放因子评估方法.系统辨识的仿真结果表明本文方法与传统的变正则因子方法以及变步长方法相比有更快的收敛速度与更低的稳态误差.     

自适应切换双模盲均衡算法

常数模算法在无线通信系统的盲均衡中得到广泛的使用,为了进一步降低稳态误差通常选择将其与判决引导最小均方误差算法相结合,传统的双模切换盲均衡算法通过人为设定门限值实现两种算法的硬切换,其切换时机选择的合理性无法保证,不能充分凸显双模切换的长处。该文利用凸组合结构借助遵循一定规则迭代变化的联合参数将两种算法进行结合,实现两种算法模式的切换,自适应地选择切换时机,并通过对算法的修正和混合参数归一化的改进使在克服恢复信号相位偏转的同时加快了收敛速率、降低了稳态误差;另外,对稳态性能进行推导分析得到了理论的稳态模型。仿真结果证明稳态性能与模型推导结果保持一致,参数归一化改进所得效果较为明显,与同类其它双模切换算法相比具有更优的性能。     

用SystemView仿真LMS自适应算法

最小均方误差(LMS)算法是自适应信号处理中最常用的算法.本文在给出LMS算法的原理的基础上,设计了一种单一频率的自适应陷波器的仿真方案.采用SystemView通信系统仿真工具,仿真了该自适应陷波器工作过程,给出了各点工作波形,并通过实验给出了不同参数条件下的陷波器收敛性能.实验结果表明,在合适的参数条件下,LMS算法可以兼顾收敛速度和稳态误差两方面的性能,实现性能良好的陷波器.同时,由于采用迭代算法,LMS算法更适合DSP或FPGA的数字实现.     

基于Lawson范数的通用lncosh稀疏自适应算法

该文提出一种通用稀疏系统识别Lawson-lncosh自适应滤波算法,该算法采用系数向量的Lawson范数和误差的lncosh函数构建代价函数。Lawson范数约束引入参数p,实现稀疏约束滤波动态调整,所提算法可以提高稀疏系统识别时的收敛速度,减小了稳态误差。误差的lncosh函数具有良好的抗脉冲噪声性能。然后,算法分析了步长参数的取值范围和参数p对算法性能的影响。计算机仿真结果表明,在高斯信号输入和色信号输入情况下,所提算法的性能要明显优于其他现存算法,且具备稀疏约束可控特性。     

一种变步长LMS波束形成算法性能研究

智能天线的自适应算法通过迭代运算获取波束形成的最优权值矢量时,收敛速度和稳态误差是衡量一个算法是否优良的关键因素。它们的好坏直接影响着系统波束形成的性能。系统地分析了传统的最小均方（LMs）算法的收敛速度以及稳态误差的性能,在此基础上提出了一种新的变步长LMS算法,将此算法应用于波束形成,并用Matlab软件进行仿真。仿真结果表明,改进后的算法较传统LMS具有较快的收敛速度和较小的稳态误差。     

适用于非常模信号的常数模新算法

常数模算法在对非常模信号进行均衡时,稳态均方误差无法收敛至零.对常数模算法中的代价函数进行修正,该代价函数能将非常模信号的多个幅度模值变换成单一幅度模值,从而使新算法的稳态均方误差为零.理论分析和仿真结果证明了新算法的优良性能.     

A new LMS-based Fourier analyzer in the presence of frequency mismatch and applications

The performance of the conventional least mean square (LMS) Fourier analyzer may degenerate significantly, if the signal frequencies given to the analyzer are different from the true signal frequencies. This difference is referred to as frequency mismatch (FM). We first analyze the performance of the conventional LMS Fourier analyzer for a single sinusoid in the presence of FM. We derive the dynamics and steady-state properties of this analyzer as well as the optimum step size parameter which minimizes the influence of the FM. Extensive simulations reveal the validity of the analytical results. Next, a new LMS-based Fourier analyzer is proposed which simultaneously estimates the discrete Fourier coefficients (DFCs) and accommodates the FM. This new analyzer can very well compensate for the performance degeneration due to the FM. Applications to estimation/detection of dual-tone multiple frequencies (DTMF) signals and analysis of real-life noise signals generated by a large-scale factory cutting machine are provided to demonstrate the excellent performance of our new Fourier analyzer.     

Statistical properties of the LMS fourier analyzer in the presence of frequency mismatch

The statistical performances of the conventional adaptive Fourier analyzers, such as the least mean square (LMS), the recursive least square (RLS) algorithms, and so forth, may degenerate significantly, if the signal frequencies given to the analyzers are different from the true signal frequencies. This difference is referred to as frequency mismatch (FM). We analyze extensively the performance of the conventional LMS Fourier analyzer in the presence of FM. Difference equations governing the dynamics and closed-form steady-state expression for the estimation mean square error (MSE) of the algorithm are derived in detail. It is revealed that the discrete Fourier coefficient (DFC) estimation problem in the LMS eventually reduces to a DFC tracking one due to the FM, and an additional term derived from DFC tracking appears in the closed-form MSE expression, which essentially deteriorates the performance of the algorithm. How to derive the optimum step size parameters that minimize or mitigate the influence of the FM is also presented, which can be used to perform robust design of step size parameters for the LMS algorithm in the presence of FM. Extensive simulations are conducted to reveal the validity of the analytical results.     

Range and error analysis for a fast Fourier transform computed overZ[{omega}]

A range and error analysis is developed for a discrete Fourier transform (fast Fourier transform) computed using the ring of cyclotomic integers. Included are derivations of both deterministic and statistical upper bounds for the range of the resulting processor and formulas for the ratio of the mean square error to mean square signal, in terms of the pertinent parameters. Comparisons of theoretical predictions with empirical results are also presented.     

Recursive nonlinear system identification by a stochastic gradient algorithm: stability, performance, and model nonlinearity considerations

A parameter estimation problem in a class of nonlinear systems is considered where the input-output relation of a nonlinear system is approximated by a polynomial model (e.g., a Volterra series). A least mean squares (LMS) type algorithm is utilized for the recursive estimation of the polynomial coefficients, and its resulting mean square error (MSE) convergence properties are investigated. Conditions for the algorithm stability (in the mean square sense) are established, steady-state MSE bounds are obtained, and the convergence rate is discussed. In addition, modeling accuracy versus steady-state performance is examined; it is found that an increase of the modeling accuracy may result in a deterioration of the asymptotic performance, that is, yielding a larger steady-state MSE. Linear system identification is studied as a special case.     

一种基于分数阶傅里叶变换的OFDM系统 及其均衡算法

在快速时变信道环境下,由于子载波间干扰(ICI)的影响,传统OFDM系统性能有较大下降.本文提出了一种基于分数阶傅里叶变换的OFDM系统,它用分数阶傅里叶变换代替傅里叶变换进行子载波调制与解调;同时,文中给出了最优分数阶傅里叶变换阶次的选取方法,并根据最小均方误差(MMSE)准则设计了分数阶傅里叶域乘性滤波器在接收端进行均衡.分析和数值仿真结果表明,最优分数阶傅里叶域的乘性滤波算法较频域方法有更好的均衡效果.     

Steady-state behavior of the improved normalized subband adaptive filter algorithm and its improvement in under-modeling

In practice, adaptive filter could work in an under-modeling scenario, meaning that its length is less than that of the unknown system. In this realistic situation, therefore, the existing analysis for the improved normalized subband adaptive filter (INSAF) algorithm is not applicable. To this end, this paper analyzes the mean square steady-state performance of the INSAF for under-modeling. In addition, we propose a variable step size INSAF algorithm suitable for under-modeling scenario, to obtain fast convergence rate and low steady-state error. Simulation results have supported our theoretical analysis and proposed algorithm.     

平方根变步长lp范数LMS算法的稀疏系统辨识

针对稀疏未知系统的辨识问题,提出了一种基于lp(0相似文献   

Steady-state analysis of a complex adaptive notch filter using modified gradient algorithm

Based on power spectral density (PSD) analytical technique, mean square error (MSE) (or variance) of the frequency estimate of a first-order complex adaptive IIR notch filter (ANF) using modified complex plain gradient (MCPG) algorithm is investigated in this paper. The steady-state expression for MSE is derived in closed form. A quantitative analysis for the estimation MSE has been carried out. It has been revealed that the MSE of frequency estimate is independent of an input frequency of a complex sinusoid. In addition, computer simulations are treated to corroborate the theoretical analysis and the relationships between MSE and system parameters are shown.     

Convergence analysis of adaptive filtering algorithms with singulardata covariance matrix

The paper provides a rigorous analysis of the behavior of adaptive filtering algorithms when the covariance matrix of the filter input is singular. The analysis is done in the context of adaptive plant identification. The considered algorithms are LMS, RLS, sign (SA), and signed regressor (SRA) algorithms. Both the signal and weight behavior of the algorithms are considered. The signal behavior is evaluated in terms of the moments of the excess output error of the filter. The weight behavior is evaluated in terms of the moments of the filter weight misalignment vector. It is found that the RLS and SRA diverge when the input covariance matrix is singular. The steady-state signal behavior of the LMS and SA can be made arbitrarily fine by using sufficiently small step sizes of the algorithms. Indeed, the long-term average of the mean square excess error of the LMS is proportional to the algorithm step size. The long-term average of the mean absolute excess error of the SA is proportional to the square root of the algorithm step size. On the other hand, the steady-state weight behavior of both the LMS and SA have biases that depend on the weight initialization. The analytical results of the paper are supported by simulations