Year: 2002
Type: article
Abstract: 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.
Authors: Marek Perkowski, Alan Mishchenko
Institution: Portland State University
Language: English
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: logic synthesis, Boolean function synthesis
Open Access status: green
OpenAlex ID: W1496200072
