An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
A fast algorithm for finding common multiple-vertex dominators in circuit graphs
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Improved Boolean function hashing based on multiple-vertex dominators
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
In this paper we present a fast algorithm for computingthe value of a spectral transform of Boolean or multiple-valuedfunctions for a given assignment of input variables.Our current implementation is for arithmetic transform, becauseour work is primarily aimed at optimizing the performanceof probabilistic verification methods. However, thepresented technique is equally applicable for other discretetransforms, e.g. Walsh or Reed-Muller transforms. Previousmethods for computing spectral transforms used truthtables, sum-of-product expressions, or various derivativesof decision diagrams. They were fundamentally limited bythe excessive memory requirements of these data structures.We present a new algorithm that partitions the computationof the spectral transform based on the dominator relationsof the circuit graph representing the function to be transformed.As a result, the presented algorithm can handlelarger functions than previously possible.