An Adaptive Subspace Algorithm For Blind Separation Of Independent Sources In Convolutive Mixture - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Signal Processing Year : 2000

An Adaptive Subspace Algorithm For Blind Separation Of Independent Sources In Convolutive Mixture

Ali Mansour
Philippe Loubaton

Abstract

the advantage of the algorithm proposed in this coreespondance is that it reduces a convolutive mixture to an instantaneous mixture by using only second-order statistics (but more sensors than sources). Furthermore, the sources can be separated by using any algorithm applicable to an instantaneous mixture. Otherwise, to ensure the convergence of our algorithm, we assume some classical assumptions for blind separation of sources and some added subspace assumptions. Finally, the assumptions concerning the subspace model and their properties are emphasized in this correspondance. Index GTerms- Cholesky decomposition, convolutive mixture, ICA and Blind separation of sources, LMS, subspace methods, Sylvester matrix.
No file

Dates and versions

hal-00802444 , version 1 (19-03-2013)

Identifiers

  • HAL Id : hal-00802444 , version 1

Cite

Ali Mansour, Christian Jutten, Philippe Loubaton. An Adaptive Subspace Algorithm For Blind Separation Of Independent Sources In Convolutive Mixture. IEEE Transactions on Signal Processing, 2000, 48 (2), pp.583-586. ⟨hal-00802444⟩
321 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More