.png){kind=icon}
Return
Stochastic gradient adaptive algorithms for blind source separation
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(98)00221-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim in blind source separation is to separate linear mixtures of statistically independent non-Gaussian signals without resorting to an a priori knowledge of the sources or the mixing system. In this paper we propose a new family of adaptive algorithms that recursively compute the optimum separating system. The algorithms are of the gradient ascent type and maximize a statistical criterion that involves only second- and fourth-order cumulants. We present a complete analysis of all the stationary points in the proposed criterion for an arbitrary number of complex sources. We demonstrate that the algorithms can only converge to points where perfect separation is achieved provided that the mixing system is a square invertible matrix and all the sources have the same kurtosis sign. We also prove that the criterion is free of undesirable maxima. (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
blind source separation
higher-order statistics
adaptive algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W
Organization
No organization information available