Prewhitening for rank-deficient noise in subspace methods for noise reduction

Authors:
P.C. Hansen;S.H. Jensen
Affiliations:
Dept. of Informatics & Math. Modeling, Tech. Univ. of Denmark, Lyngby, Denmark;-
Venue:
IEEE Transactions on Signal Processing - Part I
Year:
2005

Citing 0
Cited 5

Enhancement of Chinese speech based on nonlinear dynamics

Signal Processing
A review of signal subspace speech enhancement and its application to noise robust speech recognition

EURASIP Journal on Applied Signal Processing
Sinusoidal order estimation using angles between subspaces

EURASIP Journal on Advances in Signal Processing
Robust noise filtering in wideband frequency-invariant beamforming with uniform circular arrays

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Multidimensional prewhitening for enhanced signal reconstruction and parameter estimation in colored noise with Kronecker correlation structure

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental issue in connection with subspace methods for noise reduction is that the covariance matrix for the noise is required to have full rank in order for the prewhitening step to be defined. However, there are important cases where this requirement is not fulfilled, e.g., when the noise has narrowband characteristics or in the case of tonal noise. We extend the concept of prewhitening to include the case when the noise covariance matrix is rank deficient, using a weighted pseudoinverse and the quotient singular value decomposition, and we show how to formulate a general rank-reduction algorithm that works also for rank-deficient noise. We also demonstrate how to formulate this algorithm by means of a quotient ULV decomposition, which allows for faster computation and updating. Finally, we apply our algorithm to a problem involving a speech signal contaminated by narrowband noise.