Established as per the Section 2(f) of the UGC Act, 1956

Approved by AICTE, COA and BCI, New Delhi

UNIT - II
Logic Gates, Boolean Algebra and
Logic Simplification
School of CSA

Prof. Krishnamurthy R

TOPICS TO BE COVERED

• Inverter
• AND Gate,
• OR gate,
• NAND Gate,
• NOR Gate,
• Exclusive-OR
• Exclusive-NOR Gates,
• Basics of Digital Integrated Circuits.
TOPICS TO BE COVERED

• Boolean Algebra and Logic • Simplification Using Boolean

simplification: Algebra,
• Boolean Operations and • Standard Forms of Boolean
Expressions, Expressions,
• Laws and Rules of Boolean • Boolean Expressions and Truth
Algebra, Tables,
• DE Morgan’s Theorems, • The Karnaugh Map,
• Boolean Analysis of Logic • SOP Minimization,
Circuits,
• POS Minimization

Logic Gates
LOGIC GATES

LOGIC GATES
LOGIC GATES

• Gates are blocks of hardware that produce signals of binary 1 or 0 when input
logic requirements are satisfied.

• Each gate has a distinct graphic symbol and its operation can be described by
means of an algebraic expression.

• The input-output relationship of the binary variables for each gate can be
represented in tabular form by a truth table.

AND GATE

• AND gate : The AND gate produces the AND logic function: that is, the output is 1
if input A and input B are both equal to 1; otherwise, the output is 0.

• The Truth Table shows that output x is 1 only when both input A and input B are 1.

• The algebraic operation symbol of the AND function is the same as the
multiplication symbol of ordinary arithmetic.
OR GATE

• The OR gate produces the inclusive-OR function, that is, the output is 1
if input A or input B or both inputs are I; otherwise, the output is 0.

• The algebraic symbol of the OR function is +, similar to arithmetic addition.

• OR gates may have more than two inputs, and by definition, the output is 1 if any
input is I.

INVERTER

• The inverter circuit inverts the logic sense of a binary signal.

• It produces the NOT, or complement, function.

• The algebraic symbol used for the logic complement is either a prime or a bar
over the variable symbol.
NAND GATE

The NAND function is the complement of the AND function, as indicated by the
graphic symbol, which consists of an AND graphic symbol followed by a small circle.

The designation NAND is derived from the abbreviation of NOT-AND.

NOR GATE

• The NOR gate is the complement of the OR gate and uses an OR graphic symbol
followed by a small circle.

• Both NAND and NOR gates may have more than two inputs, and the output is
always the complement of the AND or OR function, respectively.
EXCLUSIVE-OR GATE

• The exclusive-OR gate has a graphic symbol similar to the OR gate except
for the additional curved line on the input side.

• The output of this gate is 1 if any input is 1 but excludes the combination when
both inputs are 1.

EXCLUSIVE-NOR

• The exclusive-NOR is the complement of the exclusive-OR, as indicated by the

small circle in the graphic symbol.

• The output of this gate is 1 only if both inputs are equal to 1 or both inputs are
equal to 0.
BOOLEAN ALGEBRA

• Boolean algebra is an algebra that deals with binary variables and logic
operations.

• The variables are designated by letters such as A, B, x, and y.

• The three basic logic operations are AND, OR, and complement.

• A Boolean function can be expressed algebraically with binary variables, the logic
operation symbols, parentheses, and equal sign.

BOOLEAN ALGEBRA
BOOLEAN ALGEBRA

• For example, the Boolean function

F = x + y'z

• The function F is equal to 1 if x is 1 or if both y' and z are equal to 1; F is equal

• to 0 otherwise.

• The relationship between a function and its binary variables can be represented in
a truth table.

• To represent a function in a truth table we need a list of the 2' combinations of

then binary variables.

BOOLEAN ALGEBRA
Truth table for F = x + y’z.

• There are eight possible distinct combinations for

assigning bits to the three variables x, y, and z.

• The function F is equal to 1 for those combinations where

x = 1 or yz = 01

• It is equal to 0 for all other combinations.

BOOLEAN ALGEBRA
Logic diagram for F = x + y’z

• A Boolean function can be transformed from an algebraic expression into

a logic diagram composed of AND, OR, and inverter gates.

• The logic diagram for F is shown in the above diagram.

BOOLEAN ALGEBRA

The purpose of Boolean algebra is to facilitate the analysis and design of

digital circuits. It provides a convenient tool to:

1. Express in algebraic form a truth table relationship between binary

variables.

2. Express in algebraic form the input-output relationship of logic diagrams.

3. Find simpler circuits for the same function.

BOOLEAN ALGEBRA

The purpose of Boolean algebra is to facilitate the analysis and design of

digital circuits. It provides a convenient tool to:

1. Express in algebraic form a truth table relationship between binary

variables.

2. Express in algebraic form the input-output relationship of logic diagrams.

3. Find simpler circuits for the same function.

BASIC IDENTITIES OF BOOLEAN ALGEBRA

(1) x + 0 = x (2) x·O=O

(3) x +1= 1 (4) x ·1 =x
(5) x + x = x (6) x ·x = x
(7) x + x ' = 1 (8) x·x ' = 0
(9) (x)' ' = x (10) xy = yx
BASIC IDENTITIES OF BOOLEAN ALGEBRA

THEOREMS OF BOOLEAN ALGEBRA

Proofs of the theorems with one variable are presented below. At the right
is listed the number of the postulate which justifies that particular step of
the proof.

THEOREM 1(a): x + x = x.

Statement Justification

.
x + x = (x + x) 1 postulate 2(b)
= (x + x)(x + x) 5(a)
= x + xx 4(b)
=x+0 5(b)
=x 2(a)
THEOREMS OF BOOLEAN ALGEBRA

THEOREM 1(b): x . x = x.
Statement Justification

x . x = xx + 0 postulate 2(a)
= xx + xx 5(b)
= x(x + x) 4(a)

=x .1 5(a)
=x 2(b)

THEOREMS OF BOOLEAN ALGEBRA

THEOREM 6(a): x + xy = x.

Statement Justification

.
x + xy = x 1 + xy postulate 2(b)
= x(1 + y) 4(a)
= x(y + 1) 3(a)

=x .1 2(a)
=x 2(b)
DEMORGAN’S THEOREM

• DeMorgan' s theorem is very important in dealing with NOR and NAND

gates.
• It states that a NOR gate that performs the (X + Y) function is equivalent
to the function X . Y
• Similarly, a NAND function can be expressed by either X . Y function is equivalent
to the function x + y .

(X+Y) = X . Y and (X .Y) = X + Y

DEMORGAN’S THEOREM

DeMorgan’s Theorems are two additional simplification techniques that

can be used to simplify Boolean expressions. Again, the simpler the
Boolean expression the simpler the resulting the Boolean expression, the
simpler the resulting logic.
DEMORGAN’S THEOREM

PROOF:

DEMORGAN’S THEOREM

PROOF:
DEMORGAN’S THEOREM

Simplify the following Boolean expression and note the Boolean or Demaorgan's
theorem used at each step

BOOLEAN ANALYSIS OF LOGIC CIRCUITS

Boolean algebra is a useful tool for simplifying digital circuits.

Example:

Boolean function: F=X’YZ+X’YZ’+XZ

The expression is reduced to only two terms:

F = X’YZ + X’YZ’ + XZ
= X’Y(Z + Z’) + XZ
= X’Y . 1 + XZ
= X’Y + XZ
BOOLEAN ANALYSIS OF LOGIC CIRCUITS

SIMPLIFICATION USING BOOLEAN

ALGEBRA

Following examples use identities:

SIMPLIFICATION USING BOOLEAN
ALGEBRA

Following examples use identities:

SIMPLIFICATION USING BOOLEAN ALGEBRA

Following examples use identities:

STANDARD FORMS OF BOOLEAN EXPRESSIONS

• The standard forms facilitate the simplification procedure for

Boolean expressions.

• The standard forms contain ‘product terms’ and ‘sum terms’.

• Product term is XY’Z. This is logical product consisting of an AND

operation among three literals.

• Sum term is X+Y+Z’. This is logical sum consisting of an OR

operation among three literals.

MINTERMS AND MAXTERMS

A product term in which all the variables appear exactly once either
complemented or not complemented is called minterm.

Each minterm is a product term of exactly n literals, where n is the

number of variables. In this example, n = 3.
MINTERMS AND MAXTERMS

A sum term that contains all the variables in complemented or

uncomplemented form is called a maxterm.

It is possible to formulate 2n maxterms with n variables.

SOP-SUM OF PRODUCTS

• Sum of minterms is obtained from the truth table.

• The next step is to try to simplify the expression to reduce the
number of product terms and the number of literals in the terms.
• The result is a simplified expression in sum-of-products form.

Sum-of-Products Implementation
POS-PRODUCT OF SUMS

• This form is obtained by forming a logical product of sum terms.

• Each logical sum term may have any number of distinct literals.
• The gate structure of the product-of-sums expression consists of a
group of OR gates for the sum terms, followed by an AND gate.
• An example of a function expressed in product-of-sums form is:

Product-of-Sums Implementation

K-MAP (KARNAUGH MAP)

• The map is a diagram made up of squares, with each square

representing one row of a truth table, or correspondingly, one
minterm of a single output function.

• Boolean function can be expressed as a sum of minterms.

• It is recognized graphically in the map by those squares for which the

function has value 1.

• The map presents a visual diagram of all possible ways a function

may be expressed in a standard form.
K-MAP STRUCTURES

F(A,B) = ∑ m ( 0, 1, 2, 3 ) F(A,B,C) = ∑ m ( 0, 1, 2, 3, 4, 5, 6, 7 )

F(A,B,C,D)=∑ m (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12, 13,14,15)

TWO-VARIABLE MAPS

F(A,B)=∑ m (0, 1, 3)

F = A’ + B
THREE-VARIABLE MAPS

F(A,B,C)=∑ m (0, 1, 2, 3, 4, 5)

FOUR-VARIABLE K-MAP
F(A,B,C,D)=∑ m(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13)

F = C’ + A’D’ + B’D’
FOUR-VARIABLE K-MAP
F(A,B,C,D)=∑ m(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13)

F = C’ + A’D’ + B’D’