Sciweavers

Share
SIP
2003

Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals

10 years 1 months ago
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the closed form gradient and Newton methods used by Joho and Rahbar [1] is developed which encapsulates the more difficult convolutive mixing case. This extension is completely in the time domain and thus avoids the inherent permutation problem associated with frequency domain approaches. We also compare the performance of three commonly used algorithms including Gradient, Newton and global optimization algorithms in terms of their convergence behavior and separation performance in the instantaneous case and then the convolutive case. Keywords - Blind source separation, Global optimization, Joint diagonalization, multivariate optimization, Newton method, Steepest gradient descent.
Iain Russell, Alfred Mertins, Jiangtao Xi
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SIP
Authors Iain Russell, Alfred Mertins, Jiangtao Xi
Comments (0)
books