LOGIC GATES

• AND GATE: All the inputs of AND • OR GATE: One of the input of OR
gate will be 1 then output will be 1. gate will be 1 then output will be 1.

• Truth table: • Truth table:

• NOT GATE: Complement operator • NAND GATE: All the inputs of NAND
gate will be 1 then output will be 0.

• Truth table:
• Truth table:
• NOR GATE: : One of the input of • XOR GATE: If the odd number of 1’s
NOR gate will be 1 then output will be in the inputs of XOR gate output will
0. be 1 otherwise output will be 0.

• Truth table:
• XNOR GATE: If the odd number of 1’s in the inputs of XNOR
gate output will be 0 otherwise output will be 1.
Realization of logic gates using NAND:
Realization of logic gates using NOR:
Logic minimization using Theorems
De Morgan’s Theorems:
• HALF ADDER:
• FULL ADDER:
HALF SUBTRACTOR:
FULL SUBTRACTOR:
NAND NAND Realization

Procedure for NAND NAND Realization

• 1 : Simplify the given logical expression and then convert it in the SOP form.
• 2 : Draw the circuit for the expression using basic logic gates.
• 3 : Now replace every normal gates by the gates we made using only NAND gate.
• 4 : Draw the final circuit using only NAND gates.
• Eg: Draw Y ( m ) = A’B’ + B’C
NOR-NOR IMPLEMENTATION
• Example: Y=AC+BC+AB+D
• step1:express Boolean function is POS
form using duality theorem we get,
• Y’=(A’+C’)(B’+C’)(A’+B’)D’
• Step2: Implement Boolean Function
With OR-AND Logic
• Step3: Convert OR-AND Logic To NOR-NOR Logic:
• F = (X+Y) . (Y+Z) • F=AB+BC+CA
• F=A’B+B’C’+CA
• F=X’Y+XY+Z