Ift211 Digital Logic Design-1
Ift211 Digital Logic Design-1
Faculty of Computing
Federal University of Lafia
Nasarawa State – Nigeria.
UNIT -II:
Minimization Techniques:
Introduction, The minimization with theorems, The Karnaugh Map Method, Three, Four and Five
variable K- Maps, Prime and Essential Implications, Don’t Care Map Entries, Using the Maps for
Simplifying, Quine-McCluskey Method, Multilevel NAND/NOR realizations.
UNIT -III:
Combinational Circuits:
Design Procedure – Half Adder, Full Adder, Half Subtractors, Full Subtractors, Parallel Binary Adder,
Parallel binary subtractors, Binary Multiplier, Multiplexers/DeMultiplexers, decoder, Encoder, Code
Converters, Magnitude Comparator. Classification of sequential circuits, the binary cell, The S-R-
Latch Flip-Flop, the D-Latch Flip-Flop, the “Clocked T” Flip-Flop, the “Clocked J-K” Flip-Flop, Design
of a Clocked Flip-Flop, Timing and Triggering Consideration.
UNIT -IV:
Sequential Circuits:
Introduction, Basic Architectural Distinctions between Combinational and Sequential circuits,
Latches, Flip-Flops, SR,JK,D,T and Master slave, characteristic Tables and equations, Conversion
from one type of Flip-Flop to another, Counters - Design of Single Mode Counter, Ripple Counter,
Ring Counter, Shift Register, Ring counter using Shift Register
UNIT -V:
Memory Devices:
Classification of memories – ROM: ROM organization, PROM, EPROM, EEPROM, RAM: RAM
organization, Write operation, Read operation, Static RAM, Programmable Logic Devices:
Programmable Logic Array (PLA), Programmable Array Logic, Implementation of Combinational
Logic circuits using ROM, PLA, PAL.
TEXT BOOKS:
1. Digital Design- Morris Mano, PHI, 3rd Edition.
2. Switching Theory and Logic Design-A. Anand Kumar, PHI, 2nd Edition.
3. Switching and Finite Automata Theory- Zvi Kohavi & Niraj K. Jha, 3rd Edition,
Cambridge.
REFERENCE BOOKS:
1. Introduction to Switching Theory and Logic Design – Fredriac J. Hill, Gerald R. Peterson, 3rd
Ed,John Wiley & Sons Inc.
2. Digital Fundamentals – A Systems Approach – Thomas L. Floyd, Pearson, 2013.
3. Switching Theory and Logic Design – Bhanu Bhaskara –Tata McGraw Hill Publication, 2012
4. Fundamentals of Logic Design- Charles H. Roth, Cengage LEanring, 5th, Edition, 2004.
5. Digital Logic Applications and Design- John M. Yarbrough, Thomson Publications, 2006. 6.
Digital Logic and State Machine Design – Comer, 3rd, Oxford, 2013.
OUTCOMES
Upon completion of the course, student should possess the following skills:
Be able to manipulate numeric information in different forms
Be able to manipulate simple Boolean expressions using the theorems and postulates of
Boolean algebra and to minimize combinational functions.
Be able to design and analyse small combinational circuits and to use standard combinational
functions to build larger more complex circuits.
Be able to design and analyse small sequential circuits and to use standard sequential
functions to build larger more complex circuits.
OBJECTIVES
This course provides in-depth knowledge of the logic design techniques of digital circuits, which is
the basis for design of any digital circuit. The course objectives are:
• To learn basic techniques for the design of digital circuits and fundamental concepts used in
the design of digital systems.
• To understand common forms of number representation in digital electronic circuits and to
be able to convert between different representations.
• To implement simple logical operations using combinational logic circuits
• To design combinational logic circuits, sequential logic circuits.
• To impart to student the concepts of sequential circuits, enabling them to analyse sequential
systems in terms of state machines.
• To implement synchronous state machines using flip-flops.
UNIT - 1
NUMBER SYSTEMS & BOOLEAN ALGEBRA
Study Guide
When you complete this unit, you should be able to solve the following types of
problems:
a. Given a positive integer, fraction, or mixed number in any base (2 through 16);
convert to any other base. Justify the procedure used by using a power series
expansion for the number.
b. Add, subtract, multiply, and divide positive binary numbers. Explain the addition
and subtraction process in terms of carries and borrows.
c. Write negative binary numbers in sign and magnitude, 1’s complement, and 2’s
complement forms. Add signed binary numbers using 1’s complement and 2’s
complement arithmetic. Justify the methods used. State when an overflow occurs.
d. Represent a decimal number in binary-coded-decimal (BCD), 6-3-1-1 code, excess-
3 code, etc. Given a set of weights, construct a weighted code.
In a digital system, the physical quantities or signals can assume only discrete values,
while in analog systems the physical quantities or signals may vary continuously over
a specified range. For example, the output voltage of a digital system might be
constrained to take on only two values such as 0 volts and 5 volts, while the output
voltage from an analog system might be allowed to assume any value in the range -10
volts to +10 volts.
The design of digital systems may be divided roughly into three parts—system design,
logic design, and circuit design.
System design involves breaking the overall system into subsystems and
specifying the characteristics of each subsystem. For example, the system design
of a digital computer could involve specifying the number and type of memory
units, arithmetic units, and input-output devices as well as the interconnection
and control of these subsystems.
Logic design involves determining how to interconnect basic logic building
blocks to perform a specific function. An example of logic design is determining
the interconnection of logic gates and flip-flops required to perform binary
addition.
Circuit design involves specifying the interconnection of specific components
such as resistors, diodes, and transistors to form a gate, flip-flop, or other logic
building block. Most contemporary circuit design is done in integrated circuit
form using appropriate computer aided design tools to lay out and interconnect
the components on a chip of silicon.
Many of a digital system’s subsystems take the form of a switching circuit (Figure 1-1).
A switching circuit has one or more inputs and one or more outputs which take on
discrete values. In this course, we will study two types of switching circuits—
combinational and sequential. In a combinational circuit, the output values depend
only on the present value of the inputs and not on past values. In a sequential circuit,
the outputs depend on both the present and past input values. In other words, in order
to determine the output of a sequential circuit, a sequence of input values must be
specified. The sequential circuit is said to have memory because it must “remember”
something about the past sequence of inputs, while a combinational circuit has no
memory. In general, a sequential circuit is composed of a combinational circuit with
added memory elements. Combinational circuits are easier to design than sequential
circuits and will be studied first.
The basic building blocks used to construct combinational circuits are logic gates.
The logic designer must determine how to interconnect these gates in order to convert
the circuit input signals into the desired output signals. The relationship between
these input and output signals can be described mathematically using Boolean algebra.
Now a day’s digital systems are used in wide variety of industrial and consumer
products such as automated industrial machinery, pocket calculators,
microprocessors, digital computers, digital watches, TV games and signal processing
and so on.
Digital systems use digital circuits that can process digital signals which can take either
0 or 1 for binary system.
Advantages of Digital system over Analog system
1. Ease of programmability
The digital systems can be used for different applications by simply changing the
program without additional changes in hardware.
3. High speed
Digital processing of data ensures high speed of operation which is possible due to
advances in Digital Signal Processing.
4. High Reliability
Digital systems are highly reliable, one of the reasons for that is use of error correction
codes.
5. Design is easy
The design of digital systems which require the use of Boolean algebra and other
digital techniques is easier compared to analog designing.
Digital Logic is the basis of electronic systems, such as computers and cell phones.
Digital Logic is rooted in binary code, a series of zeroes and ones each having an
opposite value. This system facilitates the design of electronic circuits that convey
information, including logic gates. Digital Logic gate functions include and, or and
not. The value system translates input signals into specific output. Digital Logic
facilitates computing, robotics and other electronic applications.
❖ Decimal System:
The decimal system is composed of 10 numerals or symbols. These 10 symbols are 0,
1, 2, 3, 4, 5, 6, 7, 8, and 9; using these symbols as digits of a number, we can express
any quantity. The decimal system, also called the base-10 system because it has 10
digits. The decimal system is a positional-value system in which the value of a digit
depends on its position. For example, consider the decimal number 453.
We know that the digit 4 actually represents 4 hundreds, the 5 represents 5 tens, and
the 3 represents 3 units. In essence, the 4 carries the most weight of the three digits;
it is referred to as the most significant digit (MSD). The 3 carries the least weight and
is called the least significant digit (LSD).
Consider another example, 27.35. This number is actually equal to 2 tens plus 7 units
plus 3 tenths plus 5 hundredths, or 2 x 10 + 7 x 1 + 3 x 0.1 + 5 x 0.01. The decimal point
is used to separate the integer and fractional parts of the number.
Moreover, the various positions relative to the decimal point carry weights that
can be expressed as powers of 10. This is illustrated in Figure (1), where the number
2745.214 is represented. The decimal point separates the positive powers of 10 from
the negative powers. The number 2745.214 is thus equal to
(2 x 10+3) + (7 x 10+2) + (4 x 101) + (5 x 100) + (2 x 10-1) + (1 x 10-2) + (4 x 10-3)
❖ Binary System:
In the binary system there are only two symbols or possible digit values, 0 and 1.
Even so, this base-2 system can be used to represent any quantity that can be
represented in decimal or other number systems. In general though, it will take a
greater number of binary digits to express a given quantity. All of the statements
made earlier concerning the decimal system are equally applicable to the binary
system. The binary system is also a positional value system, wherein each Binary digit
has its own value or weight expressed as a power of 2. This is illustrated in Figure (2).
Multiply the decimal number by the new base number to give an integer and a
fraction. The integer number after each multiplication will be the result, then the new
remainder of fraction is multiplied by the new base number to give a new integer and
a new fraction. The process is continued until the fraction becomes 0 or until the
number of digits has sufficient accuracy.
Example
Convert (0.6875)10 to binary
Operation Integer Fraction Result (Integer)
0.6875 x 2 1 0.3750 1
0.3750 x 2 0 0.7500 0
0.7500 x 2 1 0.5000 1
0.5000 x 2 1 0.0000 1
• Step 1 − Determine the column (positional) value of each digit (this depends on
the position of the digit and the base of the number system).
• Step 2 − Multiply the obtained column values (in Step 1) by the digits in the
corresponding columns.
• Step 3 − Sum the products calculated in Step 2. The total is the equivalent value
in decimal.
Example
Binary Number (11101)2
Calculating Decimal Equivalent
Step Binary Number Decimal Number
Step 3 11101 29
= 64 + 48 + 7
= (119)10
Example
Convert (35.62)8 to Decimal
= 24 + 5 + 0.75 + 0.031
= (29.781)10
Example
Convert (3C6E.2AF) 16 to Decimal
(3C6E.2AF) 16 = 3x163 + 12x162 + 6x161 + 14x160 + 2x16-1 + 10x16-2 + 15x16-3
= 12288 + 3072 + 96 + 14 + 0.125 + 0.039 + 0.003
= (15470.167)10
❖ Binary to Octal:
Steps
• Step 1 − Divide the binary digits into groups of three (starting from the right)
as in table below.
Octal Number Groups in Binary
0 000
1 001
2 010
3 011
4 100
5 101
6 110
7 111
• Step 2 − Convert each group of three binary digits to one octal digit.
❖ Octal to Binary:
Steps
• Step 1 − Convert each octal digit to a 3 digit binary number.
• Step 2 − Combine all the resulting binary groups (of 3 digits each) into a single
binary number.
Example
Convert (746)8 to binary
7468 = 7 4 6
❖ Binary to Hexadecimal:
Steps
• Step 1 − Divide the binary digits into groups of four (starting from the right)
as in table follow.
• Step 2 − Convert each group of four binary digits to one hexadecimal symbol.
Hexadecimal Hexadecimal
Groups in Binary Groups in Binary
Number Number
0 0000 8 1000
1 0001 9 1001
2 0010 A 1010
3 0011 B 1011
4 0100 C 1100
5 0101 D 1101
6 0110 E 1110
7 0111 F 1111
❖ Hexadecimal to Binary:
Steps
• Step 1 − Convert each octal digit to a 4 digit binary number.
• Step 2 − Combine all the resulting binary groups (of 4 digits each) into a single
binary number
Octal to hexadecimal conversion:
The simplest way is to first convert the given octal no. to binary & then the binary
no. to hexadecimal.
Ex: 756.6038
7 5 6 . 6 0 3
111 101 110 . 110 000 011
0001 1110 1110 . 1100 0001 1000
1 E E . C 8 1
=5637.534
Binary Arithmetic
Arithmetic in binary is much like arithmetic in other numeral systems. Addition,
subtraction, multiplication, and division can be performed on binary numerals. And it
is essential part of all the digital computers and many other digital systems.
Binary Addition
It is a key for binary subtraction, multiplication, division. There are four rules of
binary addition.
In fourth case, a binary addition is creating a sum of (1 + 1 = 10) i.e. 0 is written in the
given column and a carry of 1 over to the next column.
Example
Binary Subtraction
Subtraction and Borrow, these two words will be used very frequently for the binary
subtraction. There are four rules of binary subtraction.
Example
Binary Multiplication
Binary multiplication is similar to decimal multiplication. It is simpler than decimal
multiplication because only 0s and 1s are involved. There are four rules of binary
multiplication.
Example
Binary Division
Binary division is similar to decimal division. It is called as the long division
procedure.
Example
Example
1001011 ÷ 11 = 011001