Exclusive-OR representations of Boolean functions

Authors:
Harold Fleisher;Morton Tavel;John Yeager
Affiliations:
IBM Data Systems Division, Poughkeepsie, New York;Vassar College, Poughkeepsie, New York;Stanford University, Palo Alto, California
Venue:
IBM Journal of Research and Development
Year:
1983

Citing 5
Cited 1

Computer Logic, Testing and Verification

Computer Logic, Testing and Verification
Minimization of Modulo-2 Sum of Products

IEEE Transactions on Computers
A Method for Modulo-2 Minimization

IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Fault Detecting Test Sets for Reed-Muller Canonic Networks

IEEE Transactions on Computers
Easily Testable Realizations ror Logic Functions

IEEE Transactions on Computers

A Computer Algorithm for Minimizing Reed-Muller Canonical Forms

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

With the goal of making exclusive-OR formulations of switching functions more readily available to designers for implementation in LSI and VLSI technologies, we introduce the concept of an exclusive-OR space in which an exclusive-OR normal form is defined to correspond to the conventional disjunctive normal form. A geometrical representation of exclusive-OR space is described, and its various bases are listed and discussed.