On the computational complexity of the empirical mode decomposition algorithm

NCU Institutional Repository > 生醫理工學院 > 生醫科學與工程學系 > 期刊論文 > Item 987654321/102860

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/102860

题名:	On the computational complexity of the empirical mode decomposition algorithm
作者:	羅孟宗;Wang, Yung-Hung;Yeh, Chien-Hung;Young, Hsu-Wen Vincent;Hu, Kun;Lo, Men-Tzung
贡献者:	生醫理工學院生醫科學與工程學系
关键词:	Complexity;Computation;Computational efficiency;Decomposition;EEMD;EMD;Empirical analysis;Equivalence;Fourier transforms;Space;Statistical mechanics;Time
日期:	2014-04-15
上传时间:	2026-04-23 11:18:17 (UTC+8)
出版者:	Elsevier;Elsevier B.V
摘要:	摘要： 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
显示于类别:	[生醫科學與工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	44	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing