Timeline for implement multiple XOR with the minimum number of NAND gates
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 22 at 15:26 | comment | added | greybeard | I would appreciate a presentation of such a simplification. | |
| Jan 22 at 11:36 | comment | added | Whiter Fox | If it is like a board for checkers you can simplify the boolean expression first then write everything as Nand gates. | |
| Jan 22 at 7:18 | history | edited | greybeard | CC BY-SA 4.0 | lacking space made the expression look strange |
| Jan 22 at 6:54 | comment | added | greybeard | (You know the K-map of XORs? For 8 inputs, it looks a checkerboard.) | |
| Jan 21 at 22:53 | history | answered | Whiter Fox | CC BY-SA 4.0 |