Digital Logic Design

Prepared by, Dr Sharvari C Tamane

 Course Title: Digital Logic Design
Semester IV, Course Code: BTIT2203
Course Type: Compulsory, Pre-requisite –Nil
L – T – P: 3 – 0 – 2, Stream: Core, Credits: 4

 Course Objectives:
 To train the students on fundamentals of digital logic design.
 To train the students for minimization of digital circuits.
 To study combinational and sequential Logic Design (Multiplexer, De-
multiplexers).
 To describe various programmable logic devices.
 Course Title: Digital Logic Design
Semester IV, Course Code: BTIT2203
Course Type: Compulsory, Pre-requisite –Nil
L – T – P: 3 – 0 – 2, Stream: Core, Credits: 4

 Course Outcomes:
 Students will be able to:
 Perform binary arithmetic; explain logic gates, universal gates, K-map.
 Design different Combinational and Sequential Logic circuits.
 Demonstrate the working of flip-flops.
UNIT I
 Number Systems :
 Number systems: Binary, Octal, Hexadecimal number systems
 Binary arithmetic, 2’s Complement Arithmetic,
 Codes:
 Binary code
 Excess-3 code
 Gray code
 Error detection and correction codes
UNIT II
 Combinational Logic Design:
 Introduction,
 Standard Representation of Logic functions,
 Karnaugh Map Representation of Logic functions,
 Simplification of Logic functions using K Map,
 Minimization of logic functions,
 Don’t-care Conditions,
 Design Examples,
 Five and Six Variable K Maps,
 Quine – McClusky Minimization Technique
UNIT III
 Combinational Functions:
 Introduction,
 Multiplexers and their use in Combinational Logic Design,
 Demultiplexers/Decoders and their use in Combinational Logic Design,
 Adders and their use as Subtractors,
 Code Converters
UNIT IV
 Flip Flops:
 Introduction,
 A 1 Bit Memory Cell,
 Clocked S-R FLIP FLOP,
 J-K FLIP FLOP,
 D and T FLIP FLOP,
 Excitation table of FLIP FLOP,
 Conversion from one type of FLIP FLOP to Another Type
UNIT V
 Sequential Logic Design:
 Introduction,
 Registers,
 Applications of Shift registers,
 Ripple or asynchronous counters,
 Synchronous counters,
 Synchronous sequential circuits design,
 Asynchronous sequential circuits
UNIT VI
 Programmable Logic Devices:
 Semiconductor memories,
 RAM, ROM,
 EPROM, EEPROM,
 NVRAM, SRAM, DRAM,
 PLA, PAL,
 Memory System design
Number Systems and Codes

Unit 1
Books
 Text Books:
1. R.P. Jain, “Modern Digital Electronics”, Tata McGraw Hill Publication, 4th Edition, 2010.
2. M. M. Mano, “Digital Logic and Computer Design”, Prentice Hall of India Publication, 4 th
Edition, 2006.

 Reference Books:
1. D. P. Leach, A. P. Malvino, G. Saha, “Digital Principles and Applications”, Tata McGraw Hill
Publication, 8th Edition, 1993.
2. Comer, “Digital Logic & State Machine Design”, Oxford Universities Press, 3rd Edition, 2014

 E-Sources:
 NPTEL videos
Introduction
 An Ordered set of ten symbols:
0, 1, 2, 3, 4, …9
 known as digits… are used to specify any number
 This is also known as Decimal Number System
 The radix or base of this number system is 10
 E.g. 1982.365
 Integer part: 1982
 Fractional part: 0.365
. Is known as radix or decimal point
Introduction
 Other commonly used number systems are:
 Binary
 Octal
 Hexadecimal
 These number systems are widely used in Microprocessor, Logic circuits, Computers
etc. for understanding, analyzing and designing digital systems.
 Computers and other digital circuits use binary signals but are required to handle
data which may be numeric, alphabets or special characters.
 So the information available in any form is required to be converted in to suitable
binary form before it can be processed by digital circuits.
 Numerals, alphabets or special characters are uniquely coded into combinations of
0’s and 1’s using a coding system known as: code
 The process of coding: encoding
Number Systems
 In any number system, there is an ordered set of symbols: digits
 Rules: for performing arithmetic operations: addition, multiplication etc.
 Number: consists of two parts: integer, fractional, set apart by radix point:
Number Systems
 The digits in a number are placed side by side and each position in the
number is assigned a weight or index of importance by some predesigned
rule.
 Characteristics of commonly used number systems:
Number Systems
 The digits in a number are placed side by side and each position in the
number is assigned a weight or index of importance by some predesigned
rule.
 Characteristics of commonly used number systems:
Number Systems
 The digits in a number are placed side by side and each position in the
number is assigned a weight or index of importance by some predesigned
rule.
 Characteristics of commonly used number systems:
Number Systems
 The digits in a number are placed side by side and each position in the
number is assigned a weight or index of importance by some predesigned
rule.
 Characteristics of commonly used number systems:
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary Number Systems
B3 B2 B1 B0 D1 D0
0 0 0 0 0 0
 The binary number 0 0 0 1 0 1
system with base 0 0 1 0 0 2
two is known as 0 0 1 1 0 3

the binary 0 1 0 0 0 4
0 1 0 1 0 5
number system.
0 1 1 0 0 6
 Symbols used: 0 1 1 1 0 7

0 and 1: bits 1 0 0 0 0 8
1 0 0 1 0 9
 Ex. 4 bit binary 1 0 1 0 1 0
numbers and 1 0 1 1 1 1
corresponding 1 1 0 0 1 2
1 1 0 1 1 3
decimal numbers:
1 1 1 0 1 4
1 1 1 1 1 5
Binary to Decimal Conversion
 Any binary number can be converted into its equivalent decimal number using
the weights assigned to each bit position.
Binary to Decimal Conversion
 Any binary number can be converted into its equivalent decimal number using
the weights assigned to each bit position.
Binary to Decimal Conversion
Binary to Decimal Conversion
Binary to Decimal Conversion
Binary to Decimal Conversion
Binary to Decimal Conversion
Decimal to Binary Conversion
 Any decimal number can be converted into its equivalent binary number.
 It can be obtained by continuous division by 2 and keeping track of the
integers generated.
Decimal to Binary Conversion

Remainder
1
0
1
1
Decimal to Binary Conversion

Remainder
1
0
1
1
Decimal to Binary Conversion
Decimal to Binary Conversion
Decimal to Binary Conversion
Decimal to Binary Conversion
Decimal to Binary Conversion
Decimal to Binary Conversion
Decimal to Binary Conversion
Signed Binary Numbers
 Sign Magnitude Representation
 Decimal number system:
 Positive numbers: + or no sign
 Negative numbers: - minus
 This representation is known as signed numbers
 Digital circuit: can understand only 2 symbols: 0 or 1
 Additional bit is used as the sign bit and it is placed at the Most Significant Bit (MSB).
 0 is used to represent positive number
 1 is used to represent negative number
 For ex. 8 bit signed number: 01000100 represents a positive number (1000100)2 =
(68)10, the left most 0 (MSB) indicates that the number is positive.
 8 bit signed number: 11000100 represents a negative number (1000100)2 = (68)10, the
left most 1 (MSB) indicates that the number is negative.
Signed Binary Numbers
Signed Binary Numbers
Signed Binary Numbers
Signed Binary Numbers
Signed Binary Numbers
Signed Binary Numbers

10
Signed Binary Numbers

10
10
One’s complement representation
 In a binary number, if each 1 is replaced by 0 and each 0 by 1, the
resulting number is known as the one’s complement of the first
number.
 Both the numbers are complement of each other.
 If one of these is positive then the other number will be negative
and vice versa.
 For ex. (0101)2 represents (+5) whereas (1010)2 represents (-5)10 in
this representation
 In this method also MSB is 0 for positive numbers and 1 for negative
numbers
One’s complement representation
 For n bit number, the maximum positive number which can be
represented in 1’s complement representation is (2n-1 – 1) and the
maximum negative number is - (2n-1 – 1).
Two’s complement representation
 If 1 is added to 1’s complement of a binary number, the resulting
number is known as 2’s complement of the binary number.
 For ex. 2’s complement of 0101 is 1011
 number 0101
 1’C 1010
 add 1 1
 2’C 1011

 For n bit number, the maximum positive number which can be

represented in 2’s complement representation is (2n-1 – 1) and the
maximum negative number is - (2n-1).
Two’s complement representation
 If the LSB of the number is 1, its 2’C is obtained by
changing each 0 to 1 and 1 to 0 except the Least
significant bit
 If the LSB of the number is 0, its 2’C is obtained by
scanning the number from the LSB to MSB bit by bit
and retaining the bits as they are up to and including
the occurrence of the first 1 and complement all other
bits.
Binary Arithmetic

 Arithmetic operations for decimal numbers: +, -, *,

 Binary Arithmetic is simpler than decimal as only 2 digits are
involved 1 and 0
 Binary Addition: Rules of Binary Addition:
Binary Arithmetic

 Arithmetic operations for decimal numbers: +, -, *,

 Binary Arithmetic is simpler than decimal as only 2 digits are
involved 1 and 0
 Binary Addition: Rules of Binary Addition:
Binary Arithmetic

 Arithmetic operations for decimal numbers: +, -, *,

 Binary Arithmetic is simpler than decimal as only 2 digits are
involved 1 and 0
 Binary Addition: Rules of Binary Addition:
Binary Arithmetic

 Arithmetic operations for decimal numbers: +, -, *,

 Binary Arithmetic is simpler than decimal as only 2 digits are
involved 1 and 0
 Binary Addition: Rules of Binary Addition:
Binary Arithmetic

 Arithmetic operations for decimal numbers: +, -, *,

 Binary Arithmetic is simpler than decimal as only 2 digits are
involved 1 and 0
 Binary Addition: Rules of Binary Addition:
Binary Arithmetic
Binary Arithmetic
Binary Arithmetic
Binary Subtraction

 Binary Subtraction : Rules of Binary Subtraction

When the borrow =1, this is to be subtracted from the next higher binary bit
Binary Subtraction

 Binary Subtraction : Rules of Binary Subtraction

When the borrow =1, this is to be subtracted from the next higher binary bit
Binary Subtraction

 Binary Subtraction : Rules of Binary Subtraction

When the borrow =1, this is to be subtracted from the next higher binary bit
Binary Subtraction

 Binary Subtraction : Rules of Binary Subtraction

When the borrow =1, this is to be subtracted from the next higher
binary bit
Binary Subtraction
Binary Subtraction
Binary Multiplication

 In Binary Multiplication each partial product is either zero (multiplication

by zero) or exactly same as the multiplicand (multiplication by one).
Binary Multiplication

 In Binary Multiplication each partial product is either zero (multiplication

by zero) or exactly same as the multiplicand (multiplication by one).
Binary Division

 Binary division is obtained using the same procedure as decimal

division.
Binary Division

 Binary division is obtained using the same procedure as decimal

division.
2’s Complement Arithmetic
 Digital circuits are used for performing binary arithmetic
operations
 It is possible to use the circuits designed for binary addition
to perform the binary subtraction also, if we can change
the problem of subtraction to that of an addition
 This eliminated the need of additional circuits for
subtraction, rather the same adder circuits are used for
both the operations
 This makes design of arithmetic circuits very convenient
and cheaper
Subtraction Using 2’s Complement
 Binary subtraction can be performed by adding the
2’sC of the subtrahend to the minuend
 If a final carry is generated, discard the carry and the
answer is given by the remaining bits which is positive
 If a final carry is 0, the answer is negative and is in 2’sC
form
Subtraction Using 2’s Complement
Subtraction Using 2’s Complement
Subtraction Using 2’s Complement
Subtraction Using 2’s Complement
Subtraction Using 2’s Complement
Subtraction Using 2’s Complement
Subtraction Using 2’s Complement
Addition/Subtraction in 2’s Complement Representation
 The Addition/Subtraction of signed binary numbers can most
conveniently be performed using 2’sC representation of both
the operands.
 This is the most commonly used method when these
operations are performed using digital circuits and
microprocessors
Addition/Subtraction in 2’s Complement Representation
Addition/Subtraction in 2’s Complement Representation
Addition/Subtraction in 2’s Complement Representation
Addition/Subtraction in 2’s Complement Representation
 Addition/Subtraction in 2’s Complement Representation

•If two operands are of the opposite sign, the result is to be obtained by the rule of subtraction using 2’s C
•If two operands are of the same sign, the sign bit of the result (MSB) is to be compared with the sign bit of
the operands. In case the sign bits are same, the result is correct and is in 2’sC form.
•If the sign bits are not same, there is a problem of overflow, i.e. result cannot be accommodated using eight
bits and the result is to be interpreted suitably.
•The result in this case consists of nine bits i.e. carry and eight bits, and the carry bit will give the sign of the
number.
Octal Number System
 The number system with base eight is known as the octal number system.
 Symbols: 0, 1, 2….7
 The radix or base of this number system is 8
 E.g. 6327.4051
 Integer part: 6327
 Fractional part: 0. 4051
Octal to Decimal Conversion
 Any octal number can be converted into its equivalent decimal number using
the weights assigned to each octal digit position.
Octal to Decimal Conversion
 Any octal number can be converted into its equivalent decimal number using
the weights assigned to each octal digit position.
Octal to Decimal Conversion
 Any octal number can be converted into its equivalent decimal number using
the weights assigned to each octal digit position.
Decimal to Octal Conversion
 The conversion from decimal to octal is similar to the conversion procedure for base 10 to base 2 conversion.
 The only difference is that number 8 is used in place of 2 for division in the case of integers and for multiplication
in the case of fractional numbers.
Decimal to Octal Conversion
 The conversion from decimal to octal is similar to the conversion procedure for base 10 to base 2 conversion.
 The only difference is that number 8 is used in place of 2 for division in the case of integers and for multiplication
in the case of fractional numbers.
Decimal to Octal Conversion
 The conversion from decimal to octal is similar to the conversion procedure for base 10 to base 2 conversion.
 The only difference is that number 8 is used in place of 2 for division in the case of integers and for multiplication
in the case of fractional numbers.
Decimal to Octal Conversion
Decimal to Octal Conversion
Decimal to Octal Conversion
Decimal to Octal Conversion
Decimal to Octal Conversion
 From the above example, it is observed that the conversion for fractional
numbers may not be exact.
 But an approximate equivalent can be determined by terminating the process
of multiplication by eight at the desired point.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
 Octal
numbers
can be
converted
into
equivalent
binary
numbers by
replacing
each octal
digit by its 3
bit
equivalent
binary.
Octal to Binary Conversion
Octal to Binary Conversion
Binary to Octal Conversion
 Binary numbers can be converted into equivalent octal numbers by making
groups of 3 bits starting from LSB and moving towards MSB for integer part o
the number and then replacing each group of three bits by its octal
representation.
 For fractal part the groupings of three bits are made starting from the binary
point.
Binary to Octal Conversion
 Binary numbers can be converted into equivalent octal numbers by making
groups of 3 bits starting from LSB and moving towards MSB for integer part o
the number and then replacing each group of three bits by its octal
representation.
 For fractal part the groupings of three bits are made starting from the binary
point.
Binary to Octal Conversion
 Binary numbers can be converted into equivalent octal numbers by making
groups of 3 bits starting from LSB and moving towards MSB for integer part o
the number and then replacing each group of three bits by its octal
representation.
 For fractal part the groupings of three bits are made starting from the binary
point.
Binary to Octal Conversion
Binary to Octal Conversion
Binary to Octal Conversion
Binary to Octal Conversion
Binary to Octal Conversion
Binary to Octal Conversion
Binary to Octal Conversion
Binary to Octal Conversion
In forming
the 3 bit
groupings 0’s
may be
required to
complete
the first
(MSD) group
in the
integer part
and the last
(LSD) group
in the
fractional
part.
Octal Arithmetic
Octal Arithmetic
Octal Arithmetic
Octal Arithmetic
Octal Arithmetic
Octal Arithmetic
Octal Arithmetic
Hexadecimal Number System
 The base for
hexadecimal
number system
is 16 which
requires 16
distinct symbols
to represent the
numbers.
 These are 0, 1,
2…..9 and
alphabets A, B, C,
D, E, F.
 This is also called
as alphanumeric
number system
Hexadecimal Number System
 The base for
hexadecimal
number system
is 16 which
requires 16
distinct symbols
to represent the
numbers.
 These are 0, 1,
2…..9 and
alphabets A, B, C,
D, E, F.
 This is also called
as alphanumeric
number system
Hexadecimal to Decimal Conversion

The fractional part may not be an exact equivalent and therefore may give a small
error.
Hexadecimal to Decimal Conversion

The fractional part may not be an exact equivalent and therefore may give a small
error.
Hexadecimal to Decimal Conversion

The fractional part may not be an exact equivalent and therefore may give a small
error.
Hexadecimal to Decimal Conversion

The fractional part may not be an exact equivalent and therefore may
give a small error.
Decimal to Hexadecimal Conversion
Decimal to Hexadecimal Conversion
Decimal to Hexadecimal Conversion
Decimal to Hexadecimal Conversion
Decimal to Hexadecimal Conversion
Decimal to Hexadecimal Conversion
Hexadecimal to Binary Conversion
Hexadecimal to Binary Conversion
Binary to Hexadecimal Conversion
 Binary numbers can be converted into the equivalent
hexadecimal numbers by making groups of four bits
starting from LSB and moving towards MSB for integer
part and then replacing each group of four bits by its
hexadecimal representation.
 For the fractional part the above procedure is replaced
starting from the bit next to the binary point and
moving towards the right.
Binary to Hexadecimal Conversion
Binary to Hexadecimal Conversion
Binary to Hexadecimal Conversion
Binary to Hexadecimal Conversion

In forming the 4 bit groupings 0’s may be required to complete the first (MSD) group in
the integer part and the last (LSD) group in the fractional part.
Binary to Hexadecimal Conversion

In forming the 4 bit groupings 0’s may be required to complete the first (MSD) group in
the integer part and the last (LSD) group in the fractional part.
Binary to Hexadecimal Conversion

In forming the 4 bit groupings 0’s may be required to complete the first (MSD) group in
the integer part and the last (LSD) group in the fractional part.
Binary to Hexadecimal Conversion

In forming the 4 bit groupings 0’s may be required to complete the first (MSD) group in
the integer part and the last (LSD) group in the fractional part.
Binary to Hexadecimal Conversion

In forming the 4 bit groupings 0’s may be required to complete the first (MSD)
group in the integer part and the last (LSD) group in the fractional part.
Conversion from Hex to Octal and Vice Versa
 Hex numbers can be converted to equivalent
octal numbers and octal numbers can be
converted to equivalent hex numbers by
converting the hex/octal number to equivalent
binary and then to octal/hex respectively.
Conversion from Hex to Octal and Vice Versa
Conversion from Hex to Octal and Vice Versa
Conversion from Hex to Octal and Vice Versa
Conversion from Hex to Octal and Vice Versa
Conversion from Hex to Octal and Vice Versa
Hexadecimal Arithmetic
 The rules for arithmetic operations with hex numbers
are similar to the rules for decimal, octal and binary
systems.
 The information can be handled in the binary form in a
digital circuit and it is easier to enter the information
using hex number system.
 Since arithmetic operations are performed by the
digital circuits on binary numbers, therefore hex
numbers are to be first converted in to binary numbers
Hexadecimal Arithmetic
Hexadecimal Arithmetic
Hexadecimal Arithmetic
Hexadecimal Arithmetic
Hexadecimal Arithmetic