Toggle Main Menu Toggle Search

Open Access padlockePrints

Fast convergence polynomial based separation algorithm

Lookup NU author(s): Dr Li Khor, Dr Wai Lok Woo, Emeritus Professor Satnam Dlay

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

Nonlinear Blind Source Separation which is an extension of its more popular linear counterpart has gained increasing attention over recent years. Its development presents a more realistic approach due to the nonlinear mixing introduced by transmitter and receiver elements such as loudspeaker, amplifier and microphones. Though more accurate than linear models, it is also more complex and suffers from convergence issues. This paper proposes a polynomial neural network for blind nonlinear signal separation and also addresses the fundamental difficulty of non-unique solutions and slow convergence. Efficiency of the objective function is enhanced by a polynomial based model which is a flexible and more accurate fit. Coupled with reduced indeterminacy using additional constraints and improved convergence speed via adaptive learning rates, the proposed algorithm produces very promising results. Issues of convergence speed, accuracy and robustness against noise are investigated and results demonstrate the efficacy of the algorithm with adaptive learning rates. © 2005 IEEE.


Publication metadata

Author(s): Khor LC, Woo WL, Dlay SS

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 8th International Symposium on Signal Processing and its Applications (ISSPA)

Year of Conference: 2005

Pages: 495-498

Publisher: IEEE

URL: http://dx.doi.org/10.1109/ISSPA.2005.1580983

DOI: 10.1109/ISSPA.2005.1580983

Library holdings: Search Newcastle University Library for this item

ISBN: 0780392434


Share