week 4 & 5 introduction to number systems - psau · week 4 & 5 introduction to number...

Week 4 & 5 Introduction to number systems

• Number systems and heir conversions – Decimal, Binary, Octal, Hex decimal

• Arithmetic operations • Binary Addition

• Binary Subtraction

• Binary Multiplications

• Binary Division

• Signed and Magnitude numbers Complement numbers

• Binary Coded decimal numbers

Common Number Systems

System

Base

Symbols

Used by

humans?

Used in

computers?

Decimal 10 0, 1, … 9 Yes No

Binary 2 0, 1 No Yes

Octal 8 0, 1, … 7 No No

Hexa-

decimal

16 0, 1, … 9,

A, B, … F

No No

Quantities/Counting (1 of 3)

Decimal

Binary

Octal

Hexa-

decimal

0 0 0 0

1 1 1 1

2 10 2 2

3 11 3 3

4 100 4 4

5 101 5 5

6 110 6 6

7 111 7 7 p. 33


Decimal

Binary

Octal

Hexa-

decimal

8 1000 10 8

9 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


Decimal

Binary

Octal

Hexa-

decimal

16 10000 20 10

17 10001 21 11

18 10010 22 12

19 10011 23 13

20 10100 24 14

21 10101 25 15

22 10110 26 16

23 10111 27 17 Etc.

Conversion Among Bases

• The possibilities:

Hexadecimal

Decimal Octal

Binary

pp. 40-46

Binary to Decimal

Hexadecimal

Decimal Octal

Binary

Binary to Decimal

• Technique

– Multiply each bit by 2n, where n is the “weight” of the bit

– The weight is the position of the bit, starting from 0 on the right

– Add the results

Example

1010112 => 1 x 20 = 1

1 x 21 = 2

0 x 22 = 0

1 x 23 = 8

0 x 24 = 0

1 x 25 = 32

4310

Bit “0”

Octal to Decimal

Hexadecimal

Decimal Octal

Binary

Octal to Decimal

• Technique



– Add the results

Example

7248 => 4 x 80 = 4

2 x 81 = 16

7 x 82 = 448

46810

Hexadecimal to Decimal

Hexadecimal

Decimal Octal

Binary

Hexadecimal to Decimal

• Technique



– Add the results

Example

ABC16 => C x 160 = 12 x 1 = 12

B x 161 = 11 x 16 = 176

A x 162 = 10 x 256 = 2560

274810

Decimal to Binary

Hexadecimal

Decimal Octal

Binary

Decimal to Binary

• Technique

– Divide by two, keep track of the remainder

– First remainder is bit 0 (LSB, least-significant bit)

– Second remainder is bit 1

– Etc.

Example 12510 = ?2

2 125

62 1 2

31 0 2

15 1 2

7 1 2

3 1 2

1 1 2

0 1

12510 = 11111012

Octal to Binary

Hexadecimal

Decimal Octal

Binary

Octal to Binary

• Technique

– Convert each octal digit to a 3-bit equivalent binary representation

Example 7058 = ?2

7 0 5

111 000 101

7058 = 1110001012

Hexadecimal to Binary

Hexadecimal

Decimal Octal

Binary

Hexadecimal to Binary

• Technique

– Convert each hexadecimal digit to a 4-bit equivalent binary representation

Example 10AF16 = ?2

1 0 A F

0001 0000 1010 1111

10AF16 = 00010000101011112

Decimal to Octal

Hexadecimal

Decimal Octal

Binary

Decimal to Octal

• Technique

– Divide by 8

– Keep track of the remainder

Example 123410 = ?8

8 1234

154 2 8

19 2 8

2 3 8

0 2

123410 = 23228

Decimal to Hexadecimal

Hexadecimal

Decimal Octal

Binary

Octal to Hexadecimal

• Technique

– Use binary as an intermediary

Example 10768 = ?16

1 0 7 6

001 000 111 110

2 3 E

10768 = 23E16

Hexadecimal to Octal

Hexadecimal

Decimal Octal

Binary


• Technique


Example 1F0C16 = ?8

1 F 0 C

0001 1111 0000 1100

1 7 4 1 4

1F0C16 = 174148

Exercise – Convert ...

Don’t use a calculator!

Decimal

Binary

Octal

Hexa-

decimal

33

1110101

703

1AF

Skip answer Answer

Exercise – Convert …

Decimal

Binary

Octal

Hexa-

decimal

33 100001 41 21

117 1110101 165 75

451 111000011 703 1C3

431 110101111 657 1AF

Answer

Common Powers (1 of 2)

• Base 10 Power Preface Symbol

10-12 pico p

10-9 nano n

10-6 micro

10-3 milli m

103 kilo k

106 mega M

109 giga G

1012 tera T

Value

.000000000001

.000000001

.000001

.001

1000

1000000

1000000000

1000000000000



210 kilo k

220 mega M

230 Giga G

Value

1024

1048576

1073741824

• What is the value of “k”, “M”, and “G”?

• In computing, particularly w.r.t. memory, the base-2 interpretation generally applies

Decimal to Hexadecimal

• Technique

– Divide by 16

– Keep track of the remainder

Example 123410 = ?16

123410 = 4D216

16 1234

77 2 16

4 13 = D 16

0 4

Binary to Octal

Hexadecimal

Decimal Octal

Binary

Binary to Octal

• Technique

– Group bits in threes, starting on right

– Convert to octal digits

Example 10110101112 = ?8

1 011 010 111

1 3 2 7

10110101112 = 13278

Binary to Hexadecimal

Hexadecimal

Decimal Octal

Binary

Binary to Hexadecimal

• Technique

– Group bits in fours, starting on right

– Convert to hexadecimal digits

Example 10101110112 = ?16

10 1011 1011

2 B B

10101110112 = 2BB16


Hexadecimal

Decimal Octal

Binary


• Technique


Example 10768 = ?16

1 0 7 6

001 000 111 110

2 3 E

10768 = 23E16


Hexadecimal

Decimal Octal

Binary


• Technique


Example 1F0C16 = ?8

1 F 0 C

0001 1111 0000 1100

1 7 4 1 4

1F0C16 = 174148



Decimal

Binary

Octal

Hexa-

decimal

33

1110101

703

1AF

Skip answer Answer


Decimal

Binary

Octal

Hexa-

decimal

33 100001 41 21

117 1110101 165 75

451 111000011 703 1C3

431 110101111 657 1AF

Answer

Fractions

• Decimal to decimal (just for fun)

pp. 46-50

3.14 => 4 x 10-2 = 0.04

1 x 10-1 = 0.1

3 x 100 = 3

3.14

Fractions

• Binary to decimal

pp. 46-50

10.1011 => 1 x 2-4 = 0.0625

1 x 2-3 = 0.125

0 x 2-2 = 0.0

1 x 2-1 = 0.5

0 x 20 = 0.0

1 x 21 = 2.0

2.6875

Fractions

• Decimal to binary

p. 50

3.14579

.14579

x 2

0.29158

x 2

0.58316

x 2

1.16632

x 2

0.33264

x 2

0.66528

x 2

1.33056

etc. 11.001001...



Decimal

Binary

Octal

Hexa-

decimal

29.8

101.1101

3.07

C.82

Skip answer Answer


Decimal

Binary

Octal

Hexa-

decimal

29.8 11101.110011… 35.63… 1D.CC…

5.8125 101.1101 5.64 5.D

3.109375 11.000111 3.07 3.1C

12.5078125 1100.10000010 14.404 C.82

Answer

TU/e Processor Design 5Z032 59

• Sign Magnitude: One's Complement Two's Complement

000 = +0 000 = +0 000 = +0 001 = +1 001 = +1 001 = +1 010 = +2 010 = +2 010 = +2 011 = +3 011 = +3 011 = +3 100 = -0 100 = -3 100 = -4 101 = -1 101 = -2 101 = -3 110 = -2 110 = -1 110 = -2 111 = -3 111 = -0 111 = -1

• Issues: balance, number of zeros, ease of operations

• Which one is best? Why?

Signed binary numbers Possible representations:



10-12 pico p

10-9 nano n

10-6 micro

10-3 milli m

103 kilo k

106 mega M

109 giga G

1012 tera T

Value

.000000000001

.000000001

.000001

.001

1000

1000000

1000000000

1000000000000



210 kilo k

220 mega M

230 Giga G

Value

1024

1048576

1073741824

• What is the value of “k”, “M”, and “G”?

• In computing, particularly w.r.t. memory, the base-2 interpretation generally applies

Binary Addition (1 of 2)

• Two 1-bit values

pp. 36-38

A B A + B

0 0 0

0 1 1

1 0 1

1 1 10 “two”

Binary Addition (2 of 2)

• Two n-bit values

– Add individual bits

– Propagate carries

– E.g.,

10101 21

+ 11001 + 25

101110 46

1 1

CS1104-2 Binary Arithmetic Operations 64

Binary Arithmetic Operations (3/6)

SUBTRACTION

Two numbers can be subtracted by subtracting each pair of digits together with borrowing, where needed.

(11001)2

- (10011)2

(00110)2

(627)10

- (537)10

(090)10



Digit subtraction table:

BINARY DECIMAL

0 - 0 - 0 = 0 0 0 - 0 - 0 = 0 0

0 - 1 - 0 = 1 1 0 - 1 - 0 = 1 9

1 - 0 - 0 = 0 1 0 - 2 - 0 = 1 8

1 - 1 - 0 = 0 0 …

0 - 0 - 1 = 1 1 0 - 9 - 1 = 1 0

0 - 1 - 1 = 1 0 1 - 0 - 1 = 0 0

1 - 0 - 1 = 0 0 …

1 - 1 - 1 = 1 1 9 - 9 - 1 = 1 9

Borrow

(11001)2

- (10011)2

(00110)2

0

1 1

0

0

0

0 1

1

1

1

0 0

1

1

1

1 0

0

0

0

1 1

0

0

0

0 0

0

0



MULTIPLICATION

To multiply two numbers, take each digit of the multiplier and multiply it with the multiplicand. This produces a number of partial products which are then added.

(11001)2 (214)10 Multiplicand

x (10101)2 x (152)10 Multiplier

(11001)2 (428)10

(11001)2 (1070)10 Partial

+(11001)2 +(214)10 products

(1000001101)2 (32528)10 Result



Digit multiplication table:

DIVISION – can you figure out how this is done? Exercise: Think of the division technique (shift & subtract)

used for decimal numbers and apply it to binary numbers.

BINARY DECIMAL

0 X 0 = 0 0 X 0= 0

0 X 1= 0 0 X 1= 0

1 X 0 = 0 …

1 X 1= 1 1 X 8 = 8

1 X 9= 9

…

9 X 8 = 72

9 X 9 = 81

Multiplication (1 of 3)

• Decimal (just for fun)

pp. 39

35

x 105

175

000

35

3675


• Binary, two 1-bit values

A B A B

0 0 0

0 1 0

1 0 0

1 1 1


• Binary, two n-bit values

– As with decimal values

– E.g., 1110

x 1011

1110

1110

0000

1110

10011010

CS1104-2 Negative Numbers: Sign-and-Magnitude 71

Negative Numbers: Sign-and-Magnitude (1/4)

Negative numbers are usually written by writing a minus sign in front.

Example:

- (12)10 , - (1100)2

In sign-and-magnitude representation, this sign is usually represented by a bit:

0 for +

1 for -

CS1104-2 Negative Numbers:Sign-and-Magnitude 72

Negative Numbers: Sign-and-Magnitude (2/4)

Example: an 8-bit number can have 1-bit sign and 7-bit magnitude.

sign magnitude

CS1104-2 1s and 2s Complement 73

1s and 2s Complement

Two other ways of representing signed numbers for binary numbers are:

1s-complement

2s-complement

They are preferred over the simple sign-and-magnitude representation.

CS1104-2 1s Complement 74

1s Complement (1/3)

Given a number x which can be expressed as an n-bit binary number, its negative value can be obtained in 1s-complement representation using:

- x = 2n - x - 1

Example: With an 8-bit number 00001100, its negative value, expressed in 1s complement, is obtained as follows:

-(00001100)2 = - (12)10

= (28 - 12 - 1)10

= (243)10

= (11110011)1s


1s Complement (2/3)

Essential technique: invert all the bits. Examples: 1s complement of (00000001)1s = (11111110)1s

1s complement of (01111111)1s = (10000000)1s

Largest Positive Number: 0 1111111 +(127)10

Largest Negative Number: 1 0000000 -(127)10

Zeroes: 0 0000000 1 1111111

Range: -(127)10 to +(127)10

The most significant bit still represents the sign:

0 = +ve; 1 = -ve.


1s Complement (3/3)

Examples (assuming 8-bit binary numbers):

(14)10 = (00001110)2 = (00001110)1s

-(14)10 = -(00001110)2 = (11110001)1s

-(80)10 = -( ? )2 = ( ? )1s


2s Complement (1/4)

Given a number x which can be expressed as an n-bit binary number, its negative number can be obtained in 2s-complement representation using:

- x = 2n - x

Example: With an 8-bit number 00001100, its negative value in 2s complement is thus:

-(00001100)2 = - (12)10

= (28 - 12)10

= (244)10

= (11110100)2s


2s Complement (2/4)

Essential technique: invert all the bits and add 1.

Examples:

2s complement of

(00000001)2s = (11111110)1s (invert)

= (11111111)2s (add 1)

2s complement of

(01111110)2s = (10000001)1s (invert)

= (10000010)2s (add 1)


2s Complement (3/4)

Largest Positive Number: 0 1111111 +(127)10

Largest Negative Number: 1 0000000 -(128)10

Zero: 0 0000000

Range: -(128)10 to +(127)10

The most significant bit still represents the sign:

0 = +ve; 1 = -ve.


2s Complement (4/4)

Examples (assuming 8-bit binary numbers):

(14)10 = (00001110)2 = (00001110)2s

-(14)10 = -(00001110)2 = (11110010)2s

-(80)10 = -( ? )2 = ( ? )2s

CS1104-2 Binary Coded Decimal (BCD) 81

Binary Coded Decimal (BCD) (1/3)

Decimal numbers are more natural to humans. Binary numbers are natural to computers. Quite expensive to convert between the two.

If little calculation is involved, we can use some coding schemes for decimal numbers.

One such scheme is BCD, also known as the 8421 code.

Represent each decimal digit as a 4-bit binary code.



Some codes are unused, eg: (1010)BCD, (1011) BCD, …, (1111)

BCD. These codes are considered as errors.

Easy to convert, but arithmetic operations are more complicated.

Suitable for interfaces such as keypad inputs and digital readouts.

Decimal digit 0 1 2 3 4

BCD 0000 0001 0010 0011 0100


BCD 0101 0110 0111 1000 1001



Examples:

(234)10 = (0010 0011 0100)BCD

(7093)10 = (0111 0000 1001 0011)BCD

(1000 0110)BCD = (86)10

(1001 0100 0111 0010)BCD = (9472)10

Notes: BCD is not equivalent to binary.

Example: (234)10 = (11101010)2


BCD 0000 0001 0010 0011 0100


BCD 0101 0110 0111 1000 1001

week 4 & 5 introduction to number systems - psau · week 4 & 5 introduction to number...

Documents