@article{54a9b42f77c54ded9b82c6e7e5202fc6,
title = "On the computational complexity of the empirical mode decomposition algorithm",
abstract = "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 Transform. Numerical examples are presented to verify that EMD/EEMD is, in fact, a computationally efficient method.",
keywords = "Complexity, EEMD, EMD, Space, Time",
author = "Wang, {Yung Hung} and Yeh, {Chien Hung} and Young, {Hsu Wen Vincent} and Kun Hu and Lo, {Men Tzung}",
note = "Funding Information: M-T Lo was supported by NSC (Taiwan, ROC) , Grant No. 100-2221-E-008-008-MY2 , joint foundation of CGH and NCU , Grant Nos. CNJRF-101CGH-NCU-A4 , VGHUST102-G1-2-3 and NSC support for the Center for Dynamical Biomarkers and Translational Medicine, National Central University, Taiwan (NSC 101-2911-I-008-001 ).",
year = "2014",
month = apr,
day = "15",
doi = "10.1016/j.physa.2014.01.020",
language = "???core.languages.en_GB???",
volume = "400",
pages = "159--167",
journal = "Physica A: Statistical Mechanics and its Applications",
issn = "0378-4371",
}