Abstract
In view of slow convergence for fixed-step Equivariant Adaptive Separation for Independent (EASI )algorithm and the problem for variable step-size algorithm which bases on kurtosis is sensitive to outlier, a new variable step-size EASI algorithm is proposed, which applys the negative entropy maximization method of non-polynomial functions to the approximate calculation of the mutual information. Experiments results show that the proposed algorithm not only achieves faster convergence and smaller stead-state error than fixed-step EASI and other variable step-size algorithms, but also demonstrate better stability for the problem of outlier.
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.
