Abstract
We study the problem of evaluation of characteristic polynomials of Boolean functions with applications to combinational circuit verification. Two Boolean functions are equivalent if and only if their corresponding characteristic polynomials are identical. However, to verify the equivalence of two Boolean functions it is often impractical to construct the corresponding characteristic polynomials due to a possible exponential blow-up of the terms of the polynomials. Instead, we compare their values at a sample point without explicitly constructing the characteristic polynomials. Specifically, we sample uniformly at random in a unit cube and determine whether two characteristic polynomials are identical by their evaluations at the sample point; the error probability is zero when there are no round-off errors. In the presence of round-off errors, we sample on regular grids and analyze the error probability. We discuss in detail the Shannon expansion for characteristic polynomial evaluation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V.D. Agrawal and S.C. Seth, Test Generation for VLSI Chips (IEEE Computer Society Press, Los Alamitos, CA, 1988).
V.D. Agrawal, S.L. Grant, D. Lee and H. Woźniakowski, A software system for logic verification using the characteristic polynomial method, in: Proc. 14th Lucent Conf. on Electronic Testing, Murray Hill (April 1997) pp. 183–188.
R.E. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. Comput. 35 (1986) 677–691.
S.T. Chakradhar, V.D. Agrawal and M.L. Bushnell, Energy minimization and design for testability, J. Electronic Testing Theory Appl. 5 (1994) 57–66.
H. Fujiwara, Logic Testing and Design for Testability (MIT Press, Cambridge, MA, 1985).
J. Jain, J. Bitner, D.S. Fussell and J.A. Abraham, Probabilistic verification of Boolean functions, Formal Methods in System Design 1 (1992) 63–117.
D.E. Knuth, The Art of Computer Programming, Vol. II (Addison-Wesley, Reading, MA, 1981).
R.S. Ledley, Digital Computer and Control Engineering (McGraw-Hill, New York, 1960).
E.J. McCluskey, K.P. Parker and J.J. Shedletsky, Boolean network probabilities and network design, IEEE Trans. Comput. 27 (1978) 187–189.
K.P. Parker and E.J. McCluskey, Probabilistic treatment of general combinational networks, IEEE Trans. Comput. 24 (1975) 668–670.
J. Savir, Syndrome-testable design of combinational circuits, IEEE Trans. Comput. 29 (1980) 442–451; 1012–1013.
J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27(4) (1980) 701–717.
S.C. Seth and V.D. Agrawal, A new model for computation of probabilistic testability in combinational circuits, VLSI J. Integration 7 (1989) 49–75.
M. Yannakakis, Private communication.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Agrawal, V.D., Lee, D. & Woźniakowski, H. Numerical computation of characteristic polynomials of Boolean functions and its applications. Numerical Algorithms 17, 261–278 (1998). https://doi.org/10.1023/A:1016632423579
Issue Date:
DOI: https://doi.org/10.1023/A:1016632423579