Computer Arithmetic
Download as PPTX, PDF0 likes1,377 views
This document discusses various computer arithmetic operations including addition, subtraction, multiplication, and division for signed magnitude and two's complement data representations. It describes the Booth multiplication algorithm, array multipliers for performing multiplication using combinational circuits, and the division algorithm. It also covers detecting divide overflow conditions.
Related topics:1 of 21
Downloaded 14 times
More Related Content
What's hot (20)
Ad
Similar to Computer Arithmetic (20)
Ad
More from Kamal Acharya (20)
Computer Arithmetic
- 1. Addition and subtraction of Signed Magnitude Data Addition and subtraction of Signed 2’s Complement Data Multiplication of Signed Magnitude Data Booth Multiplication Algorithm Division Algorithm Computer Arithmetic
- 10. Signed 2’s Complement Multiplication
- 13. Array Multiplier Checking the 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 j multiplier 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 The hardware 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 Dividend is 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.