Poker Test

This test is to divide 20,000 bits stream into 5,000 consecutive 4-bit segments. Count and store the number of occurrences of the 16 possible 4-bit values. Denote f(i) as the number of each 4 bit value i, where 0<= i <= 15. Evaluate X such that X = (16/5000)* sum(i=0..15, f(i)*f(i)) - 5000 The test is passed if 2.16 < X < 46.17.