This commit is contained in:
Miloslav Ciz 2023-08-06 21:35:49 +02:00
parent ecd9c2f991
commit 96776982b7
13 changed files with 217 additions and 21 deletions

View file

@ -36,13 +36,25 @@ The truth table of these gates is as follows:
---/__..-' ---/__..-' ---|_____.' ---|_____.'
OR NOR AND NAND
___ ___ . .
--\\ ''-. --\\ ''-. ---|'. ---|'.
)) )--- )) )O-- | >--- | >O--
--//__..-' --//__..-' ---|.' ---|.'
--\\ ''-. --\\ ''-. ---|'. |'.
)) )--- )) )O-- | >--- ---| >O--
--//__..-' --//__..-' ---|.' |.'
XOR XNOR ' BUFFER ' NOT
alternatively:
____ ____ ____ ____
---|=> 1| ---| & | ---|= 1 | | 1 |
| |--- | |--- | |--- ---| |o--
---|____| ---|____| ---|____| |____|
OR AND XOR NOT
or even:
___ ___ ___ ___
--|OR |-- --|AND|-- --|XOR|-- --|NOT|--
--|___| --|___| --|___| |___|
```
*Traditional symbols for logic gates.*
*symbols often used for logic gates*
Functions NAND and NOR are so called [functionally complete](functional_completeness.md) which means we can implement any other gate with only one of these gates. For example NOT(x) = NAND(x,x), AND(x,y) = NAND(NAND(x,y),NAND(x,y)), OR(x,y) = NAND(NAND(x,x),NAND(y,y)) etc. Similarly NOT(x) = NOR(x,x), OR(x,y) = NOR(NOR(x,y),NOR(x,y)) etc.