Minimization of OR-XNOR expressions using four new linking rules

Authors:
Khalid Faraj
Affiliations:
Computer Science, Wajdi Institute of Technology, Jerusalem, Palestine
Venue:
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Year:
2008

Citing 5
Cited 1

Logic design principles with emphasis on testable semicustom circuits

Logic design principles with emphasis on testable semicustom circuits
On the Complexity of Mod-2l Sum PLA's

IEEE Transactions on Computers
Easily Testable Realizations for Generalized Reed-Muller Expressions

IEEE Transactions on Computers
A Method for Modulo-2 Minimization

IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Synthesis of multi-level dual reed-muller expressions

NANOTECHNOLOGY'09 Proceedings of the 1st WSEAS international conference on Nanotechnology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a minimization algorithm for fixed polarity dual Reed-Muller expressions (FPDRMs) for completely specified functions. For an n-variable function there are 2n different distinct FPDRMs. Minimum FPDRMs is one with the fewest number of sums. The minimization algorithm for the two-level dual Reed-Muller expressions has been developed, based on a four set of rules. The four new linking rules have been introduced to minimize single output dual Reed-Muller (OR/XNOR) expressions. The new rules are demonstrated using Karnaugh maps for some random functions.