基于P范数的核最小对数绝对差自适应滤波算法

为了进一步提高在a稳定分布噪声背景下非线性自适应滤波算法的收敛速度,本文提出了一种新的基于p范数的核最小对数绝对差自适应滤波算法(kernel least logarithm absolute difference algorithm based on p-norm, P-KLLAD).该算法结合核最小对数绝对差算法和p范数,一方面利用最小对数绝对差准则保证了算法在a稳定分布噪声环境下良好的鲁棒性,另一方面在误差的绝对值上添加p范数,通过p范数和一个正常数a来控制算法的陡峭程度,从而提高该算法的收敛速度.在非线性系统辨识和Mackey-Glass混沌时间序列预测的仿真结果表明,本文算法在保证鲁棒性能的同时提高了收敛速度,并且在收敛速度和鲁棒性方面优于核最小均方误差算法、核分式低次幂算法、核最小对数绝对差算法和核最小平均p范数算法.     

应用于助听器反馈抑制的信噪比自适应滤波算法*

针对基于自适应滤波器的助听器反馈抑制系统,本文提出了一种基于信噪比的归一化最小均方误差算法,采用最小值统计法估计误差信号的噪声分量,从而计算出误差信号的信噪比来计算自适应滤波系数的更新步长。当误差信号信噪比越高,语音占主要成分,信号的相关性越强,此时将滤波器的更新步长控制在较小值,减小滤波器的失调量。当信噪比越低时,噪声占主要成分,信号的相关性相对较弱,更新步长取较大值,加快滤波器的收敛速度。在仿真实验中,本文提出的基于信噪比的归一化最小均方误差算法相较于传统算法在平均稳态失调量和稳态失调范围上分别低1dB和2dB,其最大稳态增益提高了4dB,同时具有更快的稳态收敛速度,验证了本文提出算法的有效性。     

应用于声反馈抑制的变步长归一化子带自适应滤波算法*

针对自适应滤波算法中稳态失调量和收敛速度之间的矛盾,提出了一种新的变步长归一化子带自适应滤波算法。该算法在系统噪声抵消原理的基础上,用迭代收缩的方法估计得到无噪先验子带误差的功率,对每个子带步长进行更新。对所提出的算法进行数学分析,可以得出该算法是稳定的和收敛的。在长回声路径和短回声路径两种情况下,将该算法应用于助听器声反馈抑制系统中。相对于其他归一化子带自适应滤波算法,仿真实验表明,所提算法实现了更快的收敛速度,获得了更低的失调量。     

基于分数阶最大相关熵算法的混沌时间序列预测

为提高最大相关熵算法对混沌时间序列的预测速度和精度,提出了一种新的分数阶最大相关熵算法.在采用最大相关熵准则的基础上,利用分数阶微分设计了一种新的权重更新方法.在alpha噪声环境下,采用新的分数阶最大相关熵算法对Mackey-Glass和Lorenz两类具有代表性的混沌时间序列进行预测,并分析了分数阶的阶数对混沌时间序列预测性能的影响.仿真结果表明:与最小均方算法、最大相关熵算法以及分数阶最小均方算法三类自适应滤波算法相比,所提分数阶最大相关熵算法在混沌时间序列预测中能够有效地抑制非高斯脉冲噪声干扰的影响,具有较快收的敛速度和较低的稳态误差.     

一种自适应滤波中步长因子调节的算法

本文在研究时变信道的自适应匹配中,采用了多途信道的横向滤波器模型(MA模型),为求滤波器权系数应用的是最小均方误差滤波方法。在最小均方误差滤波中无论是采用最徒下降法(Steepst Descent Method),还是最小均方算法(LMS Algorithm),在叠代方程中都要引入步长因子μ.以往对μ的取值只推导出一个范围0<μ<1/λ_(max),λ_(max)为采集信号自相关矩阵的最大本征值,且在叠代过程中是一个常数。但究竞取多大值?取小了自适应叠代方程收敛慢,取大了误差能量函数产生振荡,甚至发散。为寻找一种快速收敛的自适应滤波方法,以适应信道的时变特性时发现,对叠代步长因子μ作自适应调节,会使收敛速度有明显提高。     

水声通信系统中双向turbo均衡算法

提出了一种水声通信系统中直接自适应双向turbo均衡算法。摒弃了信道估计步骤,采用基于直接自适应的turbo均衡器,并利用内嵌数字锁相环的判决反馈均衡器结构跟踪时变信道,采用最速优化算法自适应调整迭代步长,使得收敛速度和算法性能得到很好折中。此外,利用最小均方误差准则,得到最优权重因子,对正向与反向turbo均衡结果加权求和,消除误差传播效应。仿真和湖上实验验证了方法的正确性,双向均衡的性能优于单向均衡。湖上实验结果表明,基于直接自适应算法相比于基于信道估计的算法,对时变信道不敏感,能获得更低的误比特率。      

混沌通信系统中非线性信道的自适应组合神经网络均衡

针对混沌通信系统的非线性信道干扰问题,基于混沌信号重构理论和函数型连接神经网络理论,提出了一种横向滤波器与函数型连接神经网络组合(combination of transversal filter and functional link neural network,CFFLNN)的自适应非线性信道均衡器,并给出基于低复杂度归一化最小均方(NLMS)的自适应算法,并对该均衡器的稳定性以及收敛条件进行了分析.该非线性自适应均衡器充分利用了横向滤波器的快速收敛,以及函数型连接神经网络通过增大输入空间提高非线性逼近能力的特点,进一步提高均衡器的收敛速度和降低稳态误差.仿真研究表明：所提出的非线性自适应均衡器能够有效地消除线性和非线性信道干扰,均衡器输出信号能反映出混沌信号的特性,具有良好的抗干扰性能;且该均衡器的结构简单,收敛稳定性较好,易于工程实现. 关键词： 非线性信道 自适应均衡器 混沌吸引子 神经网络     

基于干扰对消的红外焦平面非均匀性校正算法

红外焦平面器件的非均匀性产生机理复杂,难以准确拟合探测元响应曲线。提出了一种基于相关干扰抵消的非均匀性校正算法,以预先采集到的一帧黑体面源图像做为自适应干扰对消器的参考输入图像,自适应滤波器由参考输入图像迭代计算出待校正红外图像的空间噪声的最佳估计,实现从空间噪声中提取真实图像信号。自适应滤波算法采用变步长最小均方误差算法,减少了算法的运算量,提高了算法的收敛速度。理论分析以及针对实际红外图像的仿真结果表明,提出的算法校正效果好,收敛速度快,更易于工程实现。     

一种自适应前向均衡与判决均衡组合结构及变步长改进算法

信号在超长线缆传输中, 线缆的线间串扰及温度梯度变化造成噪声干扰, 特别是线缆介电损耗和肌肤效应的影响, 导致接收端信号频率色散失真严重, 难以恢复原始信号, 限制了传输速度. 另外, 在页岩气、煤层气等资源勘探领域, 在用长缆传输数据时, 还要求传输高精度同步脉冲信号, 用于采集数据相位的标定. 线缆的传输效应及噪声干扰严重影响了接收端的信号同步, 造成采集数据相位失真. 本文针对信号在长缆传输中的非线性失真及衰减问题, 提出了一种新型均衡结构, 并针对新模型给出了最优系数组合. 在此基础上针对改进的结构提出了一种基于反正切函数的变步长算法, 该算法配合三误差因子, 形成收敛函数, 该函数具有收敛速度快, 稳态误差小的优点. 改进后的自适应组合均衡器计算复杂度低, 收敛快, 信道跟踪能力强, 加快了数据处理速度, 同时能较好地应对信道的时变性. 仿真结果表明, 基于新变步长算法的自适应组合均衡器, 性能上提高了50%, 并且消除了噪声干扰和码间干扰, 测试实验表明, 在无中继超长缆(7 km以上)传输中, 信号速度提高了一倍.     

互补型自适应滤波器在心磁信号处理中的应用

将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发，提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计，有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明，该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理. 关键词： 自适应滤波 心磁图 最小均方误差     

Adaptive nonlinear neuro-controller with an integrated evaluation algorithm for nonlinear active noise systems

An adaptive nonlinear neuro-controller with an integrated evaluation algorithm for nonlinear active noise control systems is proposed to attenuate the nonlinear and non-Gaussian noises. Inspired by the structure of the Hammerstein or Wiener model, the proposed controller is realized by the static nonlinear memory function mapping on the basis of a single neuron. A generalized filtered-X gradient descent algorithm based on an integrated evaluation criterion is developed to adaptively adjust the weights of the controller, where the weighted sum of Renyi's quadratic error entropy and the mean square error is applied as the integrated performance index, which improves the performance of the adaptive algorithm by introducing the information entropy. In addition, the convergence of the proposed approach is analyzed, and the computational complexity among different methods is investigated. The proposed scheme can effectively attenuate the nonlinear and non-Gaussian noises and has a relative simple structure and less learning parameters. The simulation results demonstrate the validity of the proposed method for attenuating the nonlinear and non-Gaussian noises.     

A constant modulus algorithm for blind equalization in α-stable noise

Channel noise is often assumed to be Gaussian in most of the existing channel equalization algorithms. The performance of these algorithms will degrade seriously when the noise is non-Gaussian. This paper deals with the problem of blind channel equalization in impulsive noise environment that is modeled as α-stable process. A modified adaptive error-constrained constant modulus algorithm (MAECCMA) is proposed by soft-limiting the amplitude of the equalizer input and transforming the error signal of the original adaptive error-constrained constant modulus algorithm (AECCMA) nonlinearly to suppress the influence of α-stable noise. Computer simulation results of two underwater acoustic channels show that, MAECCMA has almost the same performance as AECCMA and they both have faster convergence rate than constant modulus algorithm (CMA) and normalized least mean absolute deviation (NLMAD) algorithm in Gaussian noise, while MAECCMA provides the best performance of those four algorithms in α-stable noise.     

Improving robustness of filtered-x least mean p-power algorithm for active attenuation of standard symmetric-α-stable impulsive noise

The paper concerns active control of impulsive noise having peaky distribution with heavy tail. Such impulsive noise can be modeled using non-Gaussian stable process for which second order moments do not exist. The most famous filtered-x least mean square (FxLMS) algorithm for active noise control (ANC) systems is based on the minimization of variance (second order moment) of error signal, and hence, becomes unstable for the impulsive noise. In order to improve the robustness of adaptive algorithms for processes having distributions with heavy tails (i.e. signals with outliers), either (1) a robust optimization criterion may be used to derive the adaptive algorithm or (2) the large amplitude samples may be ignored or replaced by an appropriate threshold value. Among the existing algorithms for ANC of impulsive noise, one is based on the minimizing least mean p-power (LMP) of the error signal, resulting in FxLMP algorithm (approach 1). The other is based on modifying; on the basis of statistical properties; the reference signal in the update equation of the FxLMS algorithm (approach 2). In this paper we propose two solutions to improve the robustness of the FxLMP algorithm. In first proposed algorithm, the reference and the error signals are thresholded before being used in the update equation of FxLMP algorithm. As another solution to improve the performance of FxLMP algorithm, a modified normalized step size is proposed. The computer simulations are carried out, which demonstrate the effectiveness of the proposed algorithms.     

A modified fractional least mean square algorithm for chaotic and nonstationary time series prediction

A method of modifying the architecture of fractional least mean square （FLMS） algorithm is presented to work with nonlinear time series prediction. Here we incorporate an adjustable gain parameter in the weight adaptation equation of the original FLMS algorithm and absorb the gamma function in the fractional step size parameter. This approach provides an interesting achievement in the performance of the filter in terms of handling the nonlinear problems with less computational burden by avoiding the evaluation of complex gamma function. We call this new algorithm as the modified fractional least mean square （MFLMS） algorithm. The predictive performance for the nonlinear Mackey glass chaotic time series is observed and evaluated using the classical LMS, FLMS, kernel LMS, and proposed MFLMS adaptive filters. The simulation results for the time series with and without noise confirm the superiority and improvement in the prediction capability of the proposed MFLMS predictor over its counterparts.     

Improving performance of FxRLS algorithm for active noise control of impulsive noise

Active noise control (ANC) systems employing adaptive filters suffer from stability issues in the presence of impulsive noise. New impulsive noise control algorithms based on filtered-x recursive least square (FxRLS) algorithm are presented. The FxRLS algorithm gives better convergence than the filtered-x least mean square (FxLMS) algorithm and its variants but lacks robustness in the presence of high impulsive noise. In order to improve the robustness of FxRLS algorithm for ANC of impulsive noise, two modifications are suggested. First proposed modification clips the reference and error signals while, the second modification incorporates energy of the error signal in the gain of FxRLS (MGFxRLS) algorithm. The results demonstrate improved stability and robustness of proposed modifications in the FxRLS algorithm. However, another limitation associated with the FxRLS algorithm is its computationally complex nature. In order to reduce the computational load, a hybrid algorithm based on proposed MGFxRLS and normalized step size FxLMS (NSS-FXLMS) is also developed in this paper. The proposed hybrid algorithm combines the stability of NSS-FxLMS algorithm with the fast convergence speed of the proposed MGFxRLS algorithm. The results of the proposed hybrid algorithm prove that its convergence speed is faster than that of NSS-FxLMS algorithm with computational complexity lesser than that of FxRLS algorithm.     

Adaptive step-size modified fractional least mean square algorithm for chaotic time series prediction

This paper presents an adaptive step-size modified fractional least mean square （AMFLMS） algorithm to deal with a nonlinear time series prediction. Here we incorporate adaptive gain parameters in the weight adaptation equation of the original MFLMS algorithm and also introduce a mechanism to adjust the order of the fractional derivative adaptively through a gradient-based approach. This approach permits an interesting achievement towards the performance of the filter in terms of handling nonlinear problems and it achieves less computational burden by avoiding the manual selection of adjustable parameters. We call this new algorithm the AMFLMS algorithm. The predictive performance for the nonlinear chaotic Mackey Glass and Lorenz time series was observed and evaluated using the classical LMS, Kernel LMS, MFLMS, and the AMFLMS filters. The simulation results for the Mackey glass time series, both without and with noise, confirm an improvement in terms of mean square error for the proposed algorithm. Its performance is also validated through the prediction of complex Lorenz series.     

相位编码光码分多址系统中的非高斯分析方法

随着相位编解码器关键技术的突破,精确分析相位编码光码分多址(OCDMA)系统误码率性能显得十分必要。为了精确分析相位编码光码分多址系统误码率性能,提出了一种基于判决变量的矩母函数和鞍点近似的非高斯近似方法,该方法能够精确考虑多址干扰、散粒噪声、热噪声各自的统计特性和相互间的非加性关系。比较了高斯近似、精确计算和文中所提出方法在分析相位编码系统误码率时的计算精度和复杂度,结果证明该分析方法具有分析精度高、计算复杂度低的优点。     

Least mean square error difference minimum criterion for adaptive chaotic noise canceller

The least mean square error difference (LMS-ED) minimum criterion for an adaptive chaotic noise canceller is proposed in this paper. Different from traditional least mean square error minimum criterion in which the error is uncorrelated with the input vector, the proposed LMS-ED minimum criterion tries to minimize the correlation between the error difference and input vector difference. The novel adaptive LMS-ED algorithm is then derived to update the weights of adaptive noise canceller. A comparison between cancelling performances of adaptive least mean square (LMS), normalized LMS (NLMS) and proposed LMS-ED algorithms is simulated by using three kinds of chaotic noises. The simulation results clearly show that the proposed algorithm outperforms the LMS and NLMS algorithms in achieving small values of steady-state excess mean square error. Moreover, the computational complexity of the proposed LMS-ED algorithm is the same as that of the standard LMS algorithms.