Digital Logic Design

Number System Conversions

 Outline of Chapter 1

1.1 Digital Systems

1.2 Binary Numbers
1.3 Number-base Conversions
1.4 Octal and Hexadecimal Number
1.5 Completemts of Number
1.6 Parity Bit
 Digital Systems and Binary Numbers

Digital age and information age

Digital computers
 General purposes
 Many scientific, industrial and commercial applications
Digital systems
 Telephone switching exchanges
 Digital camera
 Electronic calculators,
 Digital TV
Discrete information-processing systems
 Manipulate discrete elements of information
 For example, {1, 2, 3, …} and {A, B, C, …}…
 Analog and Digital Signal

Analog system
 The physical quantities or signals may vary continuously over a specified
range.
Digital system
 The physical quantities or signals can assume only discrete values.
 Greater accuracy
X(t) X(t)

t t
Analog signal Digital signal
 Binary Digital Signal

An information variable represented by physicalquantity.

For digital systems, the variable takes on discretevalues.
 Two level, or binary values are the most prevalent values.
Binary values are represented abstractlyby:
 Digits 0 and 1
 Words (symbols) False (F) and True (T) V(t)
 Words (symbols) Low (L) and High (H)
 And words On and Off
Logic 1
Binary values are represented by values
or ranges of values of physical quantities. undefine

Logic 0
t
Binary digital signal
Digital Waveforms

Digital Waveforms consist of voltage levels that are changing back and
forth between the HIGH and LOW level states. Figure (a) shows that a
signal positive going pulse is generated when the voltage (or Current)
goes from its normally LOW level to its HIGH level and then back to
LOW level.

The negative-going pulse in Figure (b) is generated when the voltage

goes from its normally HIGH level to its LOW level and back to its
HIGH level. A digital waveform is made up of a series of pulse .
Decimal Number System
 Decimal Number System
Base (also called radix) = 10
 10 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }
Digit Position
 Integer & fraction 2 1 0 -1 -2

Digit Weight 5 1 2 7 4
 Weight = (Base) Position
Magnitude 100 10 1 0.1 0.01
 Sum of “Digit x Weight”
Formal Notation
500 10 2 0.7 0.04
2 1 0 -1 -2
d
2*B +d1*B +d0*B +d-1*B +d-2*B

(512.74)10
 Binary Number System
Base = 2
 2 digits { 0, 1 }, called binary digits or “bits”
Weights
 Weight = (Base) Position 4 2 1 1/2 1/4

Magnitude 1 0 1 0 1
 Sum of “Bit x Weight” 2 1 0 -1 -2
Formal Notation 1 *22+0 *21+1 *20+0 *2-1+1 *2-2
Groups of bits 4 bits = Nibble
=(5.25)10
8 bits = Byte
(101.01)2
1011

11000101
 Octal Number System
Base = 8
 8 digits { 0, 1, 2, 3, 4, 5, 6, 7 }
Weights
 Weight = (Base) Position 64 8 1 1/8 1/64

Magnitude 5 1 2 7 4
 Sum of “Digit x Weight”
2 1 0 -1 -2
Formal Notation
5 *82+1 *81+2 *80+7 *8-1+4 *8-2

=(330.9375)10
(512.74)8
 Hexadecimal Number System
Base = 16
 16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F }
Weights
1/16 1/256
 Weight = (Base) Position 256 16 1

Magnitude 1 E 5 7 A
 Sum of “Digit x Weight”
2 1 0 -1 -2
Formal Notation
1 *162+14 *161+5 *160+7 *16-1+10 *16-2
=(485.4765625)10
(1E5.7A)16
 The Power of
2
n 2n n 2n

0 20=1 8 28=256
1 21=2 9 29=512
2 22=4 10 210=1024 Kilo

3 23=8 11 211=2048
4 24=16 12 212=4096
5 25=32 20 220=1M Mega

6 26=64 30 230=1G Giga

7 27=128 40 240=1T Tera

 Addition

DecimalAddition

1 1 Carry
5 5
+ 5 5
1 1 0
= Ten ≥ Base
Subtract a Base
 Binary Addition

ColumnAddition

1 1 1 1 1 1
1 1 1 1 0 1 = 61
+ 1 0 1 1 1 = 23

1 0 1 0 1 0 0 = 84

≥ (2)10
 Binary Subtraction

Borrow a “Base” whenneeded

1 2 = (10)2
0 2 2 0 0 2
1 0 0 1 1 0 1 = 77
− 1 0 1 1 1 = 23
0 1 1 0 1 1 0 = 54
 Binary Multiplication

Bit by bit

1 0 1 1 1
x 1 0 1 0
0 0 0 0 0
1 0 1 1 1
0 0 0 0 0
1 0 1 1 1
1 1 1 0 0 1 1 0
Number Base Conversions

Evaluate
Magnitude
Octal
(Base 8)

Evaluate
Magnitude
Decimal Binary
(Base 10) (Base 2)

Hexadecimal
(Base 16)
Evaluate
Magnitude
 Decimal (Integer) to Binary Conversion
Divide the number by the ‘Base’(=2)
Take the remainder (either 0 or 1) as a coefficient
Take the quotient and repeat the division

Example: (13)10
Quotient Remainder Coefficient
13/ 2 = 6 1 a0 = 1
6/2= 3 0 a1 = 0
3/2= 1 1 a =1
1 /2= 0 1 a32 = 1
Answer: (13)10 = (a3 a2 a1 a0)2 = (1101)2

MSB LSB
 Decimal (Fraction) to Binary Conversion

Multiply the number by the ‘Base’(=2)

Take the integer (either 0 or 1) as a coefficient
Take the resultant fraction and repeat thedivision

Example: (0.625)10
Integer Fract ion Coefficient
0.625 * 2 = 1 . 25 a-1 = 1
0.25 * 2 = 0 . 5 a-2 = 0
0.5 *2= 1 . 0 a-3 = 1
Answer: (0.625)10 = (0.a-1 a-2 a-3)2 = (0.101)2

MSB LSB
Example: (0.6875)10
 Decimal to Octal Conversion
Example: (175)10
Quotient Remainder Coefficient
175 / 8 = 21 7 a0 = 7
21 / 8 = 2 5 a1 = 5
2 / 8= 0 2 a2 = 2
Answer: (175)10 = (a2 a1 a0)8 = (257)8

Example: (0.3125)10
Integer Fraction Coefficient
0.3125 * 8 = 2 . 5 a-1 = 2
0.5 *8= 4 . 0 a-2 = 4
Answer: (0.3125)10 = (0.a-1 a-2 a-3)8 = (0.24)8
Converting a Number of Some Base of Another Base

Exam ple
5456 = ?4

Solution:
Step 1: Convert from base 6 to base 10

5456 = 5 x 62 + 4 x 61 + 5 x 60
= 5 x 36 + 4 x 6 + 5 x 1
= 180 + 24 + 5
= 20910

(Continued on next slide)

Converting a Number of Some Base of Another
to Base
a
N um
ber
Step 2: Convert 20910 to base 4

4 209 Remainders
52 1
13 0
3 1
3
0

Hence, 20910 = 31014

So, 5456 = 20910 = 31014

Thus, 5456 = 31014

DECIMAL TO HEXADECIMAL CONVERSION
Conversion steps:
 Divide the number by 16.

 Get the integer quotient for the next iteration.

 Get the remainder for the hex digit.

 Repeat the steps until the quotient is equal to 0.

DECIMAL TO HEXADECIMAL CONVERSION
BINARY TO DECIMAL CONVERSION
Convert binary number 1010.1011 into decimal number
 Binary − Octal Conversion
Octal Binary
8 = 23
0 000
Each group of 3 bits represents an octal
digit 1 001
2 010
Assume Zeros
Example: 3 011

( 1 0 1 1 0 . 0 1 )2 4 100

5 101
6 110

( 2 6 . 2 )8 7 111

Works both ways (Binary to Octal & Octal to Binary)

 Binary − Hexadecimal Conversion
Hex Binary
16 = 24 0 0000
1 0001
Each group of 4 bits representsa 2 0010
hexadecimal digit 3 0011
4 0100
5 0101
Assume Zeros 6 0110
Example: 7 0111
8 1000
( 1 0 1 1 0 . 0 1 )2 9 1001
A 1010
B 1011
C 1100
D 1101
(1 6 . 4 )16 E 1110
F 1111

Works both ways (Binary to Hex & Hex to Binary)

 Octal − Hexadecimal Conversion
Convert to Binary as an intermediatestep
Example:

( 2 6 . 2 )8

Assume Zeros Assume Zeros

( 0 1 0 1 1 0 . 0 1 0 )2

(1 6 . 4 )16

Works both ways (Octal to Hex & Hex to Octal)

Decimal, Binary, Octal and Hexadecimal
Decimal Binary Octal Hex
00 0000 00 0
01 0001 01 1
02 0010 02 2
03 0011 03 3
04 0100 04 4
05 0101 05 5
06 0110 06 6
07 0111 07 7
08 1000 10 8
09 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F
 Complements
There are two types of complements for each base-r system: the radix complement and
diminished radix complement.
Diminished Radix Complement - (r-1)’s Complement
 Given a number N in base r having n digits, the (r–1)’s complement of N is
defined as:
(rn –1) – N
Example for 6-digit decimal numbers:
 9’s complement is (rn – 1)–N = (106–1)–N = 999999–N
 9’s complement of 546700 is 999999–546700 = 453299
Example for 7-digit binary numbers:
 1’s complement is (rn – 1) – N = (27–1)–N = 1111111–N
 1’s complement of 1011000 is 1111111–1011000 = 0100111
Observation:
 Subtraction from (rn – 1) will never require a borrow
 Diminished radix complement can be computed digit-by-digit
 For binary: 1 – 0 = 1 and 1 – 1 = 0
 Complements
1’s Complement (Diminished Radix Complement)
 All ‘0’s become ‘1’s
All‘1’s become ‘0’s
Example (10110000)2
 (01001111)2
If you add a number and its 1’s complement …

10110000
+ 01001111
11111111
 Complements

Radix Complement

The r's complement of an n-digit number N in base r is defined as

rn – N for N ≠ 0 and as 0 for N = 0. Comparing with the (r  1) 's
complement, we note that the r's complement is obtained by adding 1
to the (r  1) 's complement, since rn – N = [(rn  1) – N] + 1.

Example: Base-10
The 10's complement of 012398 is 987602
The 10's complement of 246700 is 753300

Example:Base-2
The 2's complement of 1101100 is 0010100
The 2's complement of 0110111 is 1001001
 Complements
2’s Complement (Radix Complement)
 Take 1’s complement then add 1

OR  Toggle all bits to the left of the first ‘1’ from the right
Example:
Number:
1’s Comp.:
10110000 10110000
01001111
+ 1
01010000 01010000
 Complements

Subtraction with Complements

 The subtraction of two n-digit unsigned numbers M – N in base r can be
done as follows:
 Complements
Example 1.5
 Using 10's complement, subtract 72532 – 3250.

Example 1.6
 Using 10's complement, subtract 3250 – 72532.

There is no end carry.

Therefore, the answer is – (10's complement of 30718) =  69282.

 Complements

Example 1.7
 Given the two binary numbers X = 1010100 and Y = 1000011, perform the
subtraction (a) X – Y ; and (b) Y  X, by using 2's complement.

There is no end carry.

Therefore, the answer is
Y – X =  (2's complement
of 1101111) =  0010001.
 Binary Codes

BCD Code
 A number with k decimal digits will
require 4k bits in BCD.
 Decimal 396 is represented in BCD
with 12bits as 0011 1001 0110, with
each group of 4 bits representing one
decimal digit.
 A decimal number in BCD is the
same as its equivalent binary number
only when the number is between 0
and 9.
 The binary combinations 1010
through 1111 are not used and have
no meaning in BCD.
 Binary Code

Example:
 Consider decimal 185 and its corresponding value in BCD and binary:

BCD addition
 Binary Code

Example:
 Consider the addition of 184 + 576 = 760 in BCD:

Decimal Arithmetic: (+375) + (-240) = +135

Hint 6: using 10’s of BCD

 Binary Codes

Other Decimal Codes

PARITY BIT
 Parity bit is an additional bit added to the
data.
 Before adding the parity bit, number of 1 or
0 is calculated in the data. Based on this
calculation of data an extra bit is added to
the actual data.
 If we have an 7 bit data, then after adding a
parity bit, it will be 8 bit.
 There are two types of parity bits in error
detection, they are
• Even parity
• If the data has even number of 1’s, the parity
bit is 0. Ex: data is 1000001 -> parity bit 0
• Odd number of 1’s, the parity bit is 1. Ex: data
is 1001001 -> parity bit 1
• Odd parity
 If the data has odd number of 1’s, the parity
bit is 0. Ex: data is 10011101 -> parity bit 0
 Even number of 1’s, the parity bit is 1. Ex:
data is 10010101 -> parity bit 1
 REFERENCES

1. Digital systems Principles and Applications 8th Edition-

Ronald j.Tocci
2.Logic & Computer Design Fundamentals 5th Edition- M. Morris
Mano
3. Digital Logic and Computer Design 4th Edition - M. Morris
Mano
4.Digital Fundamentals – 8th Edition – Floyd & Jain