LOGIC GATES

Logic gate is an electronic circuit that performs a Boolean logical operation. A logic gate
has one or more inputs but only one output.

 The basic gates are AND gate, OR gate and NOT gate.
 The universal gates are NAND gate and NOR gate.
 The special gates are XOR and XNOR.

OR gate:

OR gate is a basic gate which has two or more input but only one output. The output is high if
any one of the input is high.
Input Output
A A B Y = A+B
Y = A+B 0 0 0
B
0 1 1
Logic symbol 1 0 1
1 1 1

Truth table

AND gate:

AND gate is a basic gate which has two or more input but only one output. The output is high if
all the inputs are high.
Input Output
A A B Y = AB
Y = AB
B 0 0 0
0 1 0
Logic symbol 1 0 0
1 1 1
Truth table

NOT gate:
It is a basic gate which complements the input signal value. It is also called as an inverter. It is a
logic gate with only one input and one output.
Input Output
A ̅ A Y=𝐀 ̅
Y=𝐀
0 1
Logic symbol 1 0
Truth table
NAND gate:
NAND gate is a universal gate which performs complement of AND logic. NAND gate has two or
more input but only one output. The output is high only when any of the input is low.

A Inputs Output
Y = ̅̅̅̅
𝐀𝐁 A B Y = ̅̅̅̅
𝐀𝐁
B
0 0 1
Logic symbol 0 1 1
1 0 1
1 1 0
Truth table
NOR gate:

NOR gate is a universal gate which performs complement of OR logic. NOR gate has two or
more input but only one output. The output is high if and only if all the inputs are low.

Inputs Output
A Y = ̅̅̅̅̅̅̅̅
𝐀+𝐁 A B Y = ̅̅̅̅̅̅̅
A+B
B 0 0 1
Logic symbol 0 1 0
1 0 0
1 1 0
Truth table

Exclusive OR (XOR) gate:

XOR gate is a special gate which has two or more input but only one output. The output is high
only when odd numbers of input are high.
XOR gate is also called as Inequality detector.
Y=A+B Inputs Output
A Or A B ̅+A
Y=AB ̅B
B ̅+𝐀
Y=A𝐁 ̅B 0 0 0
Logic symbol 0 1 1
1 0 1
1 1 0
Truth table

Realization of NOT, AND, OR and XOR gates using NAND gate.

The NAND gate as a NOT gate A ̅

Y=A

The NAND gate as an AND gate A

Y = A.B
B

A
The NAND gate as an OR gate Y = A+B
B

A ̅̅̅̅̅̅̅̅̅
A ̅̅̅̅
AB
̅̅̅̅
AB
The NAND gate as an XOR gate Y = A̅ B + A B
̅

B ̅̅̅̅̅̅̅̅̅
̅̅̅̅
B AB
Realization of NOT, AND, OR and XNOR gates using NOR gate.

The NOR gate as a NOT gate A ̅

Y=A

A
The NOR gate as a OR gate Y = A+B
B

A
The NOR gate as a AND gate Y = A.B
B

The NOR gate as a XNOR gate ̅B

Y = AB + A ̅

Simplification of Boolean expressions

Product term: The logical product of Boolean variables, complemented or uncomplemented form is a
product term.
Example: A B̅ C, A B C, A B C
̅ , A B, A
̅B̅ etc

Sum term: The logical sum of Boolean variables, complemented or uncomplemented form is a sum
term.
̅ + C), (A + B), ( A
Example: ( A + B ̅+B
̅ + C)

Sum of products (SOP): The logical sum of two or more logical product terms is known as sum of
products.
̅+C
Example: A B ̅ A+AB

Product of sum (POS): The logical product of two or more logical sum terms is known as product of
sum.
̅ ) (B + C) (A + B)
Example: (A + B

Canonical SOP (or) Standard SOP expression: The Boolean expression containing all the input
variables in each of the product term either in complemented or uncomplemented form is known as
canonical SOP expression.

Canonical POS (or) Standard POS expression: The Boolean expression containing all the input
variables in each of the sum term either in complemented or uncomplemented form is known as
canonical POS expression.