Home » Exclusive-OR Function (XOR)
Digital eBook

Exclusive-OR Function (XOR)

One element conspicuously missing from the set of Boolean operations is that of Exclusive-OR. Whereas the OR function is equivalent to Boolean addition, the AND function to Boolean multiplication, and the NOT function (inverter) to Boolean complementation, there is no direct Boolean equivalent for Exclusive-OR. This hasn’t stopped people from developing a symbol to represent it, though:

Exclusive-OR Function

This symbol is seldom used in Boolean expressions because the identities, laws, and rules of simplification involving addition, multiplication, and complementation do not apply to it. However, there is a way to represent the Exclusive-OR function in terms of OR and AND, as has been shown in previous chapters: AB’ + A’B

Exclusive-OR Equivalent Circuit

As a Boolean equivalency, this rule may be helpful in simplifying some Boolean expressions. Any expression following the AB’ + A’B form (two AND gates and an OR gate) may be replaced by a single Exclusive-OR gate.

Similar Articles:

Related Articles

Multiplexers

S Bharadwaj Reddy

Boolean Relationships on Venn Diagrams

S Bharadwaj Reddy

Binary Count Sequence

S Bharadwaj Reddy

Boolean Circuit Simplification Examples

S Bharadwaj Reddy

Special-output Gates

S Bharadwaj Reddy

Digital Logic Functions

S Bharadwaj Reddy

Leave a Comment

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

WordPress Image Lightbox