![]() Circuit diagram NOT gate with NOR gate. |
![]() Circuit diagram NOT gate with NAND gate. |
![]() Circuit diagram OR gate with NOR gates. |
![]() Circuit diagram AND gate with AND gates. |
Until now the circuit diagrams do not surprise you? However, they are a direct result of the Boolean algebra and are caused by the so-called idempotency and double negation law.
![]() Circuit diagram AND gate with NOR gates. |
![]() Circuit diagram OR gate with NAND gates. |
![]() Circuit diagram XNOR gate with NOR gates. |
![]() Circuit diagram XOR gate with NAND gates. |
These last two comparisons, however, are striking. They also are a direct result of the Boolean algebra. Here the most important law of Boolean algebra, De Morgan's laws comes into play.
For developers of logical modules blocks and computer chips, the De Morgan laws are essential. To understand why, you should take a look at the theme "Boolean algebra".