On the computational complexity of the empirical mode decomposition algorithm

It has been claimed that the empirical mode decomposition (EMD) and its improved version the ensemble EMD (EEMD) are computation intensive. In this study we will prove that the time complexity of the EMD/EEMD, which has never been analyzed before, is actually equivalent to that of the Fourier Transf...

Full description

Saved in:

Bibliographic Details
Published in:	Physica A Vol. 400; pp. 159 - 167
Main Authors:	Wang, Yung-Hung, Yeh, Chien-Hung, Young, Hsu-Wen Vincent, Hu, Kun, Lo, Men-Tzung
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.04.2014
Subjects:	Complexity Computation Computational efficiency Decomposition EEMD EMD Empirical analysis Equivalence Fourier transforms Space Statistical mechanics Time DIV COMP Space ADD IMFs BFV MUL EEMD Time MEMD EMD Complexity
ISSN:	0378-4371, 1873-2119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!