By Topic

Blind source separation based on K-SCA assumption

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

2 Author(s)
Wen Yang ; College of Electronics & Information Engineering, Henan University of Science and Technology, Luoyang, 471003, China ; Hongyi Zhang

The blind source separation (BSS) based on K-SCA is discussed in this paper. The first challenging task of this approach is how to estimate the unknown mixing matrix precisely, to solve this problem, the algorithm based on hyperplane membership function is proposed. In contrast to the classical methods, the required key condition on sparsity of the sources can be considerably relaxed, and the algorithm has a good ability of anti-noise. Several experiments involving speech signals show the effectiveness and efficiency of this method.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:9 )

Date of Conference:

9-11 July 2010