{'fraction_non_alphanumeric': 0.03270440251572327, 'fraction_numerical': 0.01509433962264151, 'mean_word_length': 4.726618705035971, '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}}
FPGA-implementation of Time-Multiplexed Multiple Constant Multiplication based on carry-save arithmetic

This paper proposes a method to implement time-multiplexed multiple constant multiplication (T-MMCM) based on carry-save adders on FPGA devices. Some basic cells have been defined. These cells are efficiently mapped on the FPGA devices and allow the designer to built T-MMCM circuits based on a tree topology. The performance of the proposed method has been validated by means of two designs: an n-point FFT butterfly with n=64, 128 and 256, and a 2-D DCT. Both designs have been implemented on a Virtex-5 device. The results show that the proposed method improves the throughput (up to 50%) and reduces the area in many cases compared to the implementation based on carry-propagate adders.