摘要： 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. •The order of the computational complexity of the EMD is equivalent to FFT.•Optimized program is proposed to speed up the computation of EMD up to 1000 times.•Fast HHT with optimized EMD/EEMD algorithm can operate in real-time. 出版者： Elsevier B.V 出版日期： 2014-04-15 出處： Physica A, 2014-04, Vol.400, p.159-167 版權： 2014 Elsevier B.V. 識別號： ISSN: 0378-4371 識別號： EISSN: 1873-2119 識別號： DOI: 10.1016/j.physa.2014.01.020
