UM  > Faculty of Health Sciences
Fast Algorithm Based on Parallel Computing for Sample Entropy Calculation
Dong X.1; Chen C.2; Geng Q.3; Zhang W.4; Zhang X.D.2
2021
Source PublicationIEEE Access
ISSN2169-3536
Abstract

Sample entropy is a widely used method for assessing the irregularity of physiological signals, but it has a high computational complexity, which prevents its application for time-sensitive scenes. To improve the computational performance of sample entropy analysis for the continuous monitoring of clinical data, a fast algorithm based on OpenCL was proposed in this paper. OpenCL is an open standard supported by a majority of graphics processing unit (GPU) and operating systems. Based on this protocol, a fast-parallel algorithm, OpenCLSampEn, was proposed for sample entropy calculation. A series of 24-hour heartbeat data were used to verify the robustness of the algorithm. Experimental results showed that OpenCLSampEn exhibits great accelerating performance. With common parameters, this algorithm can reduce the execution time to 1/75 of the base algorithm when the signal length is larger than 60,000. OpenCLSampEn also exhibits robustness for different embedding dimensions, tolerance thresholds, scales and operating systems. In addition, an R package of the algorithm is provided in GitHub. We proposed a sample entropy fast algorithm based on OpenCL that exhibits significant improvement for the computation performance of sample entropy. The algorithm has broad utility in sample entropy when facing the challenge of future rapid growth in the quantity of continuous clinical and physiological signals.

KeywordAcceleration Algorithm Biomedical Monitoring Entropy Fast Computation Graphics Processing Unit Graphics Processing Units Kernel Parallel Computing Sample Entropy Standards Time Series Analysis
DOI10.1109/ACCESS.2021.3054750
URLView the original
Indexed BySCIE
Language英語English
WOS Research AreaComputer Science ; Engineering ; Telecommunications
WOS SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications
WOS IDWOS:000615026000001
The Source to ArticleScopus
Fulltext Access
Citation statistics
Cited Times [WOS]:0   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionFaculty of Health Sciences
Corresponding AuthorZhang X.D.
Affiliation1.School of Software Engineering, South China University of Technology Guangzhou, China and Zhuhai Laboratory of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Zhuhai College of Jilin University Zhuhai, China.;
2.CRDA, Faculty of Health Sciences, University of Macau, Taipa, Macau.;
3.Guangdong General Hospital, Guangdong Academy of Medical Science, Guangzhou, China.;
4.Research Center of Precision Sensing and Control, Institute of Automation, Chinese Academy of Sciences, Beijing, China.
Corresponding Author AffilicationFaculty of Health Sciences
Recommended Citation
GB/T 7714
Dong X.,Chen C.,Geng Q.,et al. Fast Algorithm Based on Parallel Computing for Sample Entropy Calculation[J]. IEEE Access,2021.
APA Dong X.,Chen C.,Geng Q.,Zhang W.,&Zhang X.D..(2021).Fast Algorithm Based on Parallel Computing for Sample Entropy Calculation.IEEE Access.
MLA Dong X.,et al."Fast Algorithm Based on Parallel Computing for Sample Entropy Calculation".IEEE Access (2021).
Files in This Item: Download All
File Name/Size DocType Version Access License
09336019.pdf(4577KB)期刊论文出版稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Dong X.]'s Articles
[Chen C.]'s Articles
[Geng Q.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Dong X.]'s Articles
[Chen C.]'s Articles
[Geng Q.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Dong X.]'s Articles
[Chen C.]'s Articles
[Geng Q.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: 09336019.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.