Abstract

Most of existing blind source separation (BSS) algorithms are developed by assuming that the mixing matrix is fixed. However, the mixing matrix is commonly time-varying in practical communication system. In this paper, aiming at the problem of non-stationary blind source separation, a fast blind source separation algorithm is proposed by using the exponentially weighted sum of error squares as the cost function and adding the adaptive momentum term to the learning rule. Simulation results show that the proposed algorithm converges quickly and trace time-varying system effectively.

Full Text
Paper version not known

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 call

Disclaimer: 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.