Speeding up the Computation of Approximate Entropy

Approximate entropy is a measure of regularity which finds application in many problems in biomedical engineering. One drawback of the method is its high complexity which results in large execution times. The purpose of this paper is to alleviate this problem by examining three algorithms, two of which have never been suggested before for approximate entropy computation. In our experiments heart rate signals were analyzed using the three algorithms. The speedup achieved was significant.