{'fraction_non_alphanumeric': 0.02392947103274559, 'fraction_numerical': 0.005037783375314861, 'mean_word_length': 5.680672268907563, '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}}
16- and 64-Point Analog Computing of FFT with Improved Performance and Efficiency

Fast fourier transform (FFT) is indispensable in multi-carrier radio frequency transform systems, especially in the Orthogonal Frequency Division Multiplexing (OFDM) system. And almost all transform systems implement FFT algorithms in the digital domain. Compared with the realization in digital domain, the implementation in analog domain brings greater advantages in speed and power consumption. This paper proposes a new type of analog Fast fourier transform (AFFT) system, analyzes the algorithm choice and compares the advantages and disadvantages of different algorithms, sets up the system model with non-ideal factors, constructs the specific circuit and compares the performance with different systems.