Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 14 (2002), Issue 3, Pages 259-271

Boolean Matching Filters Based on Row and Column Weights of Reed–Muller Polarity Coefficient Matrix

Nanyang Technological University, School of Electrical and Electronic Engineering, Block S1, Nanyang Avenue, Singapore 639798, Singapore

Received 11 May 2000; Revised 15 July 2000

Copyright © 2002 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.