Abstract
In this paper, we first present a new criterion for nonlinear principal component analysis (PCA) available for blind source separation (BSS) of convolutive mixture. Then we derive a novel recursive least square (RLS) algorithm for time-domain BSS. Although several existing methods of time-domain BSS can avoid the indeterminacy of permutation and gain which makes the BSS problem difficult in frequency domain, they generally converge slowly. The proposed new algorithm has fast convergence. The simulation results are presented to illustrate the effectiveness of our algorithm.
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.
