IEC121 Digital Design and Electric Circuits L-T-P-C: 3-1-2-5
IEC121 Digital Design and Electric Circuits L-T-P-C: 3-1-2-5
L-T-P-C: 3-1-2-5
1
Course Objectives
• To provide the student with the fundamental concepts and skills
necessary to analyse and design combinational and sequential logic
circuits.
• To illustrate simplification of Algebraic equations using Karnaugh
Maps and Quine Mc-Clusky Techniques
• To design Decoders, Encoders, Digital Multiplexers, Adders,
Subtractors and Binary Comparators.
• To describe Latches and Flip-flops, Registers and Counters.
• To develop state diagrams of Synchronous Sequential Circuits.
2
Course Outcomes
After studying this course, students will be able to:
• Explain the concept of combinational and sequential logic
circuits.
• Design combinational logic circuits.
• Design sequential circuits using SR, JK, D, T flip-flops
• Develop applications of Combinational & Sequential Circuits.
3
Evaluation Pattern
✓Mid Sem Exam – 20 marks
✓Quizzes – 20 marks
✓Assignment – 20 marks
✓End Sem Exam – 40 marks
✓Lab Internal – 15 Marks
✓Lab Viva – 5 Marks
✓Lab End Sem Exam – 10 Marks
4
Syllabus
• Review of Number Systems - Number systems and conversions-
decimal, binary, 1’s and 2’s complements, hexadecimal, octal etc.
Logic gates NOT, AND, OR, XOR, XNOR, Universal gates, timing
diagrams.
• Boolean algebra: De-Morgans theorems, SOP and POS forms.
Karnaugh Maps-to simplify Boolean expressions, truth table functions.
Combinational Logic-Analyse basic combinational logic circuits,
design a combinational logic circuits for a given truth table. Functions
of Combinational logic comparators, adders, code converters,
multiplexers, de-multiplexers.
5
Syllabus Contd.
• Sequential Circuit Design - Flip-Flops and Latches. SR, D, and JK
Flip-Flops. Edge triggered and Master-Slave Flip-Flops, Excitation
table.
• Counters – Design of asynchronous and synchronous counters. Timing
diagrams up/down counters. Shift Registers – data movements in shift
registers. SISO, SIPO, PISO, PIPO shift registers.
• Memory and programmable logic – RAM, Memory decoding, ROM,
PLA, PAL, sequential programmable devices.
6
Textbook/References
1. Floyd, “Digital Fundamentals”, McGraw Hill, Tenth Edition,
2011.
2. Morris Mano, “Digital Circuits and Logic Design”, PHI
Publication, Fifth Edition, 2015.
3. Donald D. Givone, “Digital Principles and Design”, McGraw
Hill, 2002.
4. Charles H Roth Jr., Larry L. Kinney, “Fundamentals of Logic
Design”, Cengage Learning, 7th Edition.
5. Stephen Brown, Zvonko Vranesic, “Fundamentals of Digital
logic with Verilog Design”, Tata McGraw Hill Publishing
Company Limited, Special Indian Edition.
7
Why Digital?
• This course is about digital circuits also known as logic circuits that
make the computer.
• A logic circuit is a circuit in which the signals are constrained to have
only some number of discrete values.
• Logic circuits are used to build hardware for computer, smart phones,
smart TVs and other types of products.
• These products are broadly classified as digital hardware.
• The name digital derives from the fact that, the information in the
form of electronic signals in these devices are represented as digits.
8
Analog vs. Digital Signals
• Analog vs. Digital: Continuous vs. discrete.
3
Logic 1
2
Un-define
1
Logic 0
0
10
Digital Systems - Advantages
• Noise immunity
• Power of abstraction
• Digital signals are processed by digital gates (AND, OR, NOT,
NAND, NOR etc.)
• Modular designs possible
• Knowledge of Internal circuit implementation is unimportant
• Faster design completion
• Ease of automation through software (Electronic Design of
Automation (EDA) tools)
11
Contd.
• Programmability
• The hardware can be used for various tasks by a software
• Miniaturization
• As the size of transistor is getting smaller, more of them can be
built on a chip leading to smarter systems on smaller chips
12
Digital Systems - Design Hierarchy
• System level - Register level - Gate level - Transistor and physical
design level
• System level: Black box specification.
• Register level: Collection of registers.
Input Input
Adder
Compute the sum of
a sequence of
input numbers
Clear
Register A
Store
Total Total
G4
Inputs Combinational Outputs
x1
logic
x3 G2 G6 f(x1, x2, x3, x4, x5) network
x4
G5
x2 Memory
G3
x3
14
Binary Logic – Variables and Functions
• Logic circuits with only 2 logic values is called as binary logic
circuit.
• The simplest binary element is a switch having 2 states.
• If a given switch is controlled by an input variable x,
• then we can say that the switch is open if x = 0 and closed if x = 1
15
Contd.
• The current flows when the switch is closed, that is, when x = 1.
• The input that causes changes in the behaviour of the circuit is the switch control x.
• The output is defined as the state (or condition) of the light (denoted by L).
• If the light is ON => L = 1. If the light is OFF => L = 0.
• Since L = 1 if x = 1 and L = 0 if x = 0,
• we can say that L(x) = x
• This simple logic expression describes the output as a function of the input.
• We can say that L(x) = x is a logic function and that x is an input variable.
16
Binary Logic – Series/Parallel
• Using a series connection, the light will be turned on only if both switches are
closed.
• This behaviour can be described by the expression,
L(x1, x2) = x1 · x2 = x1x2
where L = 1 if x1 = 1 and x2 = 1, L = 0 otherwise.
• The “·” symbol is called the AND operator
• The circuit in figure is said to implement a logical AND function.
17
Contd.
• In this case the light will be on if either the x1 or x2 switch is closed or if both
switches are closed.
• The light will be off only if both switches are open.
• This behaviour can be stated as,
L(x1, x2) = x1 + x2
where L = 1 if x1 = 1 or x2 = 1 or if x1 = x2 = 1, L = 0 if x1 = x2 = 0.
• The + symbol is called the OR operator, and the circuit implements a logical OR
function.
• Note: The use of the + symbol is different from its arithmetic addition meaning.
18
Series & Parallel
• The AND and OR functions along with other simple functions can be used to build all
logic circuits.
• This series-parallel connection of switches realizes the logic function
L(x1, x2, x3) = (x1 + x2) · x3 = (x1 + x2) x3
• The light is on if x3 = 1 and, at the same time, at least one of the x1 or x2 inputs is
equal to 1.
19
NOT operation
• Here, closed switch will short-circuit the light and prevent the current from
flowing through it.
• The light will be turned on when the switch is opened.
• Formally, we express this functional behaviour as,
L(x) = 𝒙′ = 𝒙 ഥ = ! 𝒙 = ~𝒙 = 𝑵𝑶𝑻 𝒙
where L = 1 if x = 0, and L = 0 if x = 1
• Instead of using the word inverse, it is more common to use the term
complement. It is also called as the NOT operation.
• Ex., if f (x1, x2) = x1 + x2
ҧ 1, x2) = 𝑥1 + 𝑥2
then the complement of f is: 𝑓(x 20
Truth Tables and Logic gates
• AND, OR and NOT operations can also be defined in the form of a table called as a truth
table
• x and y are i/p variables and z is o/p variable.
• The rows below x & y have all the possible combinations of logic values or ‘valuations’
AND OR NOT
x y z x y z x z
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1
z=x•y=xy z=x+y z = x = x’
x x x
y z y z z
Timing Diagram
• The time runs from left to right, and each input valuation is held for
some fixed duration.
• Such timing diagrams are useful for indicating the functional
behaviour of logic circuits.
24