Subspace-based noise reduction for speech signals via diagonal and triangular matrix decompositions: Survey and analysis

38Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We survey the definitions and use of rank-revealing matrix decompositions in single-channel noise reduction algorithms for speech signals. Our algorithms are based on the rank-reduction paradigm and, in particular, signal subspace techniques. The focus is on practical working algorithms, using both diagonal (eigenvalue and singular value) decompositions and rank-revealing triangular decompositions (ULV, URV, VSV, ULLV, and ULLIV). In addition, we show how the subspace-based algorithms can be analyzed and compared by means of simple FIR filter interpretations. The algorithms are illustrated with working Matlab code and applications in speech processing.

Cite

CITATION STYLE

APA

Hansen, P. C., & Jensen, S. H. (2007). Subspace-based noise reduction for speech signals via diagonal and triangular matrix decompositions: Survey and analysis. Eurasip Journal on Advances in Signal Processing, 2007. https://doi.org/10.1155/2007/92953

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free