Boolean resubstitution with permissible functions and binary decision diagrams

Hitomi Sato, Yoshihiro Yasue, Yusuke Matsunaga, Masahiro Fujita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

A new Boolean resubstitution technique with permissible functions and ordered binary decision diagrams (OBDDs) is presented. Boolean resubstitution is one technique for multilevel logic optimization. Permissible functions are special don't care sets. The data structure of permissible functions and logic functions at each node in Boolean networks is represented in terms of OBDD. Therefore, logic functions can be flexibly manipulated and rapidly executed. Boolean resubstitution was also applied to a multilevel logic synthesis. Results of experiments employing the improved OBDD operation and Boolean resubstitution techniques are presented.

Original languageEnglish
Title of host publication27th ACM/IEEE Design Automation Conference. Proceedings 1990
PublisherPubl by IEEE
Pages284-289
Number of pages6
ISBN (Print)081869650X
DOIs
Publication statusPublished - 1990
Externally publishedYes
Event27th ACM/IEEE Design Automation Conference - Orlando, FL, USA
Duration: Jun 24 1990Jun 28 1990

Publication series

Name27th ACM/IEEE Design Automation Conference. Proceedings 1990

Other

Other27th ACM/IEEE Design Automation Conference
CityOrlando, FL, USA
Period6/24/906/28/90

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Boolean resubstitution with permissible functions and binary decision diagrams'. Together they form a unique fingerprint.

Cite this