On Extending the Complex FastICA Algorithm to Noncircular Sources

DOI10.1109/TSP.2007.911278MaRDI QIDQ4568703zbMATH OpenOpenAlexFDO

Authors Mike Novey, Tülay Adalı

Publication date 27 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2007.911278

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Efficient variant of noncircular complex FastICA algorithm for the blind source separation of digital communication signals
• On extending the complex FastICA algorithms to noisy data
• An improved FastICA algorithm and its application
• Efficient optimization of reference-based negentropy for noncircular sources in complex ICA
• Accelerating the Nonuniform Fast Fourier Transform
• Noncircular Complex ICA by Generalized Householder Reflections
• On fastICA algorithms and some generalisations
• Improved Fast-ICA algorithm based on convergence proof of nonlinear function
• A Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function

Cited in

(6)

• Efficient optimization of reference-based negentropy for noncircular sources in complex ICA
• Efficient variant of noncircular complex FastICA algorithm for the blind source separation of digital communication signals
• Performance analysis of the nc-FastICA algorithm
• Blind separation of noncircular sources via approximate joint diagonalization of augmented charrelation matrices
• Maximization of nonlinear autocorrelation for blind source separation of non-stationary complex signals
• On extending the complex FastICA algorithms to noisy data

This page was built for publication: On Extending the Complex FastICA Algorithm to Noncircular Sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568703)