Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Gradient and Fixed-Point Complex ICA Algorithms Based on Kurtosis Maximization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hualiang Li ; Univ. of Maryland Baltimore County, Baltimore, MD ; Adali, T.

We present two algorithms for independent component analysis of complex-valued signals based on the maximization of absolute value of kurtosis and establish their properties. Both the algorithm derivation and the analysis are carried out directly in the complex domain, without the use of complex-to-real mappings as the cost function satisfies Brandwood's analyticity condition. Simulation results are presented that show the advantages of the new algorithms, especially when the number of sources in the mixture increases.

Published in:

Machine Learning for Signal Processing, 2006. Proceedings of the 2006 16th IEEE Signal Processing Society Workshop on

Date of Conference:

6-8 Sept. 2006