Abstract
This paper addresses the problem of blind source separation (BSS) and presents an optimum step size which makes the nonlinear principal component analysis (NPCA) cost function descend in the fastest way. By applying this step size in the self-stabilized NPCA algorithm, a fast NPCA algorithm is obtained. Computer simulations of online BSS show that the new algorithm works more efficiently than the existing least-mean-square (LMS)-type and recursive least-squares (RLS)-type NPCA algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
