Author:
Reichl Franz-Xaver,Slivovsky Friedrich,Szeider Stefan
Abstract
This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits with exact synthesis. Individual synthesis tasks are encoded as Quantified Boolean Formulas (QBFs) that capture the full flexibility for implementing multi-output subcircuits.
This is in contrast to SAT-based resynthesis, where "don't cares" are computed for an individual gate, and replacements are confined to the circuitry used exclusively by that gate.
An implementation of our method achieved substantial size reductions compared to state-of-the-art methods across a wide range of benchmark circuits.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multiplication Complexity Optimization based on Quantified Boolean Formulas;2024 2nd International Symposium of Electronics Design Automation (ISEDA);2024-05-10
2. Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17
3. SAT-boosted Tabu Search for Coloring Massive Graphs;ACM Journal of Experimental Algorithmics;2023-07-25