基于混沌时间序列建模的频谱状态持续时长预测

为提高频谱利用率,该文利用非线性动力学理论对频谱状态持续时长序列进行建模并预测。以实际采集的频谱数据作为研究对象,采用指向导数法对该时长序列进行非一致延长时间相空间重构,利用基于尺度的Lyapunov指数判定其混沌特性。以基于Davidon-Fletcher-Powell方法的二阶Volterra预测模型 (DFPSOVF)为基础,提出一种基于限域拟牛顿方法的Volterra自适应滤波器系数调整模型,并将该模型应用于具有混沌特性的短时频谱状态持续时长预测,通过自适应剔除对预测贡献小的滤波器系数,降低预测模型的复杂度。实验结果表明该算法在保证预测精度的同时降低运算复杂度。     

非线性Volterra系统的总体全解耦自适应滤波

研究输入、输出观测数据均受噪声干扰时的非线性Volterra系统的全解耦自适应滤波问题.基于总体最小二乘技术和Volterra滤波器的伪线性组合结构,运用约束优化问题的分析方法研究Volterra滤波过程,从而建立了一种总体全解耦自适应滤波算法.并建立了分析该算法收敛性能的参数反馈调整模型,分析表明,该算法可使各阶Volterra核稳定地收敛到真值.仿真实验的结果表明,当输入、输出观测数据均受噪声干扰时,总体全解耦自适应滤波算法的鲁棒抗噪性能和滤波精度均优于全解耦LMS自适应滤波算法.     

基于自适应基带预失真的高效率发射技术

在Volterra级数系统理论框架下,阐述并分析了自适应基带预失真系统的间接学习结构、记忆多项式行为模型与递归最小二乘算法,针对卫星通信提出了一种基于自适应基带预失真的高功率高效率发射技术.仿真验证了该方法的有效性.     

非线性ROF系统的分析和建模

在分析ROF(radio over fiber)系统组成与传输非线性的基础上,提出了用Volterra泛函级数为非线性ROF系统建立模型.研究了非线性ROF系统的Volterra级数表述、最小均方和最小二乘两种确定Volterra级数核的自适应算法在非线性ROF系统建模中的应用.通过一个用Volterra泛函级数对非线性ROF系统建模的实例,比较了Volterra LMS和Volterra RLS算法在建模中的效果,证明了用Volterra级数对非线性ROF系统建模的有效性.     

基于约束最小二乘的近空间雷达网定位算法

该文研究了一种基于归一化约束最小二乘的近空间雷达网定位算法。首先将距离与角度信息的非线性方程转换为线性方程,通过一阶Taylor展开分析了噪声对线性方程的影响,然后将定位问题转化为归一化约束总体最小二乘问题,并通过Lagrange函数将其转换为无约束的优化问题,根据定位均方误差最小原则选取加权因子得到定位解,最后进行了定位误差分析,仿真结果表明了该算法的有效性。     

脉冲噪声环境下循环ESPRIT新方法

以a稳定分布作为噪声模型,研究了脉冲噪声环境下循环平稳信号的波达方向估计问题.针对在脉冲噪声环境中,基于传统二阶循环统计量的算法效果显著退化的问题,提出了分数低阶循环相关矩阵概念;并在此基础上,提出了分数低阶总体最小二乘(TLS)循环ESPRIT算法的2种形式.计算机仿真表明所提出的算法可有效地估计出脉冲噪声条件下的波达方向,其性能优于传统的基于二阶循环统计量的循环ESPRIT类算法,有潜在的应用前景.     

基于稳健最小二乘的鲁棒波束形成

为解决Capon波束形成器在存在导向矢量失配时的性能急剧下降问题,提出了一种结合广义旁瓣对消器和稳健最小二乘的鲁棒波束形成算法.该算法利用广义旁瓣对消器原理将Capon波束形成器转化为最小二乘问题,然后在数据协方差矩阵误差的范数约束下将其转化为二阶锥规划问题,并利用高效内点法得到最优解.所提出的算法经推导证明属于对角加载类.仿真分析表明,该算法在导向矢量失配和快拍不足时仍具有较好的性能.     

基于LS-SVM的宽带接收前端非线性补偿算法

针对目前常用的基于参数化非线性模型（Parameterized Nonlinear Model,PNM）的补偿算法存在易陷入局部最小值，导致补偿性能不稳的问题，该文提出了基于最小二乘支持向量机（Least Squares Support Vector Machine,LS-SVM）的宽带接收前端非线性补偿算法.该算法基于减谱-时频变换法（Spectrum Reduction Algorithm based on Time-Frequency Conversion,SRA-TFC）盲分离接收前端输出信号中的大功率基波信号和其他小功率信号，并以此作为LS-SVM逆模型的训练输入-输出样本对.引入最小二乘支持向量回归（Least Squares Support Vector Regression,LS-SVR）算法高精度拟合接收前端非线性逆模型.通过以宽带接收前端的输出信号为测试样本消除其非线性失真分量.仿真与实测结果表明：该算法可使宽带接收前端的无杂散失真动态范围（Spurs-Free-Dynamic-Range,SFDR）提高约20 dB，较基于PNM的补偿算法提高了约5 dB.     

采用归一化最小均方误差准则的LM-BP算法

传统神经网络通常以最小均方误差(LMS)或最小二乘（RLS）为收敛准则,而在自适应均衡等一些应用中,使用归一化最小均方误差（NLMS）准则可以使神经网络性能更加优越。本文在NLMS准则基础上,提出了一种以Levenberg-Marquardt（LM）训练的神经网络收敛算法。通过将神经网络的误差函数归一化,然后采用LM算法作为训练算法,实现了神经网络的快速收敛。理论分析和实验仿真表明,与采用最速下降法的NLMS准则和采用LM算法的LMS准则相比,本文算法收敛速度快,归一化均方误差更小,应用于神经网络水印系统中实现了水印信息的盲提取,能更好的抵抗噪声、低通滤波和重量化等攻击,性能平均提高了4%。      

基于IDE-BPNN的快速反射镜迟滞建模

由压电陶瓷驱动的快速反射镜(FSM)现已被广泛用于自适应光学系统的执行环节,为了对其迟滞效应精确建模,该文提出了一种针对FSM的IDE-BPNN建模方法。基于Madelung法则以最小二乘法构建称迟滞算子作为迟滞运动的基本描述,扩展训练用的数据集,并采用改进的差分进化算法(IDE)对BP神经网络(BPNN)进行训练。实验表明,当输入30 Hz衰减的正弦信号时,IDE-BPNN模型的单轴最大误差为0.745μrad,归一化最大误差为0.87%,归一化均方根误差为0.36%。相较于最小二乘建模法,相对于最小二乘模型误差大幅缩小,有较好的使用价值。     

Convergence and performance analysis of the normalized LMSalgorithm with uncorrelated Gaussian data

It is demonstrated that the normalized least mean square (NLMS) algorithm can be viewed as a modification of the widely used LMS algorithm. The NLMS is shown to have an important advantage over the LMS, which is that its convergence is independent of environmental changes. In addition, the authors present a comprehensive study of the first and second-order behavior in the NLMS algorithm. They show that the NLMS algorithm exhibits significant improvement over the LMS algorithm in convergence rate, while its steady-state performance is considerably worse     

On the convergence behavior of the LMS and the normalized LMSalgorithms

It is shown that the normalized least mean square (NLMS) algorithm is a potentially faster converging algorithm compared to the LMS algorithm where the design of the adaptive filter is based on the usually quite limited knowledge of its input signal statistics. A very simple model for the input signal vectors that greatly simplifies analysis of the convergence behavior of the LMS and NLMS algorithms is proposed. Using this model, answers can be obtained to questions for which no answers are currently available using other (perhaps more realistic) models. Examples are given to illustrate that even quantitatively, the answers obtained can be good approximations. It is emphasized that the convergence of the NLMS algorithm can be speeded up significantly by employing a time-varying step size. The optimal step-size sequence can be specified a priori for the case of a white input signal with arbitrary distribution     

Second-order adaptive Volterra system identification based ondiscrete nonlinear Wiener model

The authors present the nonlinear LMS adaptive filtering algorithm based on the discrete nonlinear Wiener (1942) model for second-order Volterra system identification application. The main approach is to perform a complete orthogonalisation procedure on the truncated Volterra series. This allows the use of the LMS adaptive linear filtering algorithm for calculating all the coefficients with efficiency. This orthogonalisation method is based on the nonlinear discrete Wiener model. It contains three sections: a single-input multi-output linear with memory section, a multi-input, multi-output nonlinear no-memory section and a multi-input, single-output amplification and summary section. For a white Gaussian noise input signal, the autocorrelation matrix of the adaptive filter input vector can be diagonalised unlike when using the Volterra model. This dramatically reduces the eigenvalue spread and results in more rapid convergence. Also, the discrete nonlinear Wiener model adaptive system allows us to represent a complicated Volterra system with only few coefficient terms. In general, it can also identify the nonlinear system without over-parameterisation. A theoretical performance analysis of steady-state behaviour is presented. Computer simulations are also included to verify the theory     

A general class of nonlinear normalized adaptive filteringalgorithms

The normalized least mean square (NLMS) algorithm is an important variant of the classical LMS algorithm for adaptive linear filtering. It possesses many advantages over the LMS algorithm, including having a faster convergence and providing for an automatic time-varying choice of the LMS stepsize parameter that affects the stability, steady-state mean square error (MSE), and convergence speed of the algorithm. An auxiliary fixed step-size that is often introduced in the NLMS algorithm has the advantage that its stability region (step-size range for algorithm stability) is independent of the signal statistics. In this paper, we generalize the NLMS algorithm by deriving a class of nonlinear normalized LMS-type (NLMS-type) algorithms that are applicable to a wide variety of nonlinear filter structures. We obtain a general nonlinear NLMS-type algorithm by choosing an optimal time-varying step-size that minimizes the next-step MSE at each iteration of the general nonlinear LMS-type algorithm. As in the linear case, we introduce a dimensionless auxiliary step-size whose stability range is independent of the signal statistics. The stability region could therefore be determined empirically for any given nonlinear filter type. We present computer simulations of these algorithms for two specific nonlinear filter structures: Volterra filters and the previously proposed class of Myriad filters. These simulations indicate that the NLMS-type algorithms, in general, converge faster than their LMS-type counterparts     

二阶Volterra变数据块长LMS算法

二阶Volterra数据块LMS算法利用当前时刻及其以前时刻更多输入信号和误差信号的信息提高了算法的收敛速度,但由于其固定数据块长取值的不同导致了算法的收敛速度和稳态误差此消彼长。针对这个问题,本文提出一种二阶Volterra变数据块长LMS算法,通过时刻改变输入信号数据块长度提高算法性能。本算法首先采用两个并行的二阶Volterra滤波器,其输入信号数据块长差值始终保持一个单位;然后将其各自的输出误差信号同时输入到数据块长判决器,通过判决器得到下一时刻各个滤波器输入信号的数据块长度;最后以第1个二阶Volterra滤波器的输出作为整个滤波系统的输出,从而改善了算法性能。将本算法应用于非线性系统辨识,计算机仿真结果表明,高斯噪声背景下本算法的收敛速度和稳态性能都得到了明显的提高。      

基于NLMS的CDMA盲自适应多用户检测算法研究

多用户检测是抑制DS-CDMA系统多址干扰最有效的技术之一。由于所需的先验知识仪有期望用户的地址码,盲多用户检测技术的研究尤受重视。最小输出能量(MOE)准则被广泛用于盲线性多用户检测。目前已提出的该类检测器多采用LMS或RLS算法。本文则研究基于NLMS算法的盲自适应检测技术,并进一步提出盲自适应变步长NLMS检测器和参数可变的盲自适应变步长NLMS检测器。它们具备很好的收敛速度和跟踪能力,以及较高的输出信干比,同时计算复杂度仅为O(3N)或O(4N),非常适合硬件实现。     

Second-order H∞ optimal LMS and NLMS algorithmsbased on a second-order Markov model

It is shown that two algorithms obtained by simplifying a Kalman filter considered for a second-order Markov model are H^∞ suboptimal. Similar to least mean squares (LMS) and normalised LMS (NLMS) algorithms, these second order algorithms can be thought of as approximate solutions to stochastic or deterministic least squares minimisation. It is proved that second-order LMS and NLMS are exact solutions causing the maximum energy gain from the disturbances to the predicted and filtered errors to be less than one, respectively. These algorithms are implemented in two steps. Operation of the first step is like conventional LMS/NLMS algorithms and the second step consists of the estimation of the weight increment vector and prediction of weights for the next iteration. This step applies simple smoothing on the increment of the estimated weights to estimate the speed of the weights. Also they are cost-effective, robust and attractive for improving the tracking performance of smoothly time-varying models     

Variable step-size Griffiths’ algorithm for improved performance of feedforward/feedback active noise control

A new robust computationally efficient variable step-size LMS algorithm is proposed and it is applied for secondary path (SP) identification of feedforward and feedback active noise control (ANC) systems. The proposed variable step-size Griffiths’ LMS (VGLMS) algorithm not only uses a step-size, but also the gradient itself, based on the cross-correlation between input and the desired signal. This makes the algorithm robust to both stationary and non-stationary observation noise and the additional computational load involved for this is marginal. Further, in terms of convergence speed and error, it is better than those by the Normalized LMS (NLMS) and the Zhang’s method (Zhang in EURASIP J. Adv. Signal Process. 2008(529480):1–9, 2008). The convergence rate of the feedforward and feedback ANC systems with the VGLMS algorithm for SP identification is faster (by a factor of 2 and 3, respectively) compared with that using NLMS algorithm. For feedforward ANC, its convergence rate is faster (3 times) compared with Akhtar’s algorithm (Akhtar in IEEE Trans Audio Speech Lang Process 14(2), 2006). Also, for higher main path lengths compared with SP, the proposed algorithm is computationally efficient compared with Akhtar’s algorithm.     

一种新的变步长NLMS盲自适应多用户检测算法

首先推导得到最小输出能力准则的无约束形式,得到易于NLMS算法实现形式;在该NLMS算法实现的基础上,通过重复归一化迭代运算推导,得到重复跌代的等效形式;基于该形式提出一种新的变步长NLMS算法,算法复杂度仍然为O(N),算法具有很好的健壮性,并且具有更好的检测综合性能。仿真表明,与文献［5］所提变参数的变步长NLMS算法相比,本文算法收敛速度更快且输出信干比更好。在同步CDMA系统下,其综合性能达到KALMAN,RLS相当水平。