{'fraction_non_alphanumeric': 0.02506265664160401, 'fraction_numerical': 0.0, 'mean_word_length': 5.153846153846154, '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}}
Vector split-radix algorithm for DFT computation

Recently, a new family of DFT algorithms, designated as the PM family of DFT algorithms, with improved structural complexity has been reported. In these algorithms, a better performance is achieved by using an approach employing vectorized data. In the present paper, a new split-radix algorithm for DFT computation using this approach is developed.