{'fraction_non_alphanumeric': 0.02404809619238477, 'fraction_numerical': 0.0, 'mean_word_length': 5.172839506172839, '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}}
Generalized Fourier transform processor

Fourier processing method is very popular in signal and image analysis. In this paper, a generalized Fourier transform (GFT) processor is introduced. It is generalized in that it contains the conventional Fourier transform (CFT) processor as a very limited special case by extending the diagonal filter matrix in CFT to a nondiagonal one. Thus, obviously, the GFT processor should be more powerful than the CFT processor. A computer demonstration shows this.