any gate i can substitute to xor gate?

[chrisalviola]

any gate i can substitute to xor gate?
if i dont have xor gate what gate i can use to substitute it?

[mgb_phys]

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]

any gate i can substitute to xor gate?
if i dont have xor gate what gate i can use to substitute it?

define xor with a truth table.

[chrisalviola]

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.

nope not a homework
i want to make a binary adder cuircuit i dont have an xor gate only and, or & not.

[chrisalviola]

define xor with a truth table.

0 0 -0
0 1-1
1 0-1
1 1-0

[rootX]

0 0 -0
0 1-1
1 0-1
1 1-0

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...)

[chrisalviola]

problem solved

http://www.play-hookey.com/digital/xor_function.html

[chrisalviola]

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...)
tnks

[mgb_phys]

Isn't it, A or B and not( A and B)