Average Path Length as a Paradigm for the Fast Evaluation of Functions Represented by Binary Decision Diagrams
Abstract
This paper focuses on the average path length (APL) of BDD's for switching functions. APL is a metric for the time it takes to evaluate the function by a computer program. We derive the APL for the AND, OR, parity, carry-out, comparison, threshold symmetric, and majority functions. We also consider the average of the APL for various classes of functions, including symmetric, threshold symmetric, and unate cascade. For symmetric functions, we show the average APL is close to the maximum path length, n, the number of variables. We show there are exactly two functions, the parity functions, that achieve the upper bound, n, on the APL for BDD's over all functions dependent on n variables. All other functions have an APL strictly less than n. We show that the APL of BDD's over all functions dependent on n variables is bounded below by 2 - 1/2n-1 . The set of functions that achieves this small value is uniquely the set of unate cascade realizable functions. We also show that the APL for benchmark functions is typically much less than for random functions.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 02, 2002
- Accession Number
- ADA593009
Entities
People
- J. T. Butler
- M. Matsuura
- T. Sasao
Organizations
- Naval Postgraduate School