CO-2011-4.ppt

For lecture Recalled from some earlier slides that the biggest positive number you can represent using 4-bit is 7 and the smallest negative you can represent is negative 8. So any time your addition results in a number bigger than 7 or less than negative 8, you have an overflow. Keep in mind is that whenever you try to add two numbers together that have different signs, that is adding a negative number to a positive number, overflow can NOT occur. Overflow occurs when you to add two positive numbers together and the sum has a negative sign. Or, when you try to add negative numbers together and the sum has a positive sign. If you spend some time, you can convince yourself that If the Carry into the most significant bit is NOT the same as the Carry coming out of the MSB, you have a overflow. * similarity of the binary representation of related instructions simplifies the hardware design * * * * * * * * * * * * Verification To confirm we have the correct answer, convert the 2s complement final product back to decimal. Final product: 11111 10110 Decimal value: -10 which is the CORRECT product of: (-5) x 2? * Fast Algorithm The previous algorithm requires a clock to ensure that the earlier addition has completed before shifting This algorithm can quickly set up most inputs – it then has to wait for the result of each add to propagate down – faster because no clock is involved -- Note: high transistor cost * Division 1001ten Quotient Divisor 1000ten | 1001010ten Dividend -1000 10 101 1010 -1000 10ten Remainder At every step, shift divisor right and compare it with current dividend if divisor i