| Line 51: |
Line 51: |
| | | | |
| | ===NAND and NOR=== | | ===NAND and NOR=== |
| − | NAND and NOR are formed by simply performing a NOT on the output of an AND or OR operation, respectively. | + | NAND and NOR are formed by simply performing a NOT on the output of an AND or OR operation, respectively. NAND can be expressed symbolically as A NAND B = (AB)' and NOR can be expressed symbolically as A NOR B = (A+B)'. |
| − | | |
| − | A'B' + A'B + AB' | |
| − | A'(B'+B) + AB' | |
| − | A'(1) + AB'
| |
| − | A' + AB'
| |
| − | | |
| − | 00 = 1 + 0*1 = 1
| |
| − | 01 = 1 + 1*0 = 1
| |
| − | 10 = 0 + 1*1 = 1
| |
| − | 11 = 0 + 1*0 = 1
| |
| | | | |
| | ===XOR=== | | ===XOR=== |
| − | XOR (or "exclusive OR") gives a 1 ("true") if either of its inputs are 1, but not both. Mathematically this can be broken down as follows: | + | XOR (or "exclusive OR") gives a 1 ("true") if either of its inputs are 1, but not both. Symbolically this can be broken down into its basic operations by the expression: A XOR B = A'B + B'A. |
| − | | |
| − | :<math>AB + AB
| |
| | | | |
| | {{clear}} | | {{clear}} |