Practical Exact Synthesis

In this paper, we discuss recent advances in exact synthesis, considering both their efficient implementation and various applications in which they can he employed. We emphasize on solving exact synthesis through Boolean satisfiability (SAT) encodings. Different SAT encodings for exact synthesis are compared, and examined the applications to multi-level logic synthesis, in both area and depth optimization. Another application of SAT based exact synthesis is optimization under many constraints. These constraints can, e.g., be a fixed fanout or delay constraints. Finally, we end our discussion by proposing directions for future research in exact synthesis.


Published in:
Proceedings Of The 2018 Design, Automation & Test In Europe Conference & Exhibition (Date), 309-314
Presented at:
Design, Automation and Test in Europe Conference and Exhibition (DATE), Dresden, GERMANY, Mar 19-23, 2018
Year:
2018
Publisher:
New York, IEEE
ISSN:
1530-1591
ISBN:
978-3-9819-2630-9
Keywords:
Laboratories:




 Record created 2018-11-08, last modified 2018-12-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)