Abstract
This paper addresses problems that arise while checking the equivalence of two Boolean functions under arbitrary input permutations. The permutation problem has several applications in the synthesis and verification of combinational logic: it arises in the technology mapping stage of logic synthesis and in logic verification. A popular method to solve it is to compute a signature for each variable that helps to establish a correspondence between the variables. Several researchers have suggested a wide range of signatures that have been used for this purpose. However, for each choice of signature, there remain variables that cannot be uniquely identified. Our research has shown that, for a given example, this set of problematic variables tends to be the same–regardless of the choice of signatures. The paper investigates this problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.S. Brace, R.L. Rudell, and R.E. Bryant, “Efficient implementation of a BDD package,” in Proceedings of the 27th ACM/IEEE Design Automation Conference, June 1990, pp. 40–45.
R.E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Transactions on Computers, Vol. C-35, pp. 677–691, 1986.
J.B. Burch and D.E. Long, “Efficient Boolean function matching,” in Proceedings of the Int'l Conference on Computer-Aided Design, November 1992, pp. 408–411.
D.I. Cheng and M. Marek Sadowska, “Verifying equivalence of functions with unknown input correspondence,” in Proceedings of EDAC, February 1993, pp. 81–85.
E.M. Clarke, K.L. McMillan, X. Zhao, M. Fujita, and J. Yang, “Spectral transforms for large Boolean functions with applications to technology mapping,” in Proceedings of the 30th ACM/IEEE Design Automation Conference, 1993, pp. 54–60.
G. Hotz, Schaltungstheorie, De Gruyter Lehrbuch, Walter De Gruyter, 1974.
Y.-T. Lai, S. Sastry, and M. Pedram, “Boolean matching using binary decision diagrams with applications to logic synthesis and verification,” in Proceedings of the ICCD'92, October 1992, pp. 452–458.
J. Mohnke, “A signature-based approach to formal logic verification,” Ph.D. thesis, http://sundoc. bibliothek.uni-halle.de/diss-online/99/99H050/, 1999.
J. Mohnke and S. Malik, “Permutation and phase independent Boolean comparison,” INTEGRATION-The VLSI Journal, Vol. 16, pp. 109–129, 1993.
D. Möller, J. Mohnke, and M. Weber, “Detection of symmetry of Boolean functions represented by ROBDDs,” in Proceedings of ICCAD, November 1993, pp. 680–684.
I. Pomeranz and S.M. Reddy, “On diagnosis and correction of design errors,” in Proceedings of ICCAD, November 1993, pp. 500–507.
I. Pomeranz and S.M. Reddy, “On determining symmetries in inputs of logic circuits,” IEEE Transactions on CAD of Integrated Circuits and Systems, Vol. 13, No. 11, pp. 1428–1434, 1994.
U. Schlichtmann, F. Brglez, and P. Schneider, “Efficient Boolean matching based on unique variable ordering,” in Proceedings of the IWLS, May 1993.
K.H. Wang, T.T. Hwang, and C. Chen, “Restructering binary decision diagrams based on functional equivalence,” in Proceedings of EDAC, February 1993, pp. 261–265.
I. Wegener, The Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science, John Wiley and B.G. Teubner, Stuttgart, 1987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mohnke, J., Molitor, P. & Malik, S. Limits of Using Signatures for Permutation Independent Boolean Comparison. Formal Methods in System Design 21, 167–191 (2002). https://doi.org/10.1023/A:1016091418702
Issue Date:
DOI: https://doi.org/10.1023/A:1016091418702