Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An optimized EASI algorithm

From MaRDI portal
Revision as of 03:54, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2517855
Jump to:navigation, search

DOI10.1016/j.sigpro.2008.08.015zbMath1151.94428OpenAlexW2018844102MaRDI QIDQ2517855

Jimin Ye, Kejun You, Haihong Jin, Shun-Tian Lou

Publication date: 9 January 2009

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2008.08.015


zbMATH Keywords

blind source separationcumulant based approximation of contrast functionEASI algorithm


Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Software, source code, etc. for problems pertaining to information and communication theory (94-04)




Cites Work

  • Neural gradient-based recursive least-squares algorithm for adaptive blind source separation
  • Independent component analysis, a new concept?


This page was built for publication: An optimized EASI algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2517855&oldid=15236873"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 03:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki