By Topic

An Improved L1-Norm Algorithm for Underdetermined Blind Source Separation Using Sparse Representation

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)
Shuzhong Bai ; School of Electrical Engineering, Shandong University, Jinan 250061, P.R.China; School of Information Science and Engineering, Shandong University, Jinan 250100, P.R.China ; Ju Liu ; Chong-Yung Chi

An algorithm is presented for underdetermined blind source separation, i.e., the number of observed signals is less than that of original sources. Traditional solutions based on minimizing the L1-norm have some disadvantages in searching the optimal sub-matrix for separation. In the proposed algorithm, first we use a potential function to estimate the mixing matrix by clustering method. Then we present an improved L1-norm algorithm by weighting the observed signals vectors at the different source clustering directions. This method makes good use of the super-Gaussian property of sources and overcomes the disadvantages of L1-norm-based solutions. Furthermore, the case of an arbitrary mixing matrix is discussed in this paper. Simulation results have shown that the proposed approach can give better separation results than traditional methods in terms of signal-to-noise ratio.

Published in:

2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers

Date of Conference:

4-7 Nov. 2007