A robust past algorithm for subspace tracking in impulsive noise

  • Authors:
  • Shing-Chow Chan;Yu Wen;Ka-Leung Ho

  • Affiliations:
  • Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, China;-;-

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2006

Quantified Score

Hi-index 35.68

Visualization

Abstract

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.