Boolean resubstitution with permissible functions and binary decision diagrams

Authors:
Hitomi Sato;Yoshihiro Yasue;Yusuke Matsunaga;Masahiro Fujita
Affiliations:
Semiconductor Division, FUJITSU Limited, Kawasaki, Japan;Semiconductor Division, FUJITSU Limited, Kawasaki, Japan;AI Laboratory, FUJITSU Labs. Limited, Kawasaki, Japan;AI Laboratory, FUJITSU Labs. Limited, Kawasaki, Japan
Venue:
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Year:
1991

Citing 4
Cited 8

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The Transduction Method-Design of Logic Networks Based on Permissible Functions

IEEE Transactions on Computers
Multi-level logic simplification using don't cares and filters

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Edge-valued binary decision diagrams for multi-level hierarchical verification

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Rectification of multiple logic design errors in multiple output circuits

DAC '94 Proceedings of the 31st annual Design Automation Conference
Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Ordered Binary Decision Diagrams and Minimal Trellises

IEEE Transactions on Computers
A Characterization of Binary Decision Diagrams

IEEE Transactions on Computers
8.4 Undetectable Fault Removal of Sequential Circuits Based on Unreachable States

VTS '98 Proceedings of the 16th IEEE VLSI Test Symposium
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis

EURO-DAC '91 Proceedings of the conference on European design automation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we present a new Boolean resubstitution technique with permissible functions and ordered binary decision diagrams, abbreviated as OBDD[8]. Boolean resubstitution is one technique for multi-level logic optimization. Permissible functions are special don't care sets. We represent the data structure of permissible functions and logic functions at each node in Boolean networks in terms of OBDD. Therefore, logic functions can be flexibly manipulated and rapidly executed. We have previously reported a multi-level logic optimization technique called transduction methods[1] using OBDD in ICCAD'89[7]. We have improved the OBDD operation techniques, so that now OBDD operations can be executed faster than we reported before. We also applied Boolean resubstitution to our multi-level logic synthesis. We present results of experiments employing the improved OBDD operation techniques and applying Boolean resubstitution to our multi-level logic synthesis.