Fixed-Point Algorithms for the Blind Separation of Arbitrary Complex-Valued Non-Gaussian Signal Mixtures
نویسنده
چکیده
We derive new fixed-point algorithms for the blind separation of complex-valued mixtures of independent, noncircularly symmetric, and non-Gaussian source signals. Leveraging recently developed results on the separability of complex-valued signal mixtures, we systematically construct iterative procedures on a kurtosis-based contrast whose evolutionary characteristics are identical to those of the FastICA algorithm of Hyvarinen and Oja in the real-valued mixture case. Thus, our methods inherit the fast convergence properties, computational simplicity, and ease of use of the FastICA algorithm while at the same time extending this class of techniques to complex signal mixtures. For extracting multiple sources, symmetric and asymmetric signal deflation procedures can be employed. Simulations for both noiseless and noisy mixtures indicate that the proposed algorithms have superior finitesample performance in data-starved scenarios as compared to existing complex ICA methods while performing about as well as the best of these techniques for larger data-record lengths.
منابع مشابه
!i#e%-p(i)* !as*ica A./(0i*12s !(0 *1e 3.i)% Sepa0a*i() (! C(2p.e#-4a.5e% Si/)a. 2i#*50es
In this paper, we derive new xed-point algorithms for the blind separation of complex-valued mixtures of independent, possibly non-circularly-symmetric, and non-Gaussian source signals. Leveraging recent results in complex independent component analysis, we construct iterative procedures for complex signal mixtures whose evolutionary characteristics are identical to those of the real-valued Fa...
متن کاملAlgorithmes temporels rapides de type point fixe pour la séparation aveugle de mélanges convolutifs Time-domain fast fixed-point algorithms for blind separation of convolutive mixtures
This paper presents new blind separation methods for Moving Average (MA) convolutive mixtures of independent MA processes. They consist of time-domain extensions of the FastICA algorithms developed by Hyvärinen and Oja for instantaneous mixtures. They perform a convolutive sphering in order to use parameter-free fast fixed-point algorithms associated with kurtotic or negentropic nongaussianity ...
متن کاملApplication of Non-Linear Functions at Distribution of Output SINR Gaussian Interference Channels
We have examined the convergence behavior of the LSCMA in some simple environments. Algorithms such as Multi¬ Target CMA, Multistage CMA, and Iterative Least Squares with Projection can be used for this purpose. The results presented here can form a basis for analysis of these multi-signal extraction techniques. Clearly, the variance and distribution of output SINR obtained with the LSCMA is al...
متن کاملA Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function
In this paper, we propose to use the Huber M -estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation of mixtures of independent, non-Gaussian, and proper complex-valued signals. Sufficient and necessary conditions for the local stability of the complex-circular FastICA algorithm for an arbitrary cost are provided. A ...
متن کاملA simple algorithm of Blind Source Separation for noisy images
The Blind Source Separation (BSS) problem has become one of the main signal processing research areas, mainly due to its increasing application potential to many real world problems. A number of algorithms based on the Independent Component Analysis (ICA) theory have provided a solution to the BSS problems and have been successfully applied to a wide range of fields, covering diverse subjects s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007