Characterization and parameterized random generation of digital circuits

The development of new Field-Programmed, Mask-Programmed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the architectures and their automatic placement and routing algorithms. In this paper, we present a method and a tool for generating parameterized and realistic random circuits. To obtain the realism, we propose a set of graph-theoretic characteristics that describe a physical netlist, and have built a tool that can measure these characteristics on existing circuits. The generation tool uses the characteristics as constraints in the random circuit generation. To validate the quality of the generated netlists, parameters that are not specified in the generation are compared with those of real circuits, and with those of "random" graphs.

[1]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[2]  Roy L. Russo On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI , 1972, IEEE Transactions on Computers.

[3]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Jonathan Rose,et al.  Generation of synthetic sequential benchmark circuits , 1997, FPGA '97.

[6]  J. Cong,et al.  An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[7]  Wayne Wei-Ming Dai,et al.  A Method for Generation Random Circuits and Its Application to Routability Measurement , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[8]  Vaughn Betz,et al.  On Biased and Non-Uniform Global Routing Architectures and CAD Tools for FPGAs , 1996 .

[9]  Rajeev Murgai,et al.  Improved logic synthesis algorithms for table look up architectures , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[10]  Fadi J. Kurdahi,et al.  On the intrinsic rent parameter and spectra-based partitioning methodologies , 1992, EURO-DAC '92.

[11]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[12]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[13]  Stephen D. Brown Routing algorithms and architectures for field-programmable gate arrays , 1992 .

[14]  Roy L. Russo,et al.  On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[15]  Martin Charles Golumbic Combinatorial Merging , 1976, IEEE Transactions on Computers.