Issue No. 09 - September (2005 vol. 54)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2005.137
Jon T. Butler , IEEE
Tsutomu Sasao , IEEE
The traditional problem in binary decision diagrams (BDDs) has been to minimize the number of nodes since this reduces the memory needed to store the BDD. Recently, a new problem has emerged: minimizing the average path length (APL). APL is a measure of the time needed to evaluate the function by applying a sequence of variable values. It is of special significance when BDDs are used in simulation and design verification. A main result of this paper is that the APL for benchmark functions is typically much smaller than for random functions. That is, for the set of all functions, we show that the average APL is close to the maximum path length, whereas benchmark functions show a remarkably small APL. Surprisingly, however, typical functions do not achieve the absolute maximum APL. We show that the parity functions are unique in having that distinction. We show that the APL of a BDD can vary considerably with variable ordering. We derive the APL for various functions, including the AND, OR, threshold, Achilles' heel, and certain arithmetic functions. We show that the unate cascade functions uniquely achieve the absolute minimum APL.
Index Terms- Binary decision diagrams, BDD, average path length, APL, worst-case path length.
Jon T. Butler, Tsutomu Sasao, Munehiro Matsuura, "Average Path Length of Binary Decision Diagrams", IEEE Transactions on Computers, vol. 54, no. , pp. 1041-1053, September 2005, doi:10.1109/TC.2005.137