quote:

---

Originally written by Marlenny:

Done, I just edited my picts out.

---

quote:

---

Originally written by Ash Lael:

So you can play BoE now, Ben?

---

quote:

---

Originally written by Aranea Hirsuta:

Originally posted by WST ben:

quote:

---

XOR gate? I've wondered how that works for a while. As compared to AND or OR.

---

Ok, since you asked:

Here's a truth table for the XOR gate:

a b|xor
0 0|0
0 1|1
1 0|1
1 1|0

It's just like the OR except that it is "exclusive", which means that when both inputs are true, the function is false. The XOR function is also known as the ODD function, because it is only true when an odd number of inputs are true. Thus, the XNOR gate implements the complement of this, called the EVEN function.

This gate can have any number of inputs >=2. It is often used in microprocessor design in parity-bit-check circuits, which is a way to check errors in a word of data. The piece of logic "knows" that a piece of generated data has a certain number of 1's, then when the data is received at another location, it can XOR the bits of the data word together to determine if there are an even or odd number of 1's. Obviously, if an error occured where two ones became zeros or vice versa, this method of checking would not work and something more complex would be required.

:D

---