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 *

By continuing to use the site, you agree to the use of cookies. You can read more about it the Cookies&Privacy Policy Section Above. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this. You can read more about it the Cookies&Privacy Policy Section.

Close