{'fraction_non_alphanumeric': 0.02422145328719723, 'fraction_numerical': 0.01845444059976932, 'mean_word_length': 5.06993006993007, '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}}
Automated Placement for Parallelized FPGA FFTs

We present an automated placement algorithm for a high-bandwidth, streaming fast Fourier transform (FFT) generated using an open-source core generator. For radio spectral line analysis, we generate a 2048-point FFT for a standard commercial FPGA high-bandwidth spectrometer, which can process 16 digital samples per cycle simultaneously (streaming). Our placement algorithm enables this system to operate at 375 MHz and process a 6 GHz sampling rate, nearly 85% of the theoretical maximum FPGA clock rate. This algorithm is a special case of the junction tree algorithm from machine learning, and allows our design to support a 25% faster clock than the standard Xilinx tool flow implementation while using 50% less CPU time to compile. This gain is equivalent to gains induced by floor planning with no hand placement.