An optimized EASI algorithm

doi:10.1016/j.sigpro.2008.08.015

Return

An optimized EASI algorithm

2009-03-01

PRE

DOI：10.1016/j.sigpro.2008.08.015

Original

Original request for help

Save

Abstract

En 中文

This paper addresses the problem of blind source separation and presents a kind of optimized equivariant adaptive separation via independence (EASI) algorithms. According to the cumulant based approximation to the mutual information contrast function, the EASI learning rule is optimized by multiplying the symmetric part with an optimal time variant weight coefficient. Simulation results show the proposed optimized EASI algorithms outperform the existing algorithms in convergent speed and steady-state accuracy. (C) 2008 Elsevier B.V. All rights reserved.

Keywords:

Blind source separation

Cumulant based approximation of contrast function

EASI algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.