Fast Software Implementation of Serial Test and Approximate Entropy Test of Binary Sequence

Algorithm 2

Approximate entropy test.

 Input: a binary sequence of length n. m is the bit length of subsequence

 Output: pass or not

 Step 1: extend the sequence by appending the first m-1 bits to the end of the sequence .

 Step 2: determine the frequency of all possible m-bit subsequences.

 Step 3: compute , for each value of i. .

 Step 4: compute .

 Step 5: repeat Steps 1–4, replacing m by m+1.

 Step 6: compute with .

 Step 7: compute values. .

 Step 8: if , the sequence passes the test. Otherwise, return not pass.