Monday, May 6, 2013

And Gate

Truth Table
a b | f(a,b)
-------------
0 0 | 0
0 1 | 0
1 0 | 0
1 1 | 1

Boolean Expression
x*y

----------------------------------------
CHIP And
{
    IN a, b;
    OUT out;

    PARTS:
    Nand(a=a, b=b, out=out1);
    Not(in=out1, out=out);
}
----------------------------------------

Seeing as we started with the opposite of this gate the NAND and that we just created the NOT gate its as simple as taking the opposite(NOT) of the NAND gate.

2 comments:

  1. This comment has been removed by a blog administrator.

    ReplyDelete
    Replies
    1. I have gone through part of the course, but mostly just went through the book. What part are you struggling with?

      Delete