Lecture5 Data Representn

Data Representation
CMT 102: Fundamentals of

Computing
Outline
Positional Number Systems

Binary and Hexadecimal Numbers
Base Conversions
Integer Storage Sizes
Binary and Hexadecimal Addition
Signed Integers and 2's Complement
Notation
Sign Extension
Binary and Hexadecimal subtraction
Carry and Overflow
Character Storage
10/19/16
Positional Number
Systems
Different Representations of Natural Numbers
XXVII Roman numerals (not positional)
27 Radix-10 or decimal number (positional)
110112 Radix-2 or binary number (also positional)
Fixed-radix positional representation with k
digits
Number N in radix r = (dk1dk2 . . . d1d0)r
Value = dk1r
k1
+ dk2r
k2
+ + d1r + d0
Examples: (11011)2 = 124 + 123 + 022 + 12

10/19/16
3
+ 1 = 27
Binary Numbers
Each binary digit (called bit) is either 1 or 0
Bits have no inherent meaning, can represent
Unsigned and signed integers
Characters
Floating-point numbers
Images, sound, etc.
Most
Significant
Bit
Least
Significant
Bit
27
26
25
24
23
22
21
20
Bit Numbering
Least significant bit (LSB) is rightmost (bit 0)
Most significant bit (MSB) is leftmost (bit 7 in an 8-bit number)

10/19/16
Converting Binary to
Decimal
Each bit represents a power of 2
Every binary number is a sum of powers of 2
Decimal Value = (dn-1 2n-1) + ... + (d1 21) + (d0 20)
Binary (10011101)2 = 27 + 24 + 23 + 22 + 1 = 157
27
26
25
24
23
22
21
20
Some
common
powers of 2
10/19/16
Convert Unsigned Decimal to

Binary
Repeatedly divide the decimal integer by 2

Each remainder is a binary digit in the translated value
least significant bit
37 =
(100101)2
most significant bit
10/19/16
stop when quotient is

zero6
Hexadecimal Integers
16 Hexadecimal Digits: 0 9, A F
More convenient to use than binary numbers
Binary, Decimal, and Hexadecimal
Equivalents
10/19/16
Converting Binary to
Hexadecimal
Each hexadecimal digit corresponds to 4 binary bits
Example:
Convert the 32-bit binary number to hexadecimal
1110 1011 0001 0110 1010 0111 1001 0100
Solution:
1110
1011
0001
0110
1010
0111
1001
0100
10/19/16
Converting Hexadecimal to
Decimal
Multiply each digit by its corresponding power of 16

Value = (dn-1 16n-1) + (dn-2 16n-2) + ... + (d1 16) + d0
Examples:
(1234)16 = (1 163) + (2 162) + (3 16) + 4 =
Decimal Value 4660
(3BA4)16 = (3 163) + (11 162) + (10 16) + 4 =
Decimal Value 15268
10/19/16
Converting Decimal to
Hexadecimal
Repeatedly divide the decimal integer by 16
Each remainder is a hex digit in the translated value
least significant digit
most significant
digit
stop when
quotient is
zero
Decimal 422 = 1A6 hexadecimal

10/19/16
10

Byte
Half Word
Storage Sizes
16
Word
32
Double
Word
64
Storage Type
Unsigned Range
Powers of 2
Byte
0 to 255
0 to (28 1)
Half Word
0 to 65,535
0 to (216 1)
Word
0 to 4,294,967,295
0 to (232 1)
Double Word
0 to 18,446,744,073,709,551,615
0 to (264 1)
What is the largest 20-bit unsigned

integer?
Answer: 220 1 = 1,048,575
10/19/16
11

contd.
BIT NIBBLE BYTE
1
4 bits
10/19/16
8 bits
KILOBYTE MEGA
GIGABYTE
(Kb)
BYTE (Mb) (Gb)
1,024
bytes
1,024
kilobytes
1024
megabytes
12
TERABYT
E (Tb)
1024
gigabytes
Binary Addition
Start with the least significant bit (rightmost bit)
Add each pair of bits
Include the carry in the addition, if present

carry
(54)
(29)
(83)
bit position: 7
10/19/16
13
Hexadecimal Addition
Start with the least significant hexadecimal digits
Let Sum = summation of two hex digits
If Sum is greater than or equal to 16
Sum = Sum 16 and Carry = 1
Example:
carry:
1 1
1C37286A
+
9395E84B
AFCD10B5
10/19/16
A + B = 10 + 11 =
21
Since 21 16
Sum = 21 16 = 5
Carry = 1
14
Signed Integers
Several ways to represent a signed number
Divide the range of values into 2 equal parts
Sign-Magnitude
Biased
1's complement
2's complement
First part corresponds to the positive numbers ( 0)
Second part correspond to the negative numbers (< 0)
Focus will be on the 2's complement representation
Has many advantages over other representations

Used widely in processors to represent signed integers
10/19/16
15
Two's Complement
Representation
Positive numbers
Signed value = Unsigned value
Negative numbers
Signed value = Unsigned value
2n n = number of bits
Negative weight for MSB

Another way to obtain the
signed value is to assign a
negative weight to mostsignificant bit
1
-128 64
32
16
= -128 + 32 + 16 + 4 = -76
8-bit Binary
value
Unsigne
d
value
Signed
value
00000000
00000001
+1
00000010
+2
...
...
...
01111110
126
+126
01111111
127
+127
10000000
128
-128
10000001
129
-127
...
...
...
11111110
254
-2
11111111
255
-1
Forming the Two's

Complement
starting value
00100100 = +36
step1: reverse the bits (1's complement)
11011011
step 2: add 1 to the value from step 1
sum = 2's complement representation
11011100 = -36
Sum of an integer and its 2's complement must

be zero:
00100100 + 11011100 = 00000000 (8-bit sum) Ignore
Binary Value
Another way to obtain the 2's
Carry
least
complement:
= 00100 1 00 significant
1
Start at the least significant 1
2's Complement
Leave all the 0s to its right
= 11011 1 00
unchanged
Complement all the bits to its left
Sign Bit
Highest bit indicates the sign

1 = negative
Sign
bit
1
Negative
Positive
0 = positive
For Hexadecimal Numbers, check most significant

digit
If highest digit is > 7, then value is negative
Examples: 8A and C5 are negative bytes
B1C42A00
is a negative word (32-bit signed integer)
10/19/16
18
Sign Extension
Step 1: Move the number into the lower-significant bits
Step 2: Fill all the remaining higher bits with the sign bit
This will ensure that both magnitude and sign are correct
Examples
Sign-Extend
to 16 11111111
bits
10110011 =10110011
-77
10110011 = -77
Sign-Extend 01100010 to 16 bits
01100010 = +98
00000000 01100010 = +98
Infinite 0s can be added to the left of a positive number

Infinite 1s can be added to the left of a negative number
10/19/16
19
Two's Complement of a Hexadecimal
To form the two's complement of a hexadecimal
Subtract each hexadecimal digit from 15
Add 1
Examples:
2's complement of 6A3D = 95C2 + 1 = 95C3
2's complement of 92F15AC0 = 6D0EA53F + 1 = 6D0EA540
2's complement of FFFFFFFF = 00000000 + 1 = 00000001
No need to convert hexadecimal to binary
10/19/16
20
Binary Subtraction
When subtracting A B, convert B to its 2's complement

Add A to (B)
borro
w:
1 1
carry 1 1
:
1 1
101
0 1 0 0 1 1 0 1 0 1 0 0 1 +
0 0 1 1 1 0 1 0 1 1 0 0 0 1 1 0 (2's complement)
0 0 0 1 0 0 1 1 0 0 0 1 0 0 1 1 (same result)
Final carry is ignored, because
Negative number is sign-extended with 1's

You can imagine infinite 1's to the left of a negative number
Adding the carry to the extended 1's produces extended zeros
10/19/16
21

Lecture5 Data Representn

Uploaded by

Copyright:

Available Formats

Lecture5 Data Representn

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lecture5 Data Representn

Uploaded by

Copyright:

Available Formats

Data Representation

CMT 102: Fundamentals of

Positional Number Systems

Examples: (11011)2 = 124 + 123 + 022 + 12

Each binary digit (called bit) is either 1 or 0

Bits have no inherent meaning, can represent

Unsigned and signed integers

Images, sound, etc.

Least significant bit (LSB) is rightmost (bit 0)

Most significant bit (MSB) is leftmost (bit 7 in an 8-bit number)

Each bit represents a power of 2

Every binary number is a sum of powers of 2

Decimal Value = (dn-1 2n-1) + ... + (d1 21) + (d0 20)

Binary (10011101)2 = 27 + 24 + 23 + 22 + 1 = 157

Convert Unsigned Decimal to

Repeatedly divide the decimal integer by 2

most significant bit

stop when quotient is

Multiply each digit by its corresponding power of 16

least significant digit

Decimal 422 = 1A6 hexadecimal

Integer Storage Sizes

What is the largest 20-bit unsigned

Integer Storage Sizes

Start with the least significant bit (rightmost bit)

Add each pair of bits

Include the carry in the addition, if present

Start with the least significant hexadecimal digits

Let Sum = summation of two hex digits

If Sum is greater than or equal to 16

Sum = Sum 16 and Carry = 1

Several ways to represent a signed number

Divide the range of values into 2 equal parts

Focus will be on the 2's complement representation

Has many advantages over other representations

Negative weight for MSB

Forming the Two's

step1: reverse the bits (1's complement)

step 2: add 1 to the value from step 1

sum = 2's complement representation

Sum of an integer and its 2's complement must

Highest bit indicates the sign

For Hexadecimal Numbers, check most significant

Sign-Extend 01100010 to 16 bits

00000000 01100010 = +98

Infinite 0s can be added to the left of a positive number

Two's Complement of a Hexadecimal

To form the two's complement of a hexadecimal

Subtract each hexadecimal digit from 15

No need to convert hexadecimal to binary

When subtracting A B, convert B to its 2's complement

Final carry is ignored, because

Negative number is sign-extended with 1's

You might also like