On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Nanoscale digital computation through percolation
Proceedings of the 46th Annual Design Automation Conference
| Hi-index | 0.00 |
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the switch is connected to its four neighbours; else it is not connected. Boolean functions are implemented in terms of connectivity across the lattice: a Boolean function evaluates to 1 iff there exists a top-to-bottom path. The paper addresses the following synthesis problem: how should we map literals to switches in a lattice in order to implement a given target Boolean function? We seek to minimize the number of switches. Also, we aim for an efficient algorithm -- one that does not exhaustively enumerate paths. We exploit the concept of lattice and Boolean function duality. We demonstrate a synthesis method that produces lattices with a number of switches that grows linearly with the number of product terms in the function. Our algorithm runs in time that grows polynomially.