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

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

核递归最小平均P范数算法

在强脉冲噪声干扰背景中,核递归最小二乘(Kernel Recursive Least Square,KRLS)算法和核递归最大相关熵(Kernel Recursive Maximum Correntropy,KRMC)算法对非线性信号预测性能严重退化,对此提出一种核递归最小平均P范数（Kernel Recursive Least Mean P-norm,KRLMP）算法。首先运用核方法将输入数据映射到再生核希尔伯特空间。其次基于最小平均P范数准则和正则化方法,推导得到自适应滤波器的最佳权向量,其降低了非高斯脉冲和样本量少的影响。然后利用矩阵求逆理论,推导得到矩阵的递归公式。最后利用核技巧得到在输入空间高效计算的滤波器输出和算法的迭代公式。alpha稳定分布噪声背景下Mackey-Glass时间序列预测的仿真结果表明:KRLMP算法与KRLS算法和KRMC算法相比,抗脉冲噪声能力强,鲁棒性好。      

灵巧噪声干扰与自适应旁瓣对消对抗的仿真与分析

灵巧噪声干扰与自适应旁瓣对消(Adaptive Side-Lobe Canceling,ASLC)是电子对抗领域的两种关键技术.基于此,介绍常见的灵巧噪声干扰样式,如脉冲复制转发干扰和卷积噪声干扰,从ASLC的原理出发,利用递归最小二乘算法(Recursive Least Squares,RLS)对经过ASLC处理后的几种不同的灵巧噪声干扰信号的干扰效果分别进行仿真和分析.     

一种基于RLS自适应滤波跟踪的信道估计方法

对于快时变信道~([1]),基扩展模型(Basic Expansion Model,BEM)能很好地捕捉信道的时变特性,并能有效模拟信道的传输情况,进而常用于信道建模。本文提出了一种基于RLS自适应滤波跟踪的信道估计方法。自适应滤波器本身有一个重要的算法,即递归最小二乘(Recursive least squares,RLS)算法。文章利用RLS自适应滤波算法对BEM基系数g进行跟踪,并将其自适应的调整大小,然后对信道响应进行估计。为验证所提方法的性能,本文对所提算法与LS配合插值算法进行仿真对比。仿真结果表明,所提方法相较LS算法有很好的估计精度。     

基于压缩感知的分布式协同估计算法

为了降低分布式协同估计算法的计算量并改善其收敛性能,提出了基于压缩感知(CS)和递归最小二乘(RLS)的分布式协同估计算法.该算法在传统RLS分布式协同估计算法的基础上引入压缩感知技术,首先在压缩域中进行递归最小二乘运算,然后利用压缩感知重构算法得到未知参数向量的估计值.提出的算法能够在增量式策略和两种模式的扩散式策略下实现对未知向量的有效估计.理论分析和仿真结果表明,该算法一方面降低了RLS分布式协同估计算法的计算量,另一方面保持较快的收敛速度与良好的均方误差性能.     

一个基于TDOA的无线定位新算法

研究了高斯噪声环境下基于TDOA(波达时间差)目标定位问题,得到了约束WLS(加权最小二乘)解.在宽松的假设条件下,该算法被证明是近似极大似然(MLE)解.仿真实验表明:该算法较已有的算法在定位精度方面有显著提高.     

外辐射源雷达多径杂波抑制的快速横向滤波算法

外辐射源雷达面临严重的多径杂波问题,传统的递归最小二乘(Recursive LeastSquare,RLS)算法能有效地抑制多径杂波,相对最小均方(Least Mean Square,LMS)算法而言,该算法收敛速率快,且不随输入相关矩阵特征值的扩散而改变,能获得更好的杂波抑制效果,但该算法复杂度高,不利于实时处理.针对此问题,提出了一种外辐射源雷达多径杂波抑制的快速横向滤波算法,该算法的计算量与LMS相当,同时具有RLS的优越性,对多径杂波抑制的实时处理更具有吸引力.仿真和实测数据处理结果验证了该算法的有效性.     

基于M估计变步长自适应仿射投影算法的稳健时延估计

该文提出了一种基于M估计变步长自适应仿射投影方法的稳健时延估计(TDE)算法。该算法将自适应仿射投影算法应用于时延估计,无须事先假定信号和噪声的统计特性,自适应调整自身参数;应用稳健M估计理论,抵消重尾噪声干扰。数值仿真表明,在高斯噪声、非高斯噪声甚至冲激噪声的干扰下,该文算法比高阶统计量法和最小均方自适应法有更强的稳健性和更高的估计精度。     

自适应均衡算法在信道均衡技术中的应用研究

文中描述了两种非线性均衡器分别为判决反馈均衡器(DFE)和最大似然序列估计(MLSE)均衡器.所用信道模型为加性白高斯噪声信道,在DFE和线性均衡器(LE)中都是使用递归最小二乘(RLS)算法和最小均方(LMS)算法对数据进行分块处理.MLSE均衡器中使用了维特比最佳译码算法.就误比特性能来做以比较,DFE远好于LE,MLSE均衡器又明显优于DFE,并且它能达到几乎最优的性能.     

脉冲噪声环境下的恒模盲均衡算法

α稳定分布噪声导致现有的基于梯度下降法的恒模盲均衡算法(SGD-CMA)失效.通过分析厚拖尾噪声对现有算法的影响,给出了2种改造算法,即韧性梯度下降恒模盲均衡算法(SGD-RCMA)和递归最小二乘恒模盲均衡算法(RLS-RCMA).仿真表明2种改造算法比传统的恒模盲均衡算法具有更好的适用性,不仅适用于高斯噪声环境而且适合于脉冲噪声环境.同时RLS-RCMA与SGD-RCMA相比具有更快的收敛速度和更好的码间干扰抑制能力.     

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     

A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis

This paper studies the problem of robust adaptive filtering in impulsive noise environment using a recursive least M-estimate algorithm (RLM). The RLM algorithm minimizes a robust M-estimator-based cost function instead of the conventional mean square error function (MSE). Previous work has showed that the RLM algorithm offers improved robustness to impulses over conventional recursive least squares (RLS) algorithm. In this paper, the mean and mean square convergence behaviors of the RLM algorithm under the contaminated Gaussian impulsive noise model is analyzed. A lattice structure-based fast RLM algorithm, called the Huber Prior Error Feedback-Least Squares Lattice (H-PEF-LSL) algorithm is derived. Part of the H-PEF-LSL algorithm was presented in ICASSP 2001. It has an order O(N) arithmetic complexity, where N is the length of the adaptive filter, and can be viewed as a fast implementation of the RLM algorithm based on the modified Huber M-estimate function and the conventional PEF-LSL adaptive filtering algorithm. Simulation results show that the transversal RLM and the H-PEF-LSL algorithms have better performance than the conventional RLS and other RLS-like robust adaptive algorithms tested when the desired and input signals are corrupted by impulsive noise. Furthermore, the theoretical and simulation results on the convergence behaviors agree very well with each other.     

Stochastic convergence analysis of recursive successive over-relaxation algorithm in adaptive filtering

A stochastic convergence analysis of the parameter vector estimation obtained by the recursive successive over-relaxation (RSOR) algorithm is performed in mean sense and mean-square sense. Also, excess of mean-square error and misadjustment analysis of the RSOR algorithm is presented. These results are verified by ensemble-averaged computer simulations. Furthermore, the performance of the RSOR algorithm is examined using a system identification example and compared with other widely used adaptive algorithms. Computer simulations show that the RSOR algorithm has better convergence rate than the widely used gradient-based algorithms and gives comparable results obtained by the recursive least-squares RLS algorithm.     

自适应滤波算法在微弱振动测量中的应用

将递归最小二乘自适应滤波算法应用于激光多普勒测振技术中,搭建了相应的微弱振动测量装置。模拟仿真与实验中,通过与设计的切比雪夫低通滤波算法对比,结果表明:该递归最小二乘自适应滤波算法能够有效抑制随机高斯白噪声,还原出原始信号;能够对简谐振动信号实现有效滤波,并且可以还原出淹没在噪声中的低频20 Hz信号;文中算法可以去除语音噪声,使声音更加纯净,增强语音信号,以此验证了该算法在外差振动测量中的可行性。该算法简单易用、收敛性强、速度快,尤其对于随机噪声的去除比普通的低通滤波器更加有效。     

A Stabilized Multichannel Fast RLS Algorithm for Adaptive Transmultiplexer Receivers

The transmultiplexer (TMUX) system has been studied for its application to multicarrier communications. The channel impairments including noise, interference, and distortion draw the need for adaptive reconstruction at the TMUX receiver. Among possible adaptive methods, the recursive least squares (RLS) algorithm is appealing for its good convergence rate and steady state performance. However, higher computational complexity due to the matrix operation is the drawback of utilizing RLS. A fast RLS algorithm used for adaptive signal reconstruction in the TMUX system is developed in this paper. By using the polyphase decomposition method, the adaptive receiver in the TMUX system can be formulated as a multichannel filtering problem, and the fast algorithm is obtained through the block Toeplitz matrix structure of received signals. In addition to the reduction of complexity, simulation results show that the adaptive TMUX receiver has a convergence rate close to that of the standard RLS algorithm and the performance approaches the minimum mean square error solution.     

An efficient recursive total least squares algorithm for FIRadaptive filtering

An algorithm for recursively computing the total least squares (TLS) solution to the adaptive filtering problem is described. This algorithm requires O(N) multiplications per iteration to effectively track the N-dimensional eigenvector associated with the minimum eigenvalue of an augmented sample covariance matrix. It is shown that the recursive least squares (RLS) algorithm generates biased adaptive filter coefficients when the filter input vector contains additive noise. The TLS solution on the other hand, is seen to produce unbiased solutions. Examples of standard adaptive filtering applications that result in noise being added to the adaptive filter input vector are cited. Computer simulations comparing the relative performance of RLS and recursive TLS are described     

A robust past algorithm for subspace tracking in impulsive noise

The PAST algorithm is an effective and low complexity method for adaptive subspace tracking. However, due to the use of the recursive least squares (RLS) algorithm in estimating the conventional correlation matrix, like other RLS algorithms, it is very sensitive to impulsive noise and the performance can be degraded substantially. To overcome this problem, a new robust correlation matrix estimate, based on robust statistics concept, is proposed in this paper. It is derived from the maximum-likelihood (ML) estimate of a multivariate Gaussian process in contaminated Gaussian noise (CG) similar to the M-estimates in robust statistics. This new estimator is incorporated into the PAST algorithm for robust subspace tracking in impulsive noise. Furthermore, a new restoring mechanism is proposed to combat the hostile effect of long burst of impulses, which sporadically occur in communications systems. The convergence of this new algorithm is analyzed by extending a previous ordinary differential equation (ODE)-based method for PAST. Both theoretical and simulation results show that the proposed algorithm offers improved robustness against impulsive noise over the PAST algorithm. The performance of the new algorithm in nominal Gaussian noise is very close to that of the PAST algorithm.     

多径CDMA信道下一种新的RLS空时接收机

针对多径CDMA信道下的多用户检测中出现的线性约束二次规划问题提出一种新的递归最小二乘算法，该算法可以完全避免因约束而引进的矩阵求逆运算(相对常规的递归最小二乘算法)，并将这种算法与CDMA多用户系统结合起来给出了一种新的自适应接收机，仿真结果表明了这种算法是有效的(无论在检测性能上还是在收敛性能上)。     

Low Complexity Linear Channel Estimation for MIMO Communication Systems

Channel estimation is employed to get the current knowledge of channel states for an optimum detection in fading environments. In this paper, a new recursive multiple input multiple output (MIMO) channel estimation is proposed which is based on the recursive least square solution. The proposed recursive algorithm utilizes short training sequence on one hand and requires low computational complexity on the other hand. The algorithm is evaluated on a MIMO communication system through simulations. It is realized that the proposed algorithm provides fast convergence as compared to recursive least square (RLS) and robust variable forgetting factor RLS (RVFF-RLS) adaptive algorithms while utilizing lesser computational cost and provides independency on forgetting factor.     

A recursive least squares implementation for LCMP beamforming underquadratic constraint

Quadratic constraints on the weight vector of an adaptive linearly constrained minimum power (LCMP) beamformer can improve robustness to pointing errors and to random perturbations in sensor parameters. We propose a technique for implementing a quadratic inequality constraint with recursive least squares (RLS) updating. A variable diagonal loading term is added at each step, where the amount of loading has a closed-form solution. Simulations under different scenarios demonstrate that this algorithm has better interference suppression than both the RLS beamformer with no quadratic constraint and the RLS beamformer using the scaled projection technique, as well as faster convergence than LMS beamformers