03. [20 marks] (a) The figure on the left below shows the Booth's Algorithm for Two's Complement Multiplication. The multiplier and multiplicand, each is n-bit, are placed in the Q and M registers, respectively. There is also a 1-bit register placed logically to the right of the least significant bit (Q) of the Q register and designated 03. A and Q are initialized too. The results of the multiplication will appear in the A and Q registers. The figure on the right below shows an example of 7x3. STARI A-0.0 M - Nuluplicand - Mutup C. 10000110111 10010011 1100 1601 10111 1110 0100 1 AAP 0.0 Shift Get A. Then 0111 100 0010 0100 LEID . 11 o 8 AA-M 0001 5101 00111 fourth cycle Excample of Boch Algorithm (3) Arithmeti Rida: 1.0.0-4 Note that Arithmetic Shift preserves the sign bit (the leftmost bit of A) Ves END Both Alert Two Compleet Multiplication Use the Booth's Algorithm to multiply 19 (multiplicand) by 23 (multiplier), where each number is represented using 6 bits. Show the steps following the format of the above example. (b) The figure on the right shows the flowchart for unsigned binary division. Note that when shifting left AQ, the rightmost bit of Q will be supplemented with a Follow this algorithm to divide 147 by 11, where register A and Q are 8 bits and register Mis 4 bits. Show the steps following the format of the example in part (a). Fresco toredan 03. [20 marks] (a) The figure on the left below shows the Booth's Algorithm for Two's Complement Multiplication. The multiplier and multiplicand, each is n-bit, are placed in the Q and M registers, respectively. There is also a 1-bit register placed logically to the right of the least significant bit (Q) of the Q register and designated 03. A and Q are initialized too. The results of the multiplication will appear in the A and Q registers. The figure on the right below shows an example of 7x3. STARI A-0.0 M - Nuluplicand - Mutup C. 10000110111 10010011 1100 1601 10111 1110 0100 1 AAP 0.0 Shift Get A. Then 0111 100 0010 0100 LEID . 11 o 8 AA-M 0001 5101 00111 fourth cycle Excample of Boch Algorithm (3) Arithmeti Rida: 1.0.0-4 Note that Arithmetic Shift preserves the sign bit (the leftmost bit of A) Ves END Both Alert Two Compleet Multiplication Use the Booth's Algorithm to multiply 19 (multiplicand) by 23 (multiplier), where each number is represented using 6 bits. Show the steps following the format of the above example. (b) The figure on the right shows the flowchart for unsigned binary division. Note that when shifting left AQ, the rightmost bit of Q will be supplemented with a Follow this algorithm to divide 147 by 11, where register A and Q are 8 bits and register Mis 4 bits. Show the steps following the format of the example in part (a). Fresco toredan
