Adaptive fast algorithm based on natural gradient for instantaneous blind source separation Online publication date: Wed, 01-Jun-2016
by Niva Das; Binodini Tripathy; Srikanta Patnaik
International Journal of Information and Communication Technology (IJICT), Vol. 8, No. 4, 2016
Abstract: A fast adaptive algorithm based on natural gradient is proposed in this paper to address the convergence issue in instantaneous blind source separation (BSS) problem in a noisy and non-stationary mixing scenario. The natural gradient technique overcomes slow convergence properties of the gradient adaptation technique when the slope of the cost function varies widely for small changes in the parameters. To speed up the convergence further we adopt one of the heuristic methods by incorporating a momentum term. Synthetically generated data as well as real world data have been considered for validation purpose. Numerical experiments on sinusoidal signals and acoustic electromechanical signals confirm the superior performance of the proposed algorithm over the conventional natural gradient algorithm (NGA) in both noisy and noiseless situation as well as in stationary and non-stationary mixing scenario.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook