A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Boolean resubstitution with permissible functions and binary decision diagrams
1990
Conference proceedings on 27th ACM/IEEE design automation conference - DAC '90
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
doi:10.1145/123186.123276
dblp:conf/dac/SatoYMF90
fatcat:62yah3qqsnf2pp53k6bwauv5yu