{'fraction_non_alphanumeric': 0.02577319587628866, 'fraction_numerical': 0.001288659793814433, 'mean_word_length': 5.698275862068965, '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}}
Parallel Computing for the Radix-2 Fast Fourier Transform

The fast Fourier transform (FFT) is a speed-up technique for calculating the discrete Fourier transform (DFT), which in turn is a discrete version of the continuous Fourier transform. The Fast Fourier Transform is used in linear systems analysis, antenna studies, optics, random process modeling, probability theory, quantum physics, and boundary-value problems, and has been very successfully applied to restoration of astronomical data. This paper formulates the one dimensional and two dimensional continuous and discrete Fourier transform, especially the fast Fourier transform, considers their parallel algorithms and reports the speed up of parallel computing in both shared memory and distributed memory modes.