Chap 3. Arithmetic for Computers

Chap 3. Arithmetic for Computers

ADD / SUB

* Binary Addition / Binary subtraction  

* Overflow Case ( 1. (+) + (+) = (-) / 2. (-) + (-) = (+) / 3. (+) - (-) = (-) / 4. (-) - (+) = (+) )

* C/JAVA : ignore overflow / Ada/Fortran : notify 

MUL / DIV

* Multiplication : multiplicand(32/ shift left) * multiplier(32/ shift right) = product(64)

* improving Multiplication : 64 bit register ( product 32 bit / multiplier 32 bit(shift right) )

* Multiple adder 

* Division : Remainder(dividend) / divisor(64 / shift right) = quotient(shift left) + Remainder

* improving Division : 64 bit register ( Remainder 32 bit / quotient 32 bit(shift left) )

FP

* Floating point : 1.xxx * 2^y -> x : fraction, y : exponent

* MIPS - s 1 bit / exp 8 bit / frac 23 bit

* MIPS - single precision / double precision

* Floating point exponent + 127 (for sorting)

* Floating point expression / Floating point addition / Floating point circuit

* Floating point instruction ( ***.s, ***d, c.x.s)

* Floating point Hardware ($f0~ $f31) 

* $gp(global variable) / Floating point don't need $a(argument) $v(return value) only $f($f12)