On the computational complexity of the empirical mode decomposition algorithm

Yung Hung Wang, Chien Hung Yeh, Hsu Wen Vincent Young, Kun Hu, Men Tzung Lo

研究成果: 雜誌貢獻期刊論文同行評審

298 引文 斯高帕斯(Scopus)

摘要

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.

原文???core.languages.en_GB???
頁(從 - 到)159-167
頁數9
期刊Physica A: Statistical Mechanics and its Applications
400
DOIs
出版狀態已出版 - 15 4月 2014

指紋

深入研究「On the computational complexity of the empirical mode decomposition algorithm」主題。共同形成了獨特的指紋。

引用此