Don't-Care Aware ESOP Extraction via Reduced Decomposition-Tree Exploration
Chun-Yu Wei, Jie-Hong R. Jiang
Abstract
Exclusive-OR Sum-of-Products expressions (ESOPs) are vital for circuit synthesis of arithmetic functions and emerging technologies. The state-of-the-art ESOP extraction methods are limited in their inefficient exhaustive exploration strategy, significant optimality loss in the divide-and-conquer process, and incapability of handling don’t-cares. This work overcomes these limitations by reduced decomposition exploration with a cost estimation and refinement strategy, generally applicable to incompletely specified functions. Experiments show up to 29× (average 12×) runtime and 28× (average 13×) memory-usage improvements with a quality close to the exact optimum obtained by exhaustive exploration for completely-specified functions, and substantial ESOP simplification with don’t-cares for incompletely-specified functions.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get eab3a7dc-fd8a-4830-8332-4a0aeb01cbd6Related papers
- Search Strategies for Topological Network OptimizationMichael D. MoffittAAAI 2022
- Search space characterization for approximate logic synthesisLinus Witschen, Tobias Wiersema, Lucas Reuter, Marco PlatznerDAC 2022 · 3 citations
- An Efficient Asynchronous Batch Bayesian Optimization Approach for Analog Circuit SynthesisShuhan Zhang, Fan Yang, Dian Zhou, Xuan ZengDAC 2020 · 41 citations
- Vectorization for digital signal processors via equality saturationAlexa VanHattum, Rachit Nigam, Vincent T. Lee, James Bornholt et al.ASPLOS 2021 · 57 citations
- Circuit Minimization with QBF-Based Exact SynthesisFranz-Xaver Reichl, Friedrich Slivovsky, Stefan SzeiderAAAI 2023 · 14 citations
