(A Or B) And Not (A And B)
+19
A:
You're looking for a XOR, depending on the language it may be a single operation.
Bryan McLemore
2009-11-12 17:01:55
In your notation, that'd be: A Xor B
jeffamaphone
2009-11-12 17:02:59
Should be optimized into a single operation by the compiler / interpreter, I would hope!
Jeff Paquette
2009-11-12 17:03:21
My brain isn't working today.
ChaosPandion
2009-11-12 17:06:13
Hehe, happens to us all mate.
Bryan McLemore
2009-11-12 17:08:29
+3
A:
If you have Xor or equality in your atomic operations, yes, it is exactly the former or the negation of the latter.
Pascal Cuoq
2009-11-12 17:02:46
+3
A:
isn't this just an exclusive or? sometimes indicated by this syntax: A ^ B
ennuikiller
2009-11-12 17:03:36
I've never in my life seen that syntax. If you showed that to any logician they would say that that meant "A and B": XOR is usually written as a "+" inside an "O" or as a "=" with a "\" through it.
Satanicpuppy
2009-11-12 17:14:26
ennuikiller
2009-11-12 18:29:45
I agree, nice trick but I think it hides the intent of the expression.
ChaosPandion
2009-11-12 17:19:05
A:
As others have said, this is an XOR. Note that the best ways to solve this are either a logic table as NawaMan used, or with a Karnaugh map. In EE, Karnaugh maps are more common since they lend themselves more readily to complex expressions with multiple inputs.
If you're implementing this in hardware, Karnaugh maps are nearly always the best way to go as they give you the minimum number of gates required to implement the required outputs. Also, unlike in software, you may not have an xor gate available in hardware, but each gate can be expressed as a combination of other gates. AND can be made from NAND, etc, which will increase the number of gates required but can reduce the cost of your device.
David Lively
2009-11-12 17:13:24