Professional Documents
Culture Documents
Sonam Assignment 1
Sonam Assignment 1
Truth Table:
2.) OR Gate: The output of an OR Gate is HIGH(1) when atleast one input is HIGH;
the output is LOW(0) only when both the inputs are low.
Boolean Expression: Y=A+B
Truth Table:
3.) NOT Gate: The Output of NOT Gate is opposite of the input. If the input is HIGH,
the output is LOW and vice versa.
Boolean Expression: Y=A’
Truth Table:
4.) NAND Gate: The output of NAND Gate is the opposite of AND Gate. It is low only
when both inputs are HIGH, otherwise the output is HIGH(1).
Boolean Expression: (A.B)’
Truth table:
5.) NOR Gate: The output of a NOR Gate is opposite of an OR gate. It is HIGH(1) only
when both inputs are LOW, otherwise output is LOW(0).
Boolean Expression: Y= (A+B)’
Truth Table:
6.) XOR Gate: The output of XOR Gate is HIGH(1) when the number of HIGH inputs
is odd, otherwise it is LOW(0).
Boolean Expression: Y=
Truth Table:
7.) XNOR Gate: The output of an XNOR gate is HIGH(1) when the umber of HIGH
inputs is even, otherwise the output is LOW(0).
Boolean Expression: Y=
Truth Table:
CODES:
SCHEMATIC DIAGRAM:
TEST BENCH CODE:
TESTBENCH OUTPUT:
RESULT:
Hence, Implementation of All gates Using Vivado is done.