SlideServe
Menu
Préférences
© SlideServe · v2026

Cosc 2150: Computer Organization

alcina avatar
21 diapositives · 443 Views · Aug 07, 2014

Cosc 2150: Computer Organization . Chapter 9, Part 2 Integer multiplication and division. Multiplication. Complex Work out partial product for each digit Take care with place value (column) Add partial products. Multiplication Example (unsigned) (long hand).

Cosc 2150: Computer Organization - slide 1
01 / 21Cosc 2150: Computer Organization
1 / 17

Télécharger la présentation

Cosc 2150: Computer Organization
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation
  1. Cosc 2150:Computer Organization Chapter 9, Part 2 Integer multiplication and division

  2. Multiplication • Complex • Work out partial product for each digit • Take care with place value (column) • Add partial products

  3. Multiplication Example (unsigned) (long hand) • 1011 Multiplicand (11 dec) • x 1101 Multiplier (13 dec) • 1011 Partial products • 00000 Note: if multiplier bit is 1 copy • 101100 multiplicand (place value) • 1011000 otherwise zero • 10001111 Product (143 dec) • Note: need double length result

  4. Flowchart for Unsigned Binary Multiplication

  5. Execution of Example

  6. Multiplying Negative Numbers • This does not work! • Solution 1 • Convert to positive if required • Multiply as above • If signs were different, negate answer • Solution 2 • Booth’s algorithm

  7. Booth’s Algorithm

  8. Example of Booth’s Algorithm • 3*7 • First setup the columns and initial values. • This case 3 is in Q and M is 7. • But could put 7 in Q and M as 3

  9. Example of Booth’s Algorithm • First cycle: Now look at Q0 and Q-1 • With a 10, we Sub (A=A-M), then shift (always to the right) • Second cycle: looking at Q0 and Q-1 • With a 11, we only shift.

  10. Example of Booth’s Algorithm • 2nd cycle Result • Third cycle, Q0 and Q-1 have 01 • So we will Add (A=A+M), then shift

  11. Example of Booth’s Algorithm • 3nd cycle Result • 4th cycle, Q0 and Q-1 have 00 • So we only shift

  12. Example of Booth’s Algorithm • 4nd cycle Result • 5th cycle, Q0 and Q-1 have 00 • So we only shift

  13. Example of Booth’s Algorithm 5th cycle Result Since we are working in 5 bits, we only repeat 5 times

  14. Example of Booth’s Algorithm Result is A and Q so 0000010101 which is 21. Note: The sign bit is the last bit in A.

  15. Division • More complex than multiplication • Negative numbers are really bad! • Based on long division

  16. Division of Unsigned Binary Integers Quotient 00001101 Divisor 1011 10010011 Dividend 1011 001110 Partial Remainders 1011 001111 1011 Remainder 100

  17. Flowchart for Unsigned Binary Division

  18. Signed Division 1. Load divisor into M and the dividend into A, Q registers. Dividend must be 2n-bit twos complement number • 0111 (7) becomes 00000111 • 1001 (-7) becomes 11111001 2. Shift A, Q left 1 bit position 3. If M and A have the same signs, AA –M else AA+M

  19. 4. Step 3 is successful if sign of A is the same as before step 3 and at the end of step 3 • if successful or (A=0 AND Q=0) then set Q01 • if unsuccessful and (A  0 OR Q0) then restore the previous value of A 5. Repeat steps 2 through 4 as many times as there are bit positions in Q. 6. The reminder is in A. If the signs are of Divisor and dividend were the same, the quotient is in Q, otherwise the correct quotient is the twos complement of Q.

  20. Examples of division (signed) (a) 7/3 (b) -7/3

  21. Q A &