Downloaded 14 times
More Related Content
More from Kamal Acharya
Computer Arithmetic
- 1. Addition and subtractionof Signed Magnitude Data Addition and subtraction of Signed 2’s Complement Data Multiplication of Signed Magnitude Data Booth Multiplication Algorithm Division Algorithm Computer Arithmetic
- 7.
- 10. Signed 2’s ComplementMultiplication
- 13. Array Multiplier Checkingthe bit of multiplier adding and then shifting is sequential operation. Multiplication can also be done with the help of combinational circuits in which whole operation can be performed in one cycle. This circuit is the array multiplier.
- 16. For jmultiplier bits and k multiplicand bits we need j*k AND gates and (j-1) k bits adder to produce a product of j+k bits.
- 17. Division Algorithm Thehardware required for this is same as that of the multiplication of signed magnitude data. Sign and magnitude of the divisor and dividend are treated separately. Example shows the division of 0111000000 by 10001 here in both case only magnitude bits are used.
- 19. Divide Overflow Dividendis twice bit long then divisor. The condition of overflow can be detected when the upper half of the dividend is greater or equal to the divisor. Another problem is division by 0. In case of overflow DVF(divide overflow flag) is used to indicate the condition.