0

I have to implement a circuit following the boolean equation A XOR B XOR C, however the XOR gates I am using only have two inputs (I am using the 7486 XOR gate to be exact, in case that makes a difference)... is there a way around this?

Tap
  • 1
  • 1
    Of course there is no such thing as A XOR B XOR C. That symbol is ambiguous in the absence of a well-defined rule of order of operations. XOR is a binary operator. So you must specify either (A XOR B) XOR C or A XOR (B XOR C). Logically, the results are equivalent, but your choice of association tells you how to build it from ordinary XOR gates, right? – MPW Mar 23 '15 at 01:26

3 Answers3

2

Take the output of A XOR B and pipe it into an XOR having C as the other input. (This implements (A XOR B) XOR C, and XOR is associative.

coffeemath
  • 29,884
  • 2
  • 31
  • 52
2

Exclusive or $\oplus$ is associative (and commutative), so you can use any order and any pairing.

$A \oplus B \oplus C = (A \oplus B) \oplus C = A \oplus (B \oplus C) $.

copper.hat
  • 172,524
0

use two gates. input $A$ and $B$ to the first gate, then input the output of the first gate and $C$ to the second gate.

David Holden
  • 18,040