Quantum logic, Algebraic functions, Computer algorithms
In this paper, we propose a regular layout geometry called 3×3 lattice. The main difference of this geometry compared to the known 2×2 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 3×3 lattice representations of completely specified Boolean functions. The experimental results show that the algorithm generates compact layouts in reasonable time.
Alan Mishchenko and Marek Perkowski, "Logic Synthesis for Regular Layout using Satisfiability," Proceedings of Symposium on Boolean Problems. September, 2002, Freiberg, Germany.