{'fraction_non_alphanumeric': 0.05091258405379443, 'fraction_numerical': 0.01729106628242075, 'mean_word_length': 4.398963730569948, '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 split-radix algorithm for 2-D DFT

In this paper, the split-radix approach for computing the one-dimensional (1-D) discrete Fourier transform (DFT) is extended for the vector-radix fast Fourier transform (FFT) to compute the two-dimensional (2-D) DFT of size 2(r/sub 1/)/spl times/2(r/sub 2/), using a radix-2/spl times/2 index map and a radix-8/spl times/8 map instead of a radix-2/spl times/2 index map and a radix-4/spl times/4 map as is done in the classical split vector radix FFT algorithms. Since a radix-8/spl times/8 index map and a method for combining the twiddle factors are used, the new algorithm provides significant savings compared to the 2-D FFT algorithms previously reported in terms of the arithmetic complexity, data transfer, index generation and twiddle factor evaluation or access to the lookup table. In addition, since the algorithm is expressed in a simple matrix form using the Kronecker product, it facilitates an easy implementation of the algorithm, and allows for an extension to the multidimensional case.