Research Article

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

Algorithm 3

Determine the frequency of all possible m-bit subsequence (bit string).
Input: A extended binary sequence of length . m is the bit length of subsequence.
Output:, for each value of .
 Step 1: , for each value of i.
 Step 2: for , do: 2.1 . 2.2 for , do: . 2.3 .
 Step 3: return , for each value of .