DocumentCode
314084
Title
Blind separation of convolutive mixtures: a Gauss-Newton algorithm
Author
Cruces, Sergio ; Castedo, Luis
Author_Institution
ESI Telecommun., Seville Univ., Spain
fYear
1997
fDate
21-23 Jul 1997
Firstpage
326
Lastpage
330
Abstract
This paper addresses the blind separation of convolutive mixtures of independent and non-Gaussian sources. We present a block-based Gauss-Newton algorithm which is able to obtain a separation solution using only a specific set of output cross-cumulants and the hypothesis of soft mixtures. The order of the cross-cumulants is chosen to obtain a particular form of the Jacobian matrix that ensures convergence and reduces computational burden. The method can be seen as an extension and improvement of the Van-Gerven´s symmetric adaptive decorrelation (SAD) method. Moreover the convergence analysis presented in the paper provides a theoretical background to derive an improved version of the Nguyen-Jutten (1995) algorithm
Keywords
Gaussian processes; Newton method; convergence of numerical methods; convolution; correlation theory; matrix algebra; signal processing; Gauss-Newton algorithm; Jacobian matrix; Nguyen-Jutten algorithm; SAD method; Van-Gerven´s symmetric adaptive decorrelation method; blind separation; computational burden; convergence; convolutive mixtures; independent source; nonGaussian source; output cross-cumulants; separation solution; soft mixtures; Algorithm design and analysis; Blind source separation; Convergence; Decorrelation; Finite impulse response filter; Higher order statistics; Least squares methods; Newton method; Recursive estimation; Telecommunications;
fLanguage
English
Publisher
ieee
Conference_Titel
Higher-Order Statistics, 1997., Proceedings of the IEEE Signal Processing Workshop on
Conference_Location
Banff, Alta.
Print_ISBN
0-8186-8005-9
Type
conf
DOI
10.1109/HOST.1997.613540
Filename
613540
Link To Document