Logic Gates

Boolean algebra varies from ordinary algebra in the sense, the variable or literals can
have the value of either 0 or 1 only. Boolean variables are often used to represent voltage
level present on a wire at input/output terminal of a circuit.

A Boolean variable actually represent the state of an input/output which is called Logic
Level. A voltage in a digital circuit is said to be at logic level 0 or logic level 1, depends
on whether it is 0V or 5V. Several other terms are used for the same like LOW, OFF,
FALSE for 0 and HIGH, ON, TRUE for level 1.

Logic Operations and Gates

Since there are only two values, Boolean algebra is relatively simpler. There are three
basic functions in Boolean algebra: AND, OR and NOT.

They are called Logic Operations and corresponding digitals circuits which implement
these operations are called Logic Gates. Logic Gates are digital circuits constructed using
diodes, transistors and resistors in such a way that their output is the result of a basic
logic operation.

Truth Tables

A Truth table is the means for describing how a logic circuit’s output depends on the
different combinations of logic levels present at its input.

The Logic Gates and their details are listed in the form of table below:

Name Symbol Expression Truth Table

A C
A B C
AND B C=A
B 0 0 0
0 1 0
1 0 0
1 1 1
 A A B C
C C=A+B
B 0 0 0
OR
0 1 1
1 0 1
1 1 1

_
A A
A ~A
___
NOT C= A 0 1

1 0

A
C C=A•B A B C
B
NAND 0 0 1
0 1 1
1 0 1
1 1 0

A C=A+B A B C
C
NOR B 0 0 1
0 1 0
1 0 0
1 1 0

NAND and NOR Gates are called Universal Gates. Any basic gate or any logic circuit
can be implemented using these gates alone. Hence, they are called Universal Gates.

There is one complex gate called EXOR Gate. The logic diagram, its expression and
Truth table is given below:

Logic diagram:
 A
C
B

Expression: C = A ⊕ B or it can be written as C = AB + AB

Truth Table:

A B C
0 0 0
0 1 1
1 0 1
1 1 0

A B C

Laws of Boolean Algebra

Identity law: A + 0 = A and A • 1 = A

Zero and One laws: A + 1 = 1 and A • 0 = 0
Inverse Laws: A + A = 1 and A • A = 0
Commutative laws: A + B = B+A and A • B = B • A

Associative laws: A + (B + C) = (A + B) + C

A • (B • C) = (A • B) • C

Distributive laws: A • (B + C) = (A • B) + (A • C)

A + (B • C) = (A + B) • (A + C)

_____ __ __
De Morgan’s laws: (A + B) = (A) • (B)
_____ __ __
(A • B) = (A) + (B)