Logic Synthesis for Regular Layout using Satisfiability
Marek A. Perkowski, Alan Mishchenko · PDXScholar (Portland State University) · 2002
In this paper, we propose a regular layout geometry called 33 lattice. The main difference of this geometry compared to the known 22 regular layout geometry is that it allows the cofactors on a level to propagate to three rather than two nodes on the lower level. This gives additional freedom to synthesize compact functional representations. We propose a SAT-based algorithm, which exploits this freedom to synthesize 33 lattice representations of completely specified Boolean functions. The experimental results show that the algorithm generates compact layouts in reasonable time.