Abstract
In this paper we address the problem of generating large combinational circuits with good fan in and fanout distribution, high Rent factor and large number of reconvergent gates. Such circuits are in great demand in testing various circuit related algorithms as bench mark circuits or networks. Generation of such circuits is conjectured to be NP Hard problem and available tools are mostly proprietary in nature and may not be available for academic research purposes. In this paper we present a tool for generating large combinational circuits with desirable properties. Our tool generates a netlist that resemble real designs in terms of Rent parameter (interconnect complexity), net degree distribution, path depth and gate counts. We compare the circuits generated by our method with ISCAS-85 benchmark and OpenCores circuits. Using our method, 500K gates combinational circuit is generated in 8 seconds and 1.5 million gates in 36 seconds respectively. We prove that the circuits generated are acyclic in nature.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.