By Topic

Adaptive subspace algorithm for blind separation of independent sources in convolutive mixture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mansour, A. ; BMC Res. Center, Nagoya, Japan ; Jutten, C. ; Loubaton, P.

The advantage of the algorithm proposed in this article 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

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 2 )