Automatic generation of synthetic sequential benchmark circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 21, Issue 8, 2002, Pages 928-940

  Hutton, Michael D ^a,b,c   Rose, Jonathan S ^a,b   Corneil, Derek G ^b  

^a IEEE   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c ALTERA CORPORATION   (United States)

Author keywords

Benchmark; Digital circuits; Placement

Indexed keywords

PROGRAMMABLE LOGIC DEVICES (PLD);

ALGORITHMS; COMBINATORIAL CIRCUITS; COMPUTER AIDED DESIGN; DIGITAL CIRCUITS; STATISTICAL METHODS;

SEQUENTIAL CIRCUITS;

EID: 0036683878     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2002.800456     Document Type: Article

References (31)

1. Characterization and parameterized random generation of combinational benchmark circuits
2. Characterization parameterized random generation of digital circuits
3. A method for generating random circuits and its application to routability measurement
4. Placement and average interconnection lengths of computer logic
5. Random generation of test instances for logic optimizers
6. VPR: A new packing, placement and routing tool for FPGA research
7. Generation of synthetic sequential benchmark circuits
8. Equivalence classes of clone circuits for physical design benchmarking
9. Applications of clone circuits to issues in physical design
10. Toward a new benchmarking paradigm in EDA: Analysis of equivalence class mutant circuit distributions
11. Synthesis of wiring-signature-invariant equivalence class circuit mutants and applications to benchmarking
12. Design of experiments for evaluation of BDD packages using controlled circuit mutations
13. Design of experiments in CAD: Context and new data sets for ISCAS'99
14. Equivalence classes of circuit mutants for experimental design
15. Generating synthetic benchmark circuits for evaluationg CAD tools
16. PartGen: A generator of very large circuits to benchmark the partitioning of FPGA's
17. Memory-to-memory connection structures in FPGA's with embedded memory arrays
18. A technique for drawing directed graphs
19. A linear time heuristic for improving network partitions
20. The ISPD circuit benchmark suite
21. Multilevel hypergraph partitioning: Application in the VLSI domain
22. A fast routability-driven router for FPGA's
23. Trading quality for compile-time: Ultra-fast placement for FPGA's
24. Analysis of placement procedures for VLSI standard cell layout