Digital Circuits

Dr. Anup Vibhute

Professor, DYPIT, Pimpri
Contents:
• Syllabus_ Unit _II
• Combinational Circuits
• Boolean Functions & their representation
• SOP
• POS
• SOP & POS- standard & Canonical
Syllabus:
• Unit II Combinational Logic Design (08 Hrs)
Definition of combinational logic, canonical forms, Standard representations for
logic functions, k-map representation of logic functions (SOP and POS forms),
minimization of logical functions for min-terms and max-terms (upto 4 variables),
don‟t care conditions, Design Examples: Arithmetic Circuits, BCD to 7 segment
decoder, Code converters. Introduction to Quine- McCluskey method, Quine
McCluskey using don‟t care terms, Reduced prime implicants Tables.
 Text Books & References:
• Text Books:
T1. R.P. Jain, “Modern Digital Electronics”, Tata McGraw Hill Publication, 3rd Edition.
T2. Thomas Floyd, “Digital Electronics”, 11th Edition.
T3. M. Morris Mano, “Digital Logic and Computer Design”, Prentice Hall of India, 4th Edition.
T4. Taub and Schilling, “Digital Principles and Applications,” TMH.
• Reference Books:
R1. Anand Kumar, “Fundamentals of Digital Circuits”, Prentice Hall of India, 1st Edition.
R2. J. F. Wakerly, “Digital Design- Principles and Practices,”, Pearson, 3rd Edition.
R3. M. M. Mano, “Digital Design,” Prentice Hall India.
• Other Books:
O1: A. K. Maini, “Digital Electronics- Principles, Devices and Applications”, John wiley & Sons, 2007.
O2: Parag. K Lala, “Principles Of Modern Digital Design”, John wiley & Sons, 2007
Course Outcomes: (COs)
• After successfully completing the Unit students will be able to:

• CO2: Apply basic logic gates and various reduction techniques for building
digital logic circuits.
•CO2.1: Reduce the logic function using various techniques like K-map.

•CO2.2: Build the logic functions for different coders.

Combinational Circuits:
• A combinational circuit is one where the output at any time depends only on the
present combination of inputs at that point of time with total disregard for the past
state of the inputs
• The logic gate is the most basic building block of combinational logic.
• The logical function performed by a combinational circuit is fully defined by a set
of Boolean expressions.
• A combinational circuit consists of input variables, logic gates, and output
variables
Combinational Circuits:
• Boolean Algebra:
• Boolean algebra is mathematics of logic.
• It is one of the most basic tools available to the logic designer that can be
effectively used for simplification of complex logic expressions.
• Design requirement of combinational circuits may be specified using one of the
following methods.
• A set of statements
• Boolean expression or
• Truth table.
• The aim of the design to build circuit using gates.
• The Boolean expressions can be simplified using standard methods and simplified
expression is realized using gates.
Combinational Circuits:
• Boolean Algebra:
• The following methods can be used to simplify the Boolean expressions.
• Algebraic method
• Karnaugh Map Technique (K-Map)
• Quine Mc-Cluskey Minimization
• Variable Entered Mapping (VEM) Technique
• The primary objective of all simplification procedures is to obtain an expression
that has the minimum number of terms.
• Secondary objective is to obtain an expression with the minimum number of
literals (Variables).
Combinational Circuits:
• Boolean Functions and their representation
• A logic function of ‘n’ Boolean variables denoted by f(x1, x2, ... xn) is another
variable of algebra and takes one of the two possible values, 0 and 1.
• Any Arbitrary logic function can be expressed in the following forms
• Sum of Products (SOP)
• Product of Sum (POS)
• These two forms are suited in arriving at standard methods for designing logic
circuits
Combinational Circuits:
• Sum-of-Products (SOP):
• A sum-of-products expression contains the sum of different terms, with each term
being either a single literal or a product of more than one literal/variable
• A product term which contains all the variables of the function either in
complemented or uncomplemented form is called a minterm.
• It can be obtained from the truth table directly by considering those input
combinations that produce a logic ‘1’ at the output
• A sum-of-products expression is also known as a minterm expression.
• SOP is also called the Disjunctive Normal Form (DNF).
• It is represented as
• F(A,B,C)=Y=
Combinational Circuits:
• Standard Sum-of-Products (SOP):
• This form is also called Disjunctive Canonical Form (DCF).
• It is also called the Expanded Sum of Products Form or Canonical Sum-of-
Products Form.
• In this form, the function is the sum of a number of product terms where each
product term contains all the variables of the function either in complemented or
uncomplemented form.

• The function is denoted with ∑ symbol with decimal equivalent of terms enclosed.
For example the above function is also written as
• f(A,B,C)=∑ m(1,2,3,5)
Combinational Circuits:
• Product of Sums (POS):
• A product-of-sums expression contains the product of different terms, with each
term being either a single literal or a sum of more than one literal/variable.
• It can be obtained from the truth table by considering those input combinations
that produce a logic ‘0’ at the output
• Each such input combination gives a sum term, and the product of all such terms
gives the expression.
• The function of above equation may also be written in the form shown in equation
below

• This form is also called the Conjunctive Normal Form (CNF).

Combinational Circuits:
• Standard Product of Sums (POS):
• This form is also called Conjunctive Canonical Form (CCF).
• It is also called Expanded Product-of-Sums Form or Canonical Product-of-Sums
Form.
• This is derived by considering the combinations for which f = 0.
• Each term is a sum of all the variables.
• The function POS can be written in standard POS or
canonical form as

• The function is denoted with ∏ symbol with decimal equivalent of terms

enclosed. For the function is also written as
• f(A,B,C) = ∏ M(1,2,3,5) or M1,M2,M3,M5
Identify the form of following Boolean equations
Convert Following into standard Format or Canonical
Format
Expand A + BC + ABD + ABCD to minterms and maxterms.
Expand A + BC + ABD + ABCD to minterms and maxterms.