TY - GEN
T1 - Boolean resubstitution with permissible functions and binary decision diagrams
AU - Sato, Hitomi
AU - Yasue, Yoshihiro
AU - Matsunaga, Yusuke
AU - Fujita, Masahiro
PY - 1990
Y1 - 1990
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0025557062&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025557062&partnerID=8YFLogxK
U2 - 10.1145/123186.123276
DO - 10.1145/123186.123276
M3 - Conference contribution
AN - SCOPUS:0025557062
SN - 081869650X
T3 - 27th ACM/IEEE Design Automation Conference. Proceedings 1990
SP - 284
EP - 289
BT - 27th ACM/IEEE Design Automation Conference. Proceedings 1990
PB - Publ by IEEE
T2 - 27th ACM/IEEE Design Automation Conference
Y2 - 24 June 1990 through 28 June 1990
ER -