{'fraction_non_alphanumeric': 0.015463917525773196, 'fraction_numerical': 0.003436426116838488, 'mean_word_length': 5.406593406593407, '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}}
Implementation of large-integer hardware multiplier in Xilinx FPGA

Implementation of wide multipliers for high performance is usually performed by the vendor synthesis/place and route software tool. This paper presents a partition algorithm for large integer multipliers with speed as optimization criteria. The generated solution uses built-in high-speed arithmetic blocks available in the current generation of Xilinx FPGA chip. The proposed technique has shown reduction in delay of more than 30% when compared to both Xilinx Coregen and Xilinx Synthesis Tools generated models.