{'fraction_non_alphanumeric': 0.014150943396226415, 'fraction_numerical': 0.003537735849056604, 'mean_word_length': 4.97887323943662, '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 high-speed programmable architecture using barrel shifters for FFT and digital filtering

Multiply and accumulate are the two basic operations for FFT and digital filtering algorithms. In high-speed applications, the multiplier is crucial to the performance. The multiplier requires either large chip area if parallel implementation is used or large amount of time if serial architecture is used. In this paper, the design of basic FFT arithmetic element and FIR filters using barrel shifters and accumulators (BSAC) to perform the multiplications is proposed and studied. The resulting architecture is completely programmable and allows the use of variable number of basic cells for each coefficient. The throughput rate of such an architecture is determined only by the delay in a single cell and hence can be of the order of 100 MHz or higher.