{'fraction_non_alphanumeric': 0.016891891891891893, 'fraction_numerical': 0.0, 'mean_word_length': 5.816091954022989, '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}}
Novel Recursive Solution for Area-Time Efficient Systolization of Discrete Fourier Transform

A new recursive solution based on Clenshaw's recurrence relation is formulated for computation of the discrete Fourier transform (DFT). The proposed recursive formulation is used further to derive a simple, regular and locally connected linear array architecture for systolic implementation of the DFT. The proposed structure offers nearly twice the throughput and involves nearly the same area-complexity as that of the corresponding existing DFT structure based on Clenshaw's recurrence relation.