computing machinery chapter 6: computer arithmetic

Computing MachineryChapter 6: Computer Arithmetic

Integer Representations

1

0

2n

i

iibM

0000000000000000000000000000000 = +00000000000000000000000000000001 = +10000000000000000000000000000010 = +2

:0111111111111111111111111111111 = +2,147,483,6471000000000000000000000000000000 = -01000000000000000000000000000001 = -11000000000000000000000000000010 = -21111111111111111111111111111111 = -2,147,483,647

2

02)1( 1

n

i

ii

b bM n

1248163264128

22222222 01234567

Magnitudes of Binary Encoded Base Positions

Two's Complement

1. Generate the magnitude of the value in binary

2. Invert each bit of the binary number (0 becomes 1 and 1 becomes 0), called 1's complement

3. Add one (1) to the one's complement to produce the two's complement. (Ignore any overflow.)

34/2 = 17 remainder 0 _ _ _ _ _ _ _ 017/2 = 8 remainder 1 _ _ _ _ _ _ 1 0 8/2 = 4 remainder 0 _ _ _ _ _ 0 1 0 4/2 = 2 remainder 0 _ _ _ _ 0 0 1 0 2/2 = 1 remainder 0 _ _ _ 0 0 0 1 0 1/2 = 0 remainder 1 _ _ 1 0 0 0 1 0 0/2 = 0 remainder 0 _ 0 1 0 0 0 1 0 0/2 = 0 remainder 0 0 0 1 0 0 0 1 0

0 0 1 0 0 0 1 0 <- magnitude of -341 1 0 1 1 1 0 1 <- one's complement+ 11 1 0 1 1 1 1 0 <- two's complement

Example: -34 in two's complement

Converting Between Binary, Octal, and Hexadecimal

binary octal hexadecimal decimal0000 0 0 00001 1 1 10010 2 2 20011 3 3 30100 4 4 40101 5 5 50110 6 6 60111 7 7 71000 10 8 81001 11 9 91010 12 A 101011 13 B 111100 14 C 121101 15 D 131110 16 E 141111 17 F 15

01001100100111011111

01 001 100 100 111 011 111 1 1 4 4 7 3 7

0100 1100 1001 1101 1111 4 C 9 D F

Integer Addition and Subtraction

Finite Represenation in Two's Complement

IEEE Single-Precision Floating Point

IEEE Representation of

IEEE Special Values

Integer Multiplication (Unsigned)

Integer Multiplication Hardware

Integer Multiplication (signed)

standard

Booth's Recoding

Booth's recoding reduces the number of computations, which reduces the amount of hardware and time required to perform a multiplication

Booth's Multiplication

3 0011 M -M = 1101 x7 0111 Q

A Q Q-1 N

0 0 0 0 0 1 1 1 0 4+1 1 0 1 1 1 0 1 0 1 1 1 0 1 1 1 0 1 0 1 1 1 3

1 1 1 1 0 1 0 1 1 2

1 1 1 1 1 0 1 0 1 1+0 0 1 1 0 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0

00010101 = 21

Integer Division

rebuilding the dividend, Q

recurrence relation for bitwiseinteger division

with remainder

Integer Division (restoring)

Integer Division (non-restoring)

reformulating the recurrence relation

restoring test can be done once at the end of the division

Booth's Integer Division

IEEE Floating-Point Multiplication

POWER2 Floating-Point Unit (FPU) Architecture

http://www-03.ibm.com/servers/eserver/pseries/hardware/whitepapers/power/fpu.html

The IBM POWER2 Floating-Point Unit is a hardware implementation of arithmetic operations on IEEE format floating-point numbers.

"The FPU receives two instructions from the instruction cache unit (ICU). These two instructions go through a predecode stage where the FPU discards non-floating-point instructions.

The MAF unit performs all of the floating-point arithmetic instructions, such as the multiply-add fused operation, as well as all floating-point store operations."

http://www-03.ibm.com/servers/eserver/pseries/hardware/whitepapers/power/fpu.html

FPU Arithmetic Unit