NAND gates are simply the opposite of AND gates.

Y = A NAND B or Y = NOT(A AND B)

In programming it can be written as Y = A !& B or Y = !(A && B).

NAND Gate Truth Table

ABY
001
011
101
110

NAND Gates are just simplified combination of AND and NOT gates.

NAND From AND and NOT Truth Table

ABP0 (A AND B)Y (NOT(A AND B))
0001
0101
1001
1110
Logic Gates: NAND Gate
Tagged on:     

Leave a Reply

Your email address will not be published. Required fields are marked *

This website stores some user agent data. These data are used to provide a more personalized experience and to track your whereabouts around our website in compliance with the European General Data Protection Regulation. If you decide to opt-out of any future tracking, a cookie will be set up in your browser to remember this choice for one year. I Agree, Deny
504