Alpha稳定分布噪声中的韧性投影 近似子空间跟踪算法

 为了克服投影近似子空间跟踪算法(PAST)在脉冲噪声环境下性能的退化,本文以Alpha 稳定分布为脉冲噪声模型,依据韧性的M估计方法提出了一种新的代价函数,并推导出基于递归最小M估计的韧性投影近似自适应信号子空间跟踪算法(RLM_-PAST).由于采用了适合噪声模型的M估计函数,新算法与采用递归最小二乘估计的子空间跟踪算法相比,在稳定分布脉冲噪声环境下具有更好的性能.把新方法应用于波达方向(DOA)估计,数值仿真结果表明了该算法的有效性.     

Robust Recursive Beamforming in the Presence of Impulsive Noise and Steering Vector Mismatch

This paper proposes a new method for robust beamforming in the presence of impulsive noise as well as steering vector mismatch. In our proposed method, the idea of M-estimation is firstly incorporated into the traditional orthonormal PAST (OPAST) algorithm for subspace tracking to combat the hostile effect of impulsive noise. Taking advantage of the subspace principle, we show that the steering vector mismatch can be recursively and robustly estimated in closed form. Then, by making use of the estimated steering vector, the problem of robust beamforming in the presence of impulsive noise is formulated. The solution of this problem is analytically derived and the resultant robust beamformer is shown to have a similar form to the Capon beamformer, whereas the array covariance matrix and the steering vector are robustly estimated. Different from conventional methods, the impulsive noise and the steering vector mismatch are simultaneously handled by extending the traditional OPAST algorithm, and hence the proposed method has low complexity and it is feasible to nonstationary scenarios with moving sources. Simulation results demonstrate the validity and superiority of the proposed method over conventional methods in impulsive noise environment with steering vector mismatch.     

Robust multiple signal classification algorithm based on the myriad covariation matrix

A robust version of the multiple signal classification (MUSIC) bearing estimation algorithm based on robust statistics is developed for a direct sequence-code division multiple access impulsive noise channel. The proposed subspace algorithm is computed by using the antenna array covariance matrix, which is derived from the robust maximum likelihood estimator of location. Each element of the robust covariance matrix is computed as the sample myriad of a window of the received observations. The MUSIC antenna array scheme is jointly used to mitigate the effects of multipath and impulsive noise. Simulation results demonstrate that the proposed scheme significantly outperforms the other linear and nonlinear schemes     

A novel subspace tracking using correlation-based projection approximation

In this paper, we propose a novel subspace estimation technique, which is called correlation-based projection approximation subspace tracking (COPAST). The COPAST utilizes the projection approximation approach onto the correlation matrix to develop the subspace tracking algorithm. With the projection approximation, the RLS-based COPAST and the sequential-based COPAST algorithms are presented. The RLS-based COPAST algorithm has the better performance but the higher computational complexity than the recently developed PAST method. On the other hand, the sequential-based COPAST has reduced the computational complexity to nearly that of the PAST. Besides, the sequential-based COPAST has faster initial convergence speed than the PAST, while both nearly converge to the same value.     

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.     

Robust Recursive Inverse Adaptive Algorithm in Impulsive Noise

The recently proposed Recursive Inverse (RI) algorithm has shown a significant performance improvement compared to that of the Recursive Least Squares (RLS) algorithm, in various noise environments. However, both algorithms fail to converge in certain impulsive noise environments, especially if the Signal-to-Noise Ratio (SNR) is low. In this paper, a Robust RI algorithm is proposed. Analytical results show that robustness against impulsive noise is achieved by choosing the weights on the basis of the L ₁ norms of the autocorrelation matrix and the cross-correlation vector. Simulation results confirm that the proposed algorithm provides an improved performance, with a reduction in computational complexity, compared to those of the RLS and the Robust RLS in white and correlated impulsive noise.     

Instrumental variable subspace tracking using projectionapproximation

Subspace estimation plays an important role in, for example, sensor array signal processing. Recursive methods for subspace tracking with application to nonstationary environments have also drawn considerable interest. In this paper, instrumental variable (IV) extensions of the projection approximation subspace tracking (PAST) algorithm are presented. The IV approach is motivated by the fact that PAST gives biased estimates when the noise is not spatially white. The proposed algorithms are based on a projection like unconstrained criterion, with a resulting computational complexity, of 3ml+O(mn), where m is the dimension of the measurement vector; l is the dimension of the IV vector; and n is the subspace dimension. In addition, an extension to a “second order” IV algorithm is proposed, which in certain scenarios is demonstrated to have better tracking properties than the basic IV-PAST algorithms. The performance of the algorithms is demonstrated with a simulation study of a time-varying array processing scenario     

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     

基于低阶预白化与新型网络传递函数的盲源分离方法

α-稳定分布可以更好地描述实际应用中所遇到的具有显著脉冲特性的随机信号和噪声。与其它统计模型不同, α稳定分布没有统一闭式的概率密度函数,其二阶及二阶以上统计量均不存在。本文先简要介绍稳定分布统计特性,再提出了适用于盲信源分离的神经网络结构与基于分数低阶统计量与子空间技术的预白化过程,并利用一种新型传递函数修正了分离算法,提出了一种基于分数阶预白化与新型传递函数的盲信源分离方法。计算机模拟和分析表明,这种算法是一种在高斯和分数低阶α稳定分布噪声条件下具有良好韧性的盲信源分离方法,是对传统的二阶统计量基础上的盲信源分离方法的改造与推广。     

Fast parameter tracking RLS algorithm with high noise immunity

A recursive least squares (RLS) based fast parameter tracking algorithm with high noise immunity is proposed. The fast parameter tracking capability of the algorithm is achieved by perturbing the covariance matrix update equation whenever the signal model parameters change. Since the perturbing terms depends on the auto- and crosscorrelations of the signal and algorithm outputs, the proposed algorithm is very robust with respect to noise. The efficiency of the algorithm has been verified by Monte-Carlo simulations.<>     

脉冲噪声环境下高斯稀疏信源贝叶斯压缩感知重构

 大多数现有的压缩感知重构算法对脉冲噪声不具有鲁棒性,在脉冲噪声环境下,重构性能急剧下降,使得整个重构系统崩溃.针对此问题,本文提出了一种脉冲噪声环境下的稀疏重构算法BINSR算法,其基于贝叶斯理论,可以有效地估计出信号的支撑集和脉冲噪声中脉冲的位置,并且根据压缩感知观测序列的democracy特性,利用最小均方误差MMSE估计量,有效地估计出原信号.在此基础上,本文结合鲁棒统计学,提出自适应的ABINSR算法,使其不再依赖于信号以及噪声的统计参数.实验结果表明,BINSR算法在脉冲噪声环境下可以有效地恢复出稀疏信号,很大程度上改善了脉冲噪声环境下算法的重构性能.ABINSR算法不仅对脉冲噪声具有鲁棒性,而且可以在高斯白噪声环境下实现有效的信号重构.     

An improved subspace tracking algorithm for blind adaptive multiuser detection

As the Projection Approximation Subspace Tracking with deflation(PASTd) algorithm is sensitive to impulsive noise, an improved subspace tracking algorithm is proposed and applied to blind adaptive multi-user detection. Simulation results show that the improved PASTd algorithm not only remains the properties of the conventional PASTd algorithm, but also has good Bit Error Rate(BER) performance in impulsive noise environment, thus it can effectively improve the system performance.     

A robust adaptive weighted constant modulus algorithm for blind equalization of wireless communications systems under impulsive noise environment

A robust adaptive weighted constant modulus algorithm is proposed for blind equalization of wireless communication systems under impulsive noise environment. The influence of the impulsive noise is analyzed based on numerical analysis method. Then an adaptive weighted constant modulus algorithm is constructed to adaptively suppress impulsive noise. Theoretical analysis is provided to illustrate that the proposed algorithm has a robust equalization performance since the impulsive noise is adaptively suppressed. Moreover, the proposed algorithm has stable and quick convergence due to avoidance of large misadjuntment and adoption of large step size. Simulation results are presented to show the robust equalization performance and the fast convergence speed of the proposed algorithm under both impulsive noise and Gaussian noise environments.     

一种冲击噪声环境中的二维DOA估计新方法

该文提出了一种新的在冲击噪声环境中基于阵列输出信号分数低阶矩的二维测向方法稳健的协变异波达方向矩阵法。该方法利用冲击噪声和SS过程的特点,扩展了原波达方向矩阵法的信号模型和应用环境,对冲击噪声有较好的抑制作用,增强了算法的通用性和稳健性,弥补了传统的基于二阶或高阶统计量的子空间测向算法不能应用于冲击噪声环境的不足,计算机仿真验证了该算法的可行性和有效性。     

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

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

Robust and Improved Channel Estimation Algorithm for MIMO-OFDM Systems

Multiple-input multiple-output (MIMO) system using orthogonal frequency division multiplexing (OFDM) technique has become a promising method for reliable high data-rate wireless transmission system in which the channel is dispersive in both time and frequency domains. Due to multiple cochannel interferences in a MIMO system, the accuracy of channel estimation is a vital factor for proper receiver design in order to realize the full potential performance of the MIMO-OFDM system. A robust and improved channel estimation algorithm is proposed in this paper for MIMO-OFDM systems based on the least squares (LS) algorithm. The proposed algorithm, called improved LS (ILS), employs the noise correlation in order to reduce the variance of the LS estimation error by estimating and suppressing the noise in signal subspace. The performance of the ILS channel estimation algorithm is robust to the number of antennas in transmit and receive sides. The new algorithm attains a significant improvement in performance in comparison with that of the regular LS estimator. Also, with respect to mean square error criterion and without using channel statistics, the ILS algorithm achieves a performance very close to that of the minimum mean square error (MMSE) estimator in terms of the parameters used in practical MIMO-OFDM systems. A modification of the ILS algorithm, called modified ILS (MILS), is proposed based on using the second order statistical parameters of channel. Analytically, it is shown that the MILS estimator achieves the exact performance of the MMSE estimator. Due to no specific data sequences being required to perform the estimation, in addition to the training mode, the proposed channel estimation algorithms can also be extended and used in the tracking mode with decision-aided method.     

The minimum error entropy based robust wireless channel tracking inimpulsive noise

This article concerns the problem of adaptive wireless channel tracking in the non-Gaussian α-stable noise. By assuming a primitive Cauchy distribution for the estimate error and minimizing the entropy of error, we develop the least entropy of error (LEE) based wireless channel tracking algorithm and the second-order LEE (SOLEE) algorithm. Simulation results show that both algorithms are robust to impulsive noise and such robustness can be achieved without any performance loss in the Gaussian noise     

Sliding window adaptive SVD algorithms

The singular value decomposition (SVD) is an important tool for subspace estimation. In adaptive signal processing, we are especially interested in tracking the SVD of a recursively updated data matrix. This paper introduces a new tracking technique that is designed for rectangular sliding window data matrices. This approach, which is derived from the classical bi-orthogonal iteration SVD algorithm, shows excellent performance in the context of frequency estimation. It proves to be very robust to abrupt signal changes, due to the use of a sliding window. Finally, an ultra-fast tracking algorithm with comparable performance is proposed.     

一种基于分数低阶协方差矩阵的波束形成新方法

利用稳定分布对具有脉冲特性的噪声进行建模，提出了一种新的分数低阶协方差概念，推导了一种基于分数低阶协方差矩阵的波束形成方法，并分析了其旁瓣特性。模拟表明新方法具有更高的信号干扰噪声比及更强的波束形成与旁瓣抑制能力。新算法在高斯和分数低阶稳定分布环境下比传统的算法具有更好的韧性。     

基于QR-RPCA的双基地MIMO雷达参数估计方法

针对冲击噪声下因接收信号二阶及以上矩不存在而产生性能恶化的问题,提出一种基于QR分解和鲁棒性主成分分析法(QR-RPCA)的双基地多输入多输出(MIMO)雷达参数估计方法。针对RPCA算法适用于实数矩阵处理的情况,先将复数信号转化为实数;然后根据冲击噪声的稀疏特点与目标信号矩阵的低秩特点,利用QR-RPCA算法将低秩信号矩阵从受冲击噪声污染的接收信号中提取出来,并直接得到信号子空间,该算法避免了传统RPCA算法中的大规模奇异值分解,时间复杂度有所降低;最后根据信号子空间并利用旋转不变信号参数估计技术(ESPRIT)对目标方位进行估计。理论与仿真表明,本文算法相较于其他消除冲击噪声的算法,对于低特征指数的冲击噪声具有更好的估计性能。