State space blind source recovery for mixtures of multiple source distributions

The paper discusses state space blind source recovery (BSR) for minimum phase and non-minimum phase mixtures of Gaussian and non-Gaussian distributions. The state space natural gradient approach results in compact iterative update laws for BSR. Two separate state space algorithms for minimum phase and non-minimum phase mixing environments are presented. The advantages and disadvantages of both algorithms in the context of multiple source distribution mixtures are examined. The presented BSR algorithms require use of nonlinearities, which depend on the distribution of the unknown sources. We propose use of an adaptive nonlinearity based on the batch kurtosis of the output. This renders the adaptive estimation of the demixing network completely blind.

[1]  Khurram Waheed,et al.  State Space Feedforward and Feedback Structures for Blind Source Recovery , 2001 .

[2]  Khurram Waheed,et al.  Blind source recovery: some implementation and performance issues , 2001, Proceedings of the 44th IEEE 2001 Midwest Symposium on Circuits and Systems. MWSCAS 2001 (Cat. No.01CH37257).

[3]  Fathi M. A. Salam,et al.  Blind source recovery: algorithms for static and dynamic environments , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).

[4]  Gamze Erten,et al.  Blind Signal Separation and Recovery in Dynamic Environments , 1997 .

[5]  A. Cichocki,et al.  Blind Deconvolution of Dynamical Systems:A State-Space Approach , 2000 .