{'fraction_non_alphanumeric': 0.017126546146527116, 'fraction_numerical': 0.003805899143672693, 'mean_word_length': 5.493827160493828, '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}}
Generation of very large circuits to benchmark the partitioning of FPGA

This paper describes a new procedure for generating very large realistic benchmark circuits which are especially suited for the performance evaluation of FPGA partitioning algorithms. These benchmark circuits can be generated quickly. The generation of a netlist of 1OOK CLBs (500K equivalent gates), for instance, takes only two minutes on a standard UNIX workstation. The analysis of a large number of netlists from real designs lead us to identify the following five different kinds of sub-blocks: Regular combinational logic, irregular combinational logic, combinational and sequential logic, memory blocks, and interconnections. Therefore, our generator integrates a sub-generator for each of these types of netlist. The comparison of the partitioning results of industrial netlists with those obtained from generated netlists of the same size shows that the generated netlists behave similarly to the originals in terms of average filling rate and average pin utilization.