Abstract
This note corrects a previously reported result in JETTA [1] regarding the maximum number of interior vertices in an OBDD of a totally symmetric function. The exact maximum reported in [1] is shown to be an underestimate for functions as small as 6 variables. The correct equation is derived, and the error in the previously reported equation is shown to increase with the number of function variables.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.E. Ross, K.M. Butler and M.R. Mercer, “Exact ordered binary decision diagram size when representing clases of symmetric functions,”Journal of Electronic Testing, vol. 2, pp. 243–259, August 1991.
E.J. McCluskey,Logic Design Principles with emphasis on testable semi-custom circuits, Englewood Cliffs, NJ: Prentice-Hall, 1986.
R.E. Bryant, “Graph-based algorithms for Boolean function manipulation,”IEEE Transactions on Computers, vol. C-35, pp. 677–690, August 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Heap, M. On the exact ordered binary decision diagram size of totally symmetric functions. J Electron Test 4, 191–195 (1993). https://doi.org/10.1007/BF00971647
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00971647