Practical exact synthesis Article Swipe

View

Related Concepts

Computer science Satisfiability Boolean satisfiability problem Boolean function And-inverter graph Theoretical computer science Algorithm Mathematical optimization Boolean circuit Mathematics

Mathias Soeken , Winston Haaswijk , Eleonora Testa , Alan Mishchenko , Luca Amarù , Robert K. Brayton , Giovanni De Micheli ·

YOU? · · 2018 · Open Access · · DOI: https://doi.org/10.23919/date.2018.8342027 · OA: W2799013413

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.