The discussion revolves around the question of substituting an XOR gate with other logic gates, particularly in the context of building a binary adder circuit. Participants explore various approaches and definitions related to XOR in Boolean algebra.
Participants express differing views on how to substitute an XOR gate, with some suggesting specific methods while others provide alternative expressions. The discussion does not reach a consensus on a single substitution method.
Some participants assume familiarity with Boolean algebra and K-maps, while others focus on practical circuit design. The discussion includes various interpretations of how to implement XOR functionality without directly using an XOR gate.
This discussion may be useful for individuals interested in digital logic design, circuit construction, and Boolean algebra, particularly those looking for alternatives to standard logic gates.
chrisalviola said:any gate i can substitute to xor gate?
if i don't have xor gate what gate i can use to substitute it?
mgb_phys said:If this is homework - what is XOR in boolean algebra ?
In practical terms you can build any logic out of either NAND or NOR, most chips only implement one of these.
rootx said:define xor with a truth table.
chrisalviola said:0 0 -0
0 1-1
1 0-1
1 1-0
tnksrootX said:xor = not(a).b + a.not(b)
I also thought this is a homework problem. You can easily get this into and/or gates. If there are more than 2 inputs, you should be using k-maps. Once, you have in and/or gates, it is simple to convert it into nand (using Sum of products form) or nors (using products of sums or simply messing with bool algebra...)