Number Systems -1

Overview
 The design of computers
 It all starts with numbers
 Building circuits
 Building computing machines
 Digital systems
 Understanding decimal numbers
 Binary and octal numbers
 The basis of computers!
 Conversion between different number systems
 Digital Computer Systems
 Digital systems consider discrete amounts of data.
 Examples
 26 letters in the alphabet

 10 decimal digits

 Larger quantities can be built from discrete values:

 Words made of letters

 Numbers made of decimal digits (e.g. 239875.32)

 Computers operate on binary values (0 and 1)

 Easy to represent binary values electrically
 Voltages and currents.

 Can be implemented using circuits

 Create the building blocks of modern computers

Understanding Decimal
Numbers
 Decimal numbers are made of decimal digits:
(0,1,2,3,4,5,6,7,8,9)
 But how many items does a decimal number
represent?
 8653 = 8x103 + 6x102 + 5x101 + 3x100
 What about fractions?
 97654.35 = 9x104 + 7x103 + 6x102 + 5x101 + 4x100 +
3x10-1 + 5x10-2
 In formal notation -> (97654.35)10
 Why do we use 10 digits, anyway?
Understanding Octal Numbers
 Octal numbers are made of octal digits:
(0,1,2,3,4,5,6,7)
 How many items does an octal number
represent?
 (4536)8 = 4x83 + 5x82 + 3x81 + 6x80 = (1362)10
 What about fractions?
 (465.27)8 = 4x82 + 6x81 + 5x80 + 2x8-1 + 7x8-2
 Octal numbers don’t use digits 8 or 9
 Who would use octal number, anyway?
Understanding Binary Numbers
 Binary numbers are made of binary digits (bits):
 0 and 1

 How many items does an binary number represent?

 (1011) = 1x23 + 0x22 + 1x21 + 1x20 = (11)
2 10
 What about fractions?
 (110.10) = 1x22 + 1x21 + 0x20 + 1x2-1 + 0x2-2
2
 Groups of eight bits are called a byte
 (11001001)
2
 Groups of four bits are called a nibble.
 (1101)
2
 Conversion
Between Number
Bases Octal(base 8)

Decimal(base 10) Binary(base 2)

Hexadecimal
° (base16)
Learn to convert between bases.
° Already demonstrated how to convert
from binary to decimal.
° Hexadecimal described in next
lecture.
 Convert an Integer from Decimal to
Another Base
For each digit position:
1. Divide decimal number by the base (e.g. 2)
2. The remainder is the lowest-order digit
3. Repeat first two steps until no divisor remains.

Example for (13)10:

Integer Remainder Coefficient
Quotient
13/2 = 6 + 1 a0 = 1
6/2 = 3 + 0 a1 = 0
3/2 = 1 + 1 a2 = 1
1/2 = 0 + 1 a3 = 1

Answer (13)10 = (a3 a2 a1 a0)2 = (1101)2

Convert an Fraction from Decimal to
Another Base
For each digit position:
1. Multiply decimal number by the base (e.g. 2)
2. The integer is the highest-order digit
3. Repeat first two steps until fraction becomes zero.

Example for (0.625)10:

Integer Fraction Coefficient

0.625 x 2 = 1 + 0.25 a -1 = 1
0.250 x 2 = 0 + 0.50 a -2 = 0
0.500 x 2 = 1 + 0 a -3 = 1

Answer (0.625)10 = (0.a-1 a-2 a-3 )2 = (0.101)2

The Growth of Binary Numbers
n 2n n 2n
0 20=1 8 28=256
1 21=2 9 29=512

2 22=4 10 210=1024

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

Binary Addition
 Binary addition is very simple.
 This is best shown in an example of
adding two binary numbers…

1 11 1 1 1 carries
11 1 1 0 1
+ 1 0 1 1 1
---------------------
1 0 1 0 1 0 0
Binary Multiplication
 Binary multiplication is much the same as
decimal multiplication, except that the
multiplication operations are much
simpler… 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
 Convert an Integer from Decimal to
Octal
For each digit position:
1. Divide decimal number by the base (8)
2. The remainder is the lowest-order digit
3. Repeat first two steps until no divisor remains.

Example for (175)10:

Integer Remainder Coefficient
Quotient
175/8 = 21 + 7 a0 = 7
21/8 = 2 + 5 a1 = 5
2/8 = 0 + 2 a2 = 2

Answer (175)10 = (a2 a1 a0)2 = (257)8

Convert an Fraction from Decimal to
Octal
For each digit position:
1. Multiply decimal number by the base (e.g. 8)
2. The integer is the highest-order digit
3. Repeat first two steps until fraction becomes zero.

Example for (0.3125)10:

Integer Fraction Coefficient

0.3125 x 8 = 2 + 5 a -1 = 2
0.5000 x 8 = 4 + 0 a -2 = 4

Answer (0.3125)10 = (0.24)8

 Summary
 Binary numbers are made of binary digits
(bits)
 Binary and octal number systems
 Conversion between number systems
 Addition and multiplication in binary
Number Systems

VIT University
 Overview
 Hexadecimal numbers
 Related to binary and octal numbers
 Conversion between hexadecimal, octal and
binary
 Value ranges of numbers
 Representing positive and negative numbers
 Creating the complement of a number
 Make a positive number negative (and vice versa)
 Why binary?
Understanding Binary
Numbers
Binary numbers are made of binary digits (bits):


 0 and 1
 How many items does an binary number represent?
 (1011) = 1x23 + 0x22 + 1x21 + 1x20 = (11)
2 10
 What about fractions?
 (110.10) = 1x22 + 1x21 + 0x20 + 1x2-1 + 0x2-2
2
 Groups of eight bits are called a byte
 (11001001)
2
 Groups of four bits are called a nibble.
 (1101)
2
Understanding Hexadecimal
Numbers
 Hexadecimal numbers are made of 16 digits:
 (0,1,2,3,4,5,6,7,8,9,A, B, C, D, E, F)

 How many items does an hex number represent?

 (3A9F)16 = 3x163 + 10x162 + 9x161 + 15x160 =

1499910
 What about fractions?
 (2D3.5)16 = 2x162 + 13x161 + 3x160 + 5x16-1 =

723.312510
 Note that each hexadecimal digit can be represented with
four bits.
 (1110) = (E)16
2
 Groups of four bits are called a nibble.
 (1110)
2
Putting It All Together
° Binary, octal, and
hexadecimal similar
° Easy to build circuits to
operate on these
representations
° Possible to convert
between the three
formats
Converting Between Base 16
and Base 2
3A9F16 = 0011 1010 1001 11112
3 A 9 F
° Conversion is easy!
 Determine 4-bit value for each hex digit
° Note that there are 24 = 16 different values of four
bits
° Easier to read and write in hexadecimal.
° Representations are equivalent!
Converting Between Base 16
and Base 8
3A9F16 = 0011 1010 1001 11112
3 A 9 F

352378 = 011 101 010 011 1112

3 5 2 3 7

1. Convert from Base 16 to Base 2

2. Regroup bits into groups of three starting from
right
3. Ignore leading zeros
4. Each group of three bits forms an octal digit.
How To Represent Signed Numbers
• Plus and minus sign used for decimal numbers:
25 (or +25), -16, etc.
• For computers, desirable to represent everything
as bits.
• Three types of signed binary number
representations: signed magnitude, 1’s
complement, 2’s complement.
• In each case: left-most bit indicates sign: positive
(0) or negative (1).

Consider signed magnitude:

000011002 = 1210 100011002 = -1210

Sign bit Magnitude Sign bit Magnitude

One’s Complement Representation
• The one’s complement of a binary number
involves inverting all bits.
• 1’s comp of 00110011 is 11001100
• 1’s comp of 10101010 is 01010101
• For an n bit number N the 1’s complement is (2n-1)
– N.
• Called diminished radix complement by Mano
since 1’s complement for base (radix 2).
• To find negative of 1’s complement number take
the 1’s complement.

000011002 = 1210 111100112 = -1210

Sign bit Magnitude Sign bit Magnitude

Two’s Complement Shortcuts
 Algorithm 1 – Simply complement each bit and then add 1 to
the result.
 Finding the 2’s complement of (01100101) and of its 2’s
2
complement…
N = 01100101 [N] = 10011011
10011010 01100100
+ 1 + 1
--------------- ---------------
10011011 01100101
 Algorithm 2 – Starting with the least significant bit, copy all of
the bits up to and including the first 1 bit and then
complementing the remaining bits.
 N =01100101
[N] =10011011
Finite Number Representation
 Machines that use 2’s complement arithmetic can
represent integers in the range
-2n-1 <= N <= 2n-1-1
where n is the number of bits available for
representing N. Note that 2n-1-1 = (011..11)2 and
–2n-1 = (100..00)2
o For 2’s complement more negative numbers than
positive.
o For 1’s complement two representations for zero.
o For an n bit number in base (radix) z there are zn
different unsigned values.
(0, 1, …zn-1)
-8 in different Representation:
 1’s Complement Addition
 Using 1’s complement numbers, adding numbers is easy.
 For example, suppose we wish to add +(1100) 2 and
+(0001)2.
 Let’s compute (12)10 + (1)10.
 (12)10 = +(1100)2 = 011002 in 1’s comp.
 (1)10 = +(0001)2 = 000012 in 1’s comp.
0 1 1 0 0
Add + 0 0 0 0 1
Step 1: Add binary numbers --------------
Step 2: Add carry to low-order bit 0 0 1 1 0 1
Add carry 0
--------------
Final
Result
0 1 1 0 1
 1’s Complement Subtraction
 Using 1’s complement numbers, subtracting numbers is also
easy.
 For example, suppose we wish to subtract +(0001)2 from
+(1100)2.
 Let’s compute (12)10 - (1)10.
0 1 1 0 0
- 0 0 0 0 1
 (12)10 = +(1100)2 = 011002 in 1’s comp.
--------------
 (-1)10 = -(0001)2 = 111102 in 1’s comp.
1’s comp
0 1 1 0 0
Step 1: Take 1’s complement of 2nd operand Add + 1 1 1 1 0
Step 2: Add binary numbers
Step 3: Add carry to low order bit
--------------
1 0 1 0 1 0
Add carry 1
Final
--------------
Result 0 1 0 1 1
 2’s Complement Addition
 Using 2’s complement numbers, adding numbers is easy.
 For example, suppose we wish to add +(1100) 2 and
+(0001)2.
 Let’s compute (12)10 + (1)10.
 (12)10 = +(1100)2 = 011002 in 2’s comp.
 (1)10 = +(0001)2 = 000012 in 2’s comp.
0 1 1 0 0
Add + 0 0 0 0 1
Step 1: Add binary numbers --------------
Step 2: Ignore carry bit Final 0 0 1 1 0 1
Result

Ignore
 2’s Complement Subtraction
 Using 2’s complement numbers, follow steps for
subtraction
 For example, suppose we wish to subtract +(0001)2 from
+(1100)2. 0 1 1 0 0
 Let’s compute (12)10 - (1)10. - 0 0 0 0 1
 --------------
(12)10 = +(1100)2 = 011002 in 2’s comp.
 (-1)10 = -(0001)2 = 111112 in 2’s2’s
comp.
comp
0 1 1 0 0
Step 1: Take 2’s complement of 2nd operand Add + 1 1 1 1 1
Step 2: Add binary numbers
Step 3: Ignore carry bit
--------------
Final
Result 1 0 1 0 1 1

Ignore
Carry
2’s Complement Subtraction:
Example #2
 Let’s compute (13)10 – (5)10.
 (13)10 = +(1101)2 = (01101)2
 (-5)10 = -(0101)2 = (11011)2
 Adding these two 5-bit codes…
0 1 1 0 1
carry + 1 1 0 1 1
--------------
1 0 1 0 0 0
 Discarding the carry bit, the sign bit is seen to be

zero, indicating a correct result. Indeed,

(01000)2 = +(1000)2 = +(8)10.
2’s Complement Subtraction:
Example #3
 Let’s compute (5)10 – (12)10.
 (-12)10 = -(1100)2 = (10100)2
 (5)10 = +(0101)2 = (00101)2
 Adding these two 5-bit codes…
0 0 1 0 1
+ 1 0 1 0 0
--------------
1 1 0 0 1
 Here, there is no carry bit and the sign bit is 1. This
indicates a negative result, which is what we expect.
(11001)2 = -(7)10.
 Summary
 Binary numbers can also be represented in octal
and hexadecimal
 Easy to convert between binary, octal, and
hexadecimal
 Signed numbers represented in signed magnitude,
1’s complement, and 2’s complement
 2’s complement most important (only 1
representation for zero).
 Important to understand treatment of sign bit for
1’s and 2’s complement.
 Multiplication of decimal number
 Binary multiplication:
 Multiplication of unsigned binary numbers:
5X7=?
 Multiplication of Signed Binary Numbers:
 i) -5X7=?
i)-5X7=?
ii)-5X-7=?
iv)-6X4=?
Serial Binary Multiplier(Add-Shift Approach)
Implementation In Hardware: