{'fraction_non_alphanumeric': 0.011428571428571429, 'fraction_numerical': 0.004285714285714286, 'mean_word_length': 4.9914529914529915, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
High speed binary counter based on 1D Cellular Automata

This work presents a binary counter that was derived using the basic theory of 1D Cellular Automata. One of the 1D Cellular Automata seeds is producing an evolutionary structure in which the sequence of binary numbers is reproduced in selective bit positions. The main characteristic of this counting sequence is that it is produced with low complexity with a small penalty of information redundancy. The proposed counter was implemented in FPGA technology and it is performing better than any other binary counter reported in literature. Also, in the majority of the cases, its performance overcomes even FPGA vendor's available soft IP core.