To SAT or not to SAT: Ashenhurst decomposition in a large scale

Authors:
Hsuan-Po Lin;Jie-Hong R. Jiang;Ruei-Rung Lee
Affiliations:
National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan
Venue:
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Year:
2008

Citing 7
Cited 5

Compatible class encoding in hyper-function decomposition for FPGA synthesis

DAC '98 Proceedings of the 35th annual Design Automation Conference
Functional multiple-output decomposition with application to technology mapping for lookup table-based FPGAs

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Functional Decomposition with Application to FPGA Synthesis

Functional Decomposition with Application to FPGA Synthesis
FPGA technology mapping: a study of optimality

Proceedings of the 42nd annual Design Automation Conference
Scalable exploration of functional dependency by interpolation and incremental SAT solving

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Bi-decomposing large Boolean functions via interpolation and satisfiability solving

Proceedings of the 45th annual Design Automation Conference
Boolean matching for LUT-based logic blocks with applications to architecture evaluation and technology mapping

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantifier Elimination via Functional Composition

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Interpolating functions from large Boolean relations

Proceedings of the 2009 International Conference on Computer-Aided Design
Bi-decomposition of large Boolean functions using blocking edge graphs

Proceedings of the International Conference on Computer-Aided Design
New & improved models for SAT-based bi-decomposition

Proceedings of the great lakes symposium on VLSI
A counterexample-guided interpolant generation algorithm for SAT-based model checking

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not scale well to large Boolean functions. Variable partitioning has to be specified a priori and often restricted to a few bound-set variables. Moreover, non-disjoint decomposition requires substantial sophistication. This paper shows that, when Ashenhurst decomposition (the simplest and preferable functional decomposition) is considered, both single and multiple-output decomposition can be formulated with satisfiability solving, Craig interpolation, and functional dependency. Variable partitioning can be automated and integrated into the decomposition process without the bound-set size restriction. The computation naturally extends to nondisjoint decomposition. Experimental results show that the proposed method can effectively decompose functions with up to 300 input variables.