Digital System Design

Lecture # 3
Introduction to Logic Circuits

ENGR. DR. MUHAMMAD AQEEL ASLAM

ASSISTANT PROFESSOR
SCHOOL OF ENGINEERING AND APPLIED SCIENCES
ELECTRICAL ENGINEERING DEPARTMENT
GIFT UNIVERSITY
GUJRANWALA
 2
Learning Objectives

 Review the basic concepts of logic circuits

 Variablesand functions
 Boolean algebra
 Minterms and maxterms
 Logic gates
 Synthesis

 Create CMOS logic gates

 3
Binary Switch
 4
Light Control by Switch
 5
Basic Functions
 6
Series-Parallel Connection
 7
Inverting Circuit
 8
Truth Table

x1 x2 x1.x2 x1+x2
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 1
 9
Gates
 10
Gates
 11
Basic Logic Gates
 12
Logic Network

 Write the Boolean function for the following circuit.

13
 14
DeMorgan Theorem
 15
Basic Gates - XOR
 16
Basic Gates - XNOR
 17
Variables and Functions

 A function is defined as the dependency

of output y on the n inputs (x1,x2,x3,…,xn)
 The n inputs are variables
 The function of a combinational logic
circuit can be expressed by a Boolean
Logic Function.
 For a Boolean logic function, output and
inputs re binary and the basic operators
include AND, OR, NOT.
 18
Basic Functions

 Summary of basic logic functions

 Inversion, AND, OR
 Can be used to implement logic function of any complexity

 Draw the truth table of Inversion, AND, OR functions for

three variables.
 19
Logic Gates

 The basic logic function (operation) can be implemented

electronically with transistors, which is called a logic gate.
 A logic gate has one or more inputs and one output
 The schematics are listed below
 20
Truth Table
 21
Karnaugh Map
 22
Karnaugh Map
 23
Boolean Algebra

 Axioms of Boolean Algebra

 0•0 = 0, 0•1 = 0, 1•0 = 0, 1•1= 1
 0+0 = 0, 0+1 = 1, 1+0 = 1, 1+1= 1
 If x = 0, then x’ = 1, if x = 1, then x’ = 0
 Single – Variables Theorem
 X•0=0, X•1=X, X+0=X, X+1=X, X+X’ = 1, X•X’ = 0
 Multiple - Variables Properties
 Commutative, Associative, Distributive, Absorption, Combining, De-
Morgan Theorem
 24
Properties

 Commutative x.y=y.x
 Associative x + (y + z) = (x + y) + z
 Distributive x . (y + z) = x . y + x . Z
 Absorption x+x.y=x
 Combining x . y + x . y’ = x
 DeMorgan Theorem (x . y)’ = x’ + y’
 25
Synthesis using Logic Gates

 Synthesis: begin with a description of the desired behavior and then

generate a circuit desired behavior, and then generate a circuit that
realizes this behavior.
 Example of synthesis
 26
Sum-of-Products

 Minterm: any function can be expressed as the sum of some minterms some
minterms.
 For a function of n variables, a product term in which each of the n variables appears
once
 Variables either in uncomplemented or complemented form
 For a given row of a truth table, Values of X and X’
 Maxterm: any function can be expressed as the product of some maxterms.
 For a function of n variables, a sum term in which each of the n variables appears once
 Variables either in uncomplemented or complemented form
 For a given row of a truth table, Values of X and X’
 27
Three-variable minterms and maxterms
 28
Sum-of-Products, Product-of-sums
 29
Design Examples

 Three Way Light Control

 Assume that a large room has three doors and that a switch near each
door controls a light in the room. It has to be possible to turn the light on
or off by changing the state of any one of the switches.
 30
Multiplexer Circuit
 31
Implementation of Multiplexer Circuit
 32
Implementation of Multiplexer Circuit

 From the truth table, we derive the canonical sum of products

 Using the distributive property, this expression can be written as

 33
Implementation of Multiplexer Circuit