Planar Multiple-Valued Decision Diagrams

Authors:
Affiliations:
Venue:
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Year:
1995

Citing 6
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Field-programmable gate arrays

Field-programmable gate arrays
Logic Synthesis and Optimization

Logic Synthesis and Optimization
Logic Design and Switching Theory

Logic Design and Switching Theory
Binary Decision Diagrams

IEEE Transactions on Computers
Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: In VLSI, crossings occupy space and cause delay. Therefore, there is significant benefit to planar circuits. We propose the use of planar multiple-valued decision diagrams to produce planar multiple-valued circuits. Specifically, we show conditions on 1) threshold functions, 2) symmetric functions, and 3) monotone increasing functions that produce planar decision diagrams. Our results apply to binary functions, as well. For example, we show that all two-valued monotone increasing threshold functions of up to five variables have planar binary decision diagrams.