{'fraction_non_alphanumeric': 0.024390243902439025, 'fraction_numerical': 0.0040650406504065045, 'mean_word_length': 5.2405063291139244, '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}}
A new recursive formulation for 2-D WHT

This paper presents a new recursive formulation for computing the Walsh-Hadamard Transform (WHT) that allows the generation of higher order (longer size) 2-D WHT architectures from four lower order (shorter sizes) WHT architectures. Our methodology is based on manipulating tensor product forms so that they can be mapped directly into modular parallel architectures. The resulting WHT circuits have very simple modular structure and regular topology.