DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING
DIGITAL SYSTEM DESIGN USING VERILOG
BEC302
III SEMESTER
MODULE 1 NOTES
Prepared by,
Mrs. MEGHANA M N
Assistant Professor
Dept. of ECE
MIT Thandavapura
A Unit of Maharaja Education Trust®
MAHARAJA INSTITUTE OF TECHNOLOGY
THANDAVAPURA
NH 766, Nanjangud Taluk, Mysuru- 571 302
(An ISO 9001:2015 and ISO 21001:2018 Certified Institution)
(Affiliated to VTU, Belagavi and approved by AICTE, New Delhi)
DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING
MODULE 1 CONTENTS
Principles of Combinational Logic
Definition of combinational logic
Canonical forms
Generation of switching equations from truth tables
Karnaugh maps-up to 4 variables
Quine-McCluskey Minimization Technique
Quine-McCluskey using Don’t Care Terms (Section 3.1 to 3.5 of Text1)
Text Book 1: Digital Logic Applications and Design by John MYarbrough, Thomson Learning,2001.
MODULE 1 - DEFINITIONS
Combinational logic circuit: Combinational Logic Circuit is a type of digital logic circuit without
feedback where the output value depends only on present input values. It is a memory less circuit.
Ex: Adder, subtractor, decoder, encoder, multiplexer and comparator.
Truth table: A truth table is a tabular representation of all the combinations of values for inputs and
their corresponding outputs. It is a mathematical table that shows all possible output that would occur
from all possible input combination.
Ex:
Inputs Output
A B Y=A.B
0 0 0
0 1 0
1 0 0
1 1 1
Literals: A literal is a Boolean variable or its complement.
Ex: X and X is a literal
Product term: A product term is a literal or logical product (AND) of multiple literals.
Ex: X, X Y and X YZ
Sum term: A sum term is a literal or logical sum (OR) of multiple literals.
Ex: X, X +Y and X +Y + Z
Sum of product (SOP): A Sum of Products is the logical OR of multiple product (AND) terms.
Ex: XY + X YZ is an SOP equation
Product of Sum (POS): A Product of Sum is the logical AND of multiple sum (OR) terms.
Ex: ( X +Y ) (X +Y + Z) is an POS equation
Minterm: A minterm is a special case of product (AND) term than contains all of the input available
that make up a Boolean expression.
Ex: a b c and abc are a minterms
Maxterm: A maxterm is a special case of sum (OR) term than contains all of the input available that
make up a Boolean expression.
Ex:a+ b+c and a+b+c are a maxterms
Canonical form: Canonical means conforming to a general rule. The rule for switching logic is that
each term used in a switching equation must contain all of the available input variables.
Canonical Sum of Product: A canonical Sum of Product is a complete set of minterms that defines
when an output variable is logical 1.
Ex: X =f ( a ,b , c )=a b c +abc
Canonical Product of Sum: A canonical Product of Sum is a complete set of maxterms that defines
when an output variable is logical 0.
Ex: X =f ( a ,b , c )=(a+ b+c )(a+ b+c )
Karnaugh maps (K-Map): Karnaugh map is a matrix of squares. Each square represents a minterm or
maxterm from a Boolean equation.
Ex:
Prime Implicant (PI): A prime implicant is a group of minterms that cannot be combined with any
other minterms or groups.
Essential Prime Implicant (EPI): An Essential Prime Implicant is a prime implicant in which one or
more minterms are unique.
Incompletely specified terms / Don’t care term / Unknown variable: When an output value is not
known for every combination of input variables it is said to be Incompletely specified terms.
Completely specified terms: When an output value is known for every combination of input variables
it is said to be Completely specified terms.
