Creating hard problem instances in logic synthesis using exact minimization

被引：0

作者：

Günther, W ^{[1
]}

Drechsler, R ^{[1
]}

机构：

[1] Univ Freiburg, Inst Comp Sci, D-79110 Freiburg, Germany

来源：

ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS | 1999年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

To evaluate synthesis algorithms, usually benchmark circuits are used Since for these circuits no exact synthesis results are known, we propose the use of exact minimization to generate hard problem instances. By this we evaluate a standard synthesis tool on different classes of circuits.

引用

页码：436 / 439

页数：4

共 50 条

[21] Removal of SAT-Hard Instances in Logic Obfuscation Through Inference of Functionality
Mcdaniel, Isaac
Zuzak, Michael
Srivastava, Ankur
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2024, 29 (04)
[22] Crosstalk minimization in logic synthesis for PLA
Liu, YY
Wang, KH
Hwang, TT
DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2004, : 790 - 795
[23] Crosstalk minimization in logic synthesis for PLAs
Liu, Yi-Yu
Wang, Kuo-Hua
Hwang, Tingting
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2006, 11 (04) : 890 - 915
[24] Solving Large Scale Instances of Hub Location Problems with a Sub-problem Using an Exact Method
Stanojevic, Predrag
Maric, Miroslav
IPSI BGD TRANSACTIONS ON INTERNET RESEARCH, 2015, 11 (01): : 1 - 6
[25] DRAG MINIMIZATION USING EXACT METHODS
POWERS, SA
AIAA JOURNAL, 1964, 2 (05) : 941 - 943
[26] Benchmarking Quantum Annealing Against “Hard” Instances of the Bipartite Matching Problem
Vert D.
Sirdey R.
Louise S.
SN Computer Science, 2021, 2 (2)
[27] Creating complexity - the beauty and logic of synthesis
Hall, N
CHEMICAL COMMUNICATIONS, 2003, (06) : 661 - 664
[28] The stochastic machine minimization problem with hard deadlines and arrivals
Song, NO
Teneketzis, D
PROCEEDINGS OF THE 36TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 1997, : 2298 - 2303
[29] Exact Benchmark Circuits for Logic Synthesis
Neto, Walter Lau
Possani, Vinicius N.
Marranghello, Felipe S.
Matos, Jody Maick
Gaillardon, Pierre-Emmanuel
Reis, Andre Inacio
Ribas, Renato Perez
IEEE DESIGN & TEST, 2020, 37 (03) : 51 - 58
[30] An efficient divide and conquer algorithm for exact hazard free logic minimization
Rutten, JWJM
Berkelaar, MRCM
van Eijk, CAJ
Kolsteren, MAJ
DESIGN, AUTOMATION AND TEST IN EUROPE, PROCEEDINGS, 1998, : 749 - 754

← 1 2 3 4 5 →