UNIT-II-Logic Gates & Boolean Algebra and

Combinational Circuits

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 1
CIRCUITS
Logic gates - OR- AND- NOT- NAND- NOR- XOR- XNOR- Boolean Algebra -
Laws- Rules- De-Morgan’s theorems- Boolean expressions-SOP-POS- Simple
expressions to simplify. Half adder- Full adder- Encoder- Decimal-to-BCD
encoder- Decoders- BCD-to-Seven Segment Decoder- Multiplexer- 4:1 mux and
De Multiplexer- 1:4 Demux.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 2
CIRCUITS
Logic gates

▪ Logic gates are the digital circuits capable of performing a particular logic function by
operating on a number of binary inputs.

(or)
▪ Logic gates are the basic building blocks of any digital circuit.

Logic gates are the basic building blocks of any digital system. It is an electronic circuit having
one or more than one input and only one output. The relationship between the input and the
output is based on a certain logic. Based on this, logic gates are named as AND gate, OR gate,
NOT gate etc.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 3
CIRCUITS
Types of Logic Gates

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 4
CIRCUITS
 Basic Logic Gates
A B Y = A.B
Basic Logic Gates are the fundamental logic gates using which
universal logic gates and other logic gates are constructed. 0 0 0
0 1 0
1 0 0
There are following three basic logic gates-
1.AND Gate 1 1 1
2.OR Gate
3.NOT Gate

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 5
CIRCUITS
OR Gate

A B Y=A+B
0 0 0
0 1 1
1 0 1
1 1 1

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 6
CIRCUITS
 NOT Gate
•The output of NOT gate is high (‘1’) if its input is low (‘0’).
•The output of NOT gate is low (‘0’) if its input is high (‘1’).

•It is clear that NOT gate simply inverts the given input.
•Since NOT gate simply inverts the given input, therefore it is also known as Inverter Gate.

A Y = A’
0 1
1 0

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 7
CIRCUITS
Universal Logic Gates
Universal logic gates are the logic gates that are capable of implementing any Boolean
function without requiring any other type of gate.
They are called as “Universal Gates” because-
They can realize all the binary operations.
All the basic logic gates can be derived from them.

They have the following properties-

Universal gates are not associative in nature.
Universal gates are commutative in nature.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 8
CIRCUITS
 Truth Table-

A B Y = (A.B)’
0 0 1
0 1 1
Timing Diagram- 1 0 1
1 1 0

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 9
CIRCUITS
NOR Gate-

Timing Diagram-

A B Y=A+B
0 0 1
0 1 0
1 0 0
1 1 0

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 10
CIRCUITS
 Alternative Logic Gates

Alternative logic gate is an alternate logic gate

that produces the same output as the original
logic gate and can be used during the
unavailability of the original logic gate to serve
the same purpose.

Alternative logic gates are also called

as Alternate Gates.
Alternative logic gates are also called as Bubbled
Gates since they contain bubbles in them.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 11
CIRCUITS
 Boolean Algebra
• Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It
uses only the binary numbers i.e. 0 and 1.
• It is also called as Binary Algebra or logical Algebra
Rule in Boolean Algebra:

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 12
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 13
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 14
CIRCUITS
 DeMorgan’s Theorem

DeMorgan´s Theorem and Laws can

be used to to find the equivalency of
the NAND and NOR gates

Logic
Boolean Notation
Function

AND A.B

OR A+B

NOT A

NAND A .B

NOR A+B
LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 15
CIRCUITS
 Theorem 1- De Morgan has suggested two theorems which are
extremely useful in Boolean Algebra. The two theorems are discussed
below.

Table showing verification of the De Morgan's first

theorem −

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 16
CIRCUITS
Theorem 2

•The LHS of this theorem represents a NOR gate with

inputs A and B, whereas the RHS represents an AND gate
with inverted inputs.
•This AND gate is called as Bubbled AND.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 17
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 18
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 19
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 20
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 21
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 22
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 23
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 24
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 25
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 26
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 27
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 28
CIRCUITS
 Sum of Products (SOP) – Product of Sums (POS) -
Minterm – Maxterm
• Sum of product form (Sop)
✓ The representations of the OR and AND functions by + and. (addition and
Multiplication).
• Example

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 29
CIRCUITS
Product of Sum form (Pos)
✓ The representations of the AND and OR functions
• Example

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 30
CIRCUITS
• Standard Sop (or) minterm canonical form
✓ If each minterm in Sop form contains all the literals then the Sop form is know as
standard (or) canonical.Sop form each individual term in the standard sop form is called
minterm.
• Standard Pos (or) maxterm canonical form
✓ If each term in pos form contains all the literals then the pos form is know as standard
(or) canonical pos from. Each individual term in the standard pos form is called
maxterm.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 31
CIRCUITS
• Converting expression in standard sop (or) pos forms

Step 1: find the missing literal in each product term if any

Step 2: And each product term having missing literal/s. with term/s
Step 3: Expand the term by applying distributive law and recorder the literals in the product
terms.
Step 4: Reduce the expression by omitting repeated terms if any. [A + A = A]

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 32
CIRCUITS
1) Convert the given expression in standard sop form.
f (A, B, C) = AC + AB +BC
Solution
Step 1: find the missing literal in each product term

Step 2: AND product term with (missing literal + its complement)

Step 3: Expand and Reorder

Step 4: Omit repeated product terms

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 33
CIRCUITS
 2) Convert the given expression in standard sop form

f (A, B, C) = A + ABC
Solution
find the missing literal in each product term
Step 2: AND product term with (missing literal + its complement)

Step 3: Expend the terms and re order literals

Step 4: Omit repeated product term

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 34
CIRCUITS
Convert the given expression in standard pos form
f (A, B, C) = (A + B) (B + C) (A + C)
Solution
Step 1: find the missing literal in each sum term

Step 2: OR sum with (missing literal its complement)

Step
• 3: Expand the term and reorder literals

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 35
CIRCUITS
 Minterms and Maxterms

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 36
CIRCUITS
 Digital Circuits - K-Map Method

• Karnaugh introduced a method for simplification of Boolean functions

in an easy way.
• This method is known as Karnaugh map method or K-map method.
• It is a graphical method, which consists of 2n cells for ‘n’ variables.
• The adjacent cells are differed only in single bit position.
• The Karnaugh map reduces the need for extensive calculations by taking advantage of humans pattern-
recognition capability.
• It also permits the rapid identification and elimination of potential race conditions

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 37
CIRCUITS
✓ 2 Variable K map

✓ 3 Variable K map

✓ 4 Variable K map

✓ 5 Variable K map

✓ 6 Variable K map

For the above Types both SOP and POS with or without don’t care can be
Simplified easily.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 38
CIRCUITS
 K-Maps for 2 to 5 Variables
• 2 Variable K-Map
• The number of cells in 2 variable K-map is four, since the number of variables is
two. The following figure shows 2 variable K-Map.

•There is only one possibility of grouping 4 adjacent min terms.

•The possible combinations of grouping 2 adjacent min terms are {(m0, m1), (m2, m3),
(m0, m2) and (m1, m3)}.
LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 39
CIRCUITS
 3 Variable K-Map
• The number of cells in 3 variable K-map is eight, since the number of variables is
three. The following figure shows 3 variable K-Map.

•There is only one possibility of grouping 8 adjacent min terms.

•The possible combinations of grouping 4 adjacent min terms are {(m0, m1, m3, m2), (m4, m5, m7, m6), (m0,
m1, m4, m5), (m1, m3, m5, m7), (m3, m2, m7, m6) and (m2, m0, m6, m4)}.
•The possible combinations of grouping 2 adjacent min terms are {(m0, m1), (m1, m3), (m3, m2), (m2, m0),
(m4, m5), (m5, m7), (m7, m6), (m6, m4), (m0, m4), (m1, m5), (m3, m7) and (m2, m6)}.
•If x=0, then 3 variable K-map becomes 2 variable K-map.
LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 40
CIRCUITS
✓ The sequence of numbers across the top of the map.
✓ It is not in binary sequence which would be 00, 01,
10, 11. It is 00, 01, 11 10, which is Gray code
sequence.
✓ Gray code sequence only changes one binary bit as
we go from one number to the next in the sequence,
unlike binary.
✓ That means that adjacent cells will only vary by one
bit, or Boolean variable.
✓ Moreover, the column and row headings must be in
Gray code order, or the map will not work as a
Karnaugh map.
✓ Adjacent cells vary by only one bit because a Gray
code sequence varies by only one bit.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 41
CIRCUITS
EXAMPLES:

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 42
CIRCUITS
 4- Variable K-Map
• The number of cells in 4 variable K-map is sixteen, since the number of variables
is four. The following figure shows 4 variable K-Map.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 43
CIRCUITS
 5- Variable K-Map
• The number of cells in 5 variable K-map is thirty-two, since the number of
variables is 5. The following figure shows 5 variable K-Map.

•There is only one possibility of grouping 32 adjacent min terms.

•There are two possibilities of grouping 16 adjacent min terms. i.e., grouping of min terms from m0 to m15 and m16 to m31.
•If v=0, then 5 variable K-map becomes 4 variable K-map.

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 44
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 45
CIRCUITS
Minterm Solution of K Map
The following are the steps to obtain simplified minterm solution using K-map.
Step 1: Initiate
Express the given expression in its canonical form
Step 2: Populate the K-map
Enter the value of ‘one’ for each product-term into the K-map cell, while filling
others with zeros.
Step 3: Form Groups

LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL

11/19/2021 46
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 47
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 48
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 49
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 50
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 51
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 52
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 53
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 54
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 55
CIRCUITS
 LOGIC GATES & BOOLEAN ALGEBRA AND COMBINATIONAL
11/19/2021 56
CIRCUITS