Table of Contents
VLSI Design
Volume 14, 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.

Citations to this Article [3 citations]

The following is the list of published articles that have cited the current article.

  • Debatosh Debnath, and Tsutomu Sasao, “Exact minimization of FPRMs for incompletely specified functions by using MTBDDs,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E88-A, no. 12, pp. 3332–3341, 2005. View at Publisher · View at Google Scholar
  • Bogdan Jaroslaw Falkowski, Cicilia Claudia Lozano, and Susanto Rahardja, “Column polarity matrix algorithm for ternary fixed polarity Reed-Muller expansions,” Journal of Circuits, Systems and Computers, vol. 15, no. 2, pp. 243–262, 2006. View at Publisher · View at Google Scholar
  • Juling Zhang, Guowu Yang, William N. N. Hung, Yan Zhang, and Jinzhao Wu, “An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion,” Cluster Computing, 2018. View at Publisher · View at Google Scholar