Reduced offsets for minimization of binary-valued functions
Malik, A.A.
Brayton, R.K.
Newton, A.R.
Sangiovanni-Vincentelli, A.
IBM Thomas J Watson Res. Center, Yorktown Heights, NY;
Abstract
A modified approach to two-level logic minimization is described
which obviates the need to compute the offset, yet provides the same
global picture available with the offset. This approach is based on a
new concept called the reduced offset. It is shown that reduced offsets
can be computed without using the offset. This scheme has been
implemented in ESPRESSO with an interface to the multilevel minimization
environment MIS, where it is used to minimize individual nodes
(representing two-level functions with single outputs) in multilevel
networks. Such functions usually have very large offsets because of a
large number of variables in their don't care sets. The modified
approach is up to 8.5 times faster than ESPRESSO on a set of benchmark
examples
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
