Author： Chang Chip-Hong Falkowski Bogdan J.
Publisher： Taylor & Francis Ltd
ISSN： 1065-514X
Source： VLSI Design, Vol.14, Iss.3, 2002-01, pp. : 259-271
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this article, we have shown, by means of the EXOR Ternary Decision Diagram that the number of literals and product terms of the Fixed Polarity Reed-Muller (FPRM) expansions can be used to fully classify all Boolean functions in NP equivalent class and NPN equivalent class, respectively. Efficient graph based algorithms to compute the complete weight vectors have been presented. The proof and computation method has led to the derivation of a set of characteristic signatures that has low probability of aliasing when used as the Boolean matching filters in library mapping.
Related content
Access to resources
Recommend
Cracking Matrix Encryption Row by Row
By Bauer Craig Millward Katherine
Cryptologia, Vol. 31, Iss. 1, 2007-01 ,pp. :
On Minimum Witnesses for Boolean Matrix Multiplication
Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. :
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. :