基于总体最小二乘算法的多站无源定位

将总体最小二乘算法应用于多站无源定位中,分别提出了基于角度估计的总体最小二乘算法,基于时差估计的总体最小二乘算法以及基于角度和时差估计的总体最小二乘算法。算法首先把非线性的观测方程转化为伪线性的观测方程,然后构造增广矩阵,并对该矩阵进行奇异值分解即可估计出目标位置,因此无需迭代计算或者获得目标位置的粗略估计,仿真结果表明该算法具有较高的定位精度。     

基于DOA估计的RLS-CMA算法

恒模算法被广泛地应用到盲自适应波束形成中,除了传输信号波形具有恒定的包络外,恒模算法不需要先验知识。提出一种基于来波方向估计的递推最小二乘恒模算法,基于恒模阵列级联的结构,由递推最小二乘算法决定恒模的初始权向量,同时通过对权向量多项式求根获得下一级的初始权向量,再利用最小二乘恒模迭代几步获得准确的结果。系统可以分离多个同信道信源,在干扰信号较强时,仍有稳定的信干比输出,并对阵列幅相差不敏感。计算机仿真证明了算法的正确性和有效性。     

自适应迭代最小二乘支持向量机回归算法

 基于最小二乘支持向量机回归算法,本文在前期工作的基础上进行了扩展,提出了更加详尽的自适应迭代最小二乘支持向量机回归算法. 与标准的LSSVR相比,本文提出的算法在学习新样本的时候利用了已有的学习结果,可以快速获得新的学习机. 模拟结果表明,自适应迭代最小二乘支持向量机回归算法能够自适应地确定支持向量的数目,保留了QP方法在训练SVM时支持向量的稀疏性,在相近的回归精度下,该算法极大地提高了标准LSSVR学习的速度.     

哈默斯坦非线性时变系统的加权学习辨识方法

针对有限区间哈默斯坦(Hammerstein)非线性时变系统,该文提出一种加权迭代学习算法用以估计系统时变参数。首先将Hammerstein系统输入非线性部分进行多项式展开,采用迭代学习最小二乘算法辨识系统的时变参数。为了防止数据饱和,采用带遗忘因子的迭代学习最小二乘算法,进而引入权矩阵,采用加权迭代学习最小二乘算法改进系统跟踪误差,以提高辨识精度。该文分别给出3种算法的推导过程并进行仿真验证。结果表明,与迭代学习最小二乘算法和带遗忘因子迭代学习最小二乘算法相比,加权迭代学习最小二乘算法具有辨识精度高、跟踪误差小以及迭代次数少等优点。     

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

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

SMI-LSCMA盲自适应多波束形成算法研究

提出一种基于协方差矩阵求逆(SMI)和最小二乘恒模(LSCMA)的恒模阵列盲多波束形成算法。该算法由SMI算法决定LSCMA算法的初始权向量,充分利用SMI结合LSCMA算法的所有优点,在干扰信号较强时,确保权向量收敛至弱期望信号。并且有稳定的SINR输出,具有良好的信号分离提取性能。仿真结果证明了SMI-LSCMA算法具有较强的稳健型和较快的收敛速度。     

一种基于最小化广义Rayleigh商的无源定位算法研究

 为改善只测角无源定位的性能,提出了一种基于最小化广义Rayleigh商的无源定位算法.该算法利用扰动观测矩阵和扰动观测向量的乘性结构,将约束总体最小二乘问题转化为最小化广义Rayleigh商问题,从而只需对一对矩阵束进行广义特征值分解即可求得全局最优定位解.仿真结果表明所提算法性能稳健且计算量较小,定位收敛精度逼近克拉美罗限(CRLB),远优于最小二乘(LS)算法和总体最小二乘(TLS)算法,实用性强.     

MC-CDMA系统中一种线性共轭MOE多用户检测算法

该文提出MC-CDMA系统下一种基于递归最小二乘(Recursive Least-Squares, RLS)的最小输出能量(Minimum Output Energy, MOE)噪声抑制线性共轭多用户检测算法.该算法定义了一种新的基于MOE准则的代价函数,同时将噪声子空间作为MOE代价函数的约束条件,设计了一种噪声抑制的线性共轭检测器,并采用RLS算法自适应得到权向量.所提算法将权向量和噪声子空间正交,消除了权向量中的噪声分量,并且利用了伪自相关矩阵的信息,从而提高了系统的性能.仿真结果证明了本文算法的有效性和优越性.     

一种基于自适应阵列天线的波束赋形算法

自适应阵列天线中的数字波束赋形(DBF)技术是智能天线数字信号处理部分的核心.提出了一种可用于自适应阵列波束赋形的SMI-LMS算法--由SMI(采样协方差矩阵求逆)算法决定LMS(最小均方)算法的初始权向量.该算法充分结合了SMI算法收敛速度快和LMS算法稳态误差小的优点,能在较强干扰环境下,确保权向量的快速收敛和跟踪速度.与传统的LMS算法相比,SMI-LMS算法具有良好的收敛性能、较快的跟踪速度和较小的输出误差,并可以有效改善自适应方向图的副瓣性能.仿真结果验证了该结论.     

智能天线波束形成算法分析

本文重点介绍了自适应方式下的智能天线;然后研究了三种经典的自适应波束形成算法——最小均方误差算法、递归最小二乘算法、恒模算法,并对这三种算法在MATLAB中进行了仿真,分别得出了期望信号在迭代过程中的误差变化,期望信号和干扰信号在迭代过程中的增益变化及迭代完成达到收敛后的天线方向图,分析了收敛速度及各项性能指标,并对三种算法做了性能比较。     

Stochastic gradient based third-order Volterra system identification by using nonlinear Wiener adaptive algorithm

The nonlinear Wiener stochastic gradient adaptive algorithm for third-order Volterra system identification application with Gaussian input signals is presented. The complete self-orthogonalisation procedure is based on the delay-line structure of the nonlinear discrete Wiener model. The approach diagonalises the autocorrelation matrix of an adaptive filter input vector which dramatically reduces the eigenvalue spread and results in more rapid convergence speed. The relationship between the autocorrelation matrix and cross-correlation matrix of filter input vectors of both nonlinear Wiener and Volterra models is derived. The algorithm has a computational complexity of O(M/sup 3/) multiplications per sample input where M represents the length of memory for the system model, which is comparable to the existing algorithms. It is also worth noting that the proposed algorithm provides a general solution for the Volterra system identification application. Computer simulations are included to verify the theory.     

A Novel Adaptive Nonlinear Filter-Based Pipelined Feedforward Second-Order Volterra Architecture

Due to the computational complexity of the Volterra filter, there are limitations on the implementation in practice. In this paper, a novel adaptive joint process filter using pipelined feedforward second-order Volterra architecture (JPPSOV) to reduce the computational burdens of the Volterra filter is proposed. The proposed architecture consists of two subsections: nonlinear subsection performing a nonlinear mapping from the input space to an intermediate space by the feedforward second-order Volterra (SOV), and a linear combiner performing a linear mapping from the intermediate space to the output space. The corresponding adaptive algorithms are deduced for the nonlinear and linear combiner subsections, respectively. Moreover, the analysis of theory shows that these adaptive algorithms based on the pipelined architecture are stable and convergence under a certain condition. To evaluate the performance of the JPPSOV, a series of simulation experiments are presented including nonlinear system identification and predicting of speech signals. Compared with the conventional SOV filter, adaptive JPPSOV filter exhibits a litter better convergence performance with less computational burden in terms of convergence speed and steady-state error.     

Adaptive MIMO decision feedback equalization for receivers with time-varying channels

In an attempt to reduce the computational complexity of vertical Bell Labs layered space time (V-BLAST) processing with time-varying channels, an efficient adaptive receiver is developed based on the generalized decision feedback equalizer (GDFE) architecture. The proposed receiver updates the filter weight vectors and detection order using a recursive least squares (RLS)-based time- and order-update algorithm. The convergence of the algorithm is examined by analysis and simulation, and it is shown that the proposed adaptive technique is considerably simpler to implement than a V-BLAST processor with channel tracking, yet the performances are almost comparable.     

鲁棒总体均方最小自适应滤波:算法与分析

本文研究了在输入输出观测数据均含有噪声的情况下如何有效地进行鲁棒自适应滤波的问题.以总体均方误差(TMSE)最小为准则,基于最速下降原理,通过对总体均方误差梯度进行修正,提出了一种鲁棒的总体均方最小自适应滤波算法.通过与已有算法的对比分析表明,该算法能够有效地降低权向量的每步调整量对噪声的敏感程度.仿真实验的结果进一步表明,该算法的鲁棒抗噪性能和稳态收敛精度明显地高于其它同类方法,而且可以使用较大的学习因子,在高噪声环境下仍然保持良好的收敛性.     

扩频通信中干扰抑制的自适应非线性滤波技术

本文研究了自适应非线性滤波在直扩通信中抑制窄带干扰的应用，修正了Ｖｉｊａｙａｎ和Ｐｏｏｒ所采用的抽头更新算法，使非线性滤波的性能明显改善，同时把自适应非线性横向滤波结构，推广到Ｌａｔｔｉｃｅ结构，提高了收敛速度。     

Robust least mean square adaptive FIR filter algorithm

The authors propose a new robust adaptive FIR filter algorithm for system identification applications based on a statistical approach named the M estimation. The proposed robust least mean square algorithm differs from the conventional one by the insertion of a suitably chosen nonlinear transformation of the prediction residuals. The effect of nonlinearity is to assign less weight to a small portion of large residuals so that the impulsive noise in the desired filter response will not greatly influence the final parameter estimates. The convergence of the parameter estimates is established theoretically using the ordinary differential equation approach. The feasibility of the approach is demonstrated with simulations     

Estimation of Nonlinear Wireless Channel Based on Incremental Spline Adaptive Filtering

Channel estimation in a wireless sensor network is imperative to error-free information dissemination and data collection. The estimation procedure is challenging if there exists a nonlinear distortion to the communication signal due to the radio-frequency components in the transmitting or receiving entity. It has drawn attention to nonlinear system modeling for channel estimation, where lately, one of the most important methods has been spline adaptive filter (SAF). The necessity of updating both linear filter coefficients and nonlinear control points makes the adaptation process slow. Hence, we propose an incremental spline adaptive filter using the least mean square algorithm (ISAF-LMS), which acquires faster convergence while estimating non-linearity along with linear filter coefficients. The steady-state performance of the proposed method is carried out by following the energy conservation approach. The simulation result shows faster convergence in the distributed case than in non-cooperative estimation. Further, the performance is compared with diffusion SAF and incremental version of conventional Volterra adaptive filter-based nonlinear channel estimation (IVLMS). The proposed algorithm performance is better than IVLMS.

     

基于梯度向量投影的自适应滤波算法的改进及其在多路回波消除中的应用

该文首先对Lim(2000)的基于梯度向量正交投影的算法(OGA)进行了分析和改进,在此基础上获得了一种新的自适应滤波算法(MOGA)。新算法使用时变遗忘因子对误差进行指数加权平均来估计均方误差,并使用该因子改变自适应迭代过程中滤波器系数向量的更新方向.然后将改进后的新算法扩展成两路回波消除算法用于多路回波的消除中,获得了良好的效果。仿真结果表明, MOGA不仅对时变或时不变系统具有很好的跟踪能力,克服了Lim(2000)所提算法收敛性不佳甚至有时发散的缺陷,而且应用于多路回波消除时具有计算量小,收敛速度快和精度高等特点,其收敛速度和精度优于J.Benesty(1996)和G.Sankaran(1999)的相应结果。     

Robust M-estimate adaptive filtering

An M-estimate adaptive filter for robust adaptive filtering in impulse noise is proposed. Instead of using the conventional least-square cost function, a new cost function based on an M-estimator is used to suppress the effect of impulse noise on the filter weights. The resulting optimal weight vector is governed by an M-estimate normal equation. A recursive least M-estimate (RLM) adaptive algorithm and a robust threshold estimation method are derived for solving this equation. The mean convergence performance of the proposed algorithm is also analysed using the modified Huber (1981) function (a simple but good approximation to the Hampel's three-parts-redescending M-estimate function) and the contaminated Gaussian noise model. Simulation results show that the proposed RLM algorithm has better performance than other recursive least squares (RLS) like algorithms under either a contaminated Gaussian or alpha-stable noise environment. The initial convergence, steady-state error, robustness to system change and computational complexity are also found to be comparable to the conventional RLS algorithm under Gaussian noise alone