Boolean Matching Filters Based on Row and Column Weights of Reed–Muller Polarity Coefficient Matrix-Reference-Cited by-同舟云学术

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

Published:2002-01-01 Issue:3 Volume:14 Page:259-271
ISSN:1065-514X
Container-title:VLSI Design
language:en
Short-container-title:VLSI Design

Author:

Chang Chip-Hong¹,Falkowski Bogdan J.¹

Affiliation:

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

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.

Publisher

Hindawi Limited

Subject

Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Hardware and Architecture

Link

http://downloads.hindawi.com/archive/2002/254781.pdf

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion;Cluster Computing;2018-01-31

2. COLUMN POLARITY MATRIX ALGORITHM FOR TERNARY FIXED POLARITY REED–MULLER EXPANSIONS;Journal of Circuits, Systems and Computers;2006-04

3. Exact Minimization of FPRMs for Incompletely Specified Functions by Using MTBDDs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2005-12-01