By Topic

A novel adaptive step-size algorithm of blind source separation based on non-linear function

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
$31 $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)
Zhucheng Li ; Practice Teaching Center, Bus. Coll. of Beijing United Univ., Beijing, China ; Rong Liu

The conventional fixed step-size algorithm of blind source separation (BSS) cann't adaptively chang in the process of original signals separation, so both the convergence speed and the steady-state misadjustment aren't simultaneously satisfactory. To solve the problem, a novel step-size algorithm of BSS based on non-linear function is proposed in this paper, it makes the step-size value match the dynamics of the input signals and unmixing matrix adaptively at each iteration, its performance is investigated through simulations. The results obtained show that superior performance can he achieved relative to that of an existing fixed step-size algorithm.

Published in:

Consumer Electronics, Communications and Networks (CECNet), 2011 International Conference on

Date of Conference:

16-18 April 2011