Need to finish this chart, please
* Perform a division of two binary numbers (divide 0111
1010 by 0110) by creating a table to show steps taken, quotient
register value, divisor register value and remainder register value
for each iteration by following the steps described in the
following document. (Points will be deducted if steps are not
shown.)
Here is an example:
Quotient Divisor Remainder Iterat Step ion 0 Initial value 0000 (sll to be 8 bit) 0110 0000 (Dividend) 0111 1010 1 2 اک 3 1- Rem=Rem-Div 2a- Rem>=0, sll Q, Q_=_ 2b- Rem<0, Rem+=Div, sll Q, Q_=_ 3- srl Div 2- Rem=Rem-Div 2a- Rem>=0, sll Q, Q_=_ 2b- Rem<0 , Rem+=Div, sll Q, Q _=_ 3- srl Div 1- Rem=Rem-Div 2a- Rem>=0, sll Q, Q_=_ 2b- Rem<0 , Rem+=Div, sll Q, Q _=_ 3 - srl Div 1- Rem=Rem-Div 2a- Rem>=0, sll Q, Q_= 26- Rem<0 , Rem+=Div, sll Q, Q._=_ 3 - srl Div 1- Rem=Rem-Div 2a- Rem>=0, sll Q, Q_=_ 2b- Rem<0 , Rem+=Div, sll Q, Q_=_ 3 - srl Div 4 5
Example: Divide 0000 0111 by 0010 Quotient Divisor Remainder Iterat Step ion 0 Initial value 0000 0010 0000 0000 0111 (sll to be 8 bit) (=Dividend) 1 1.Rem=Rem-Div 2b. Rem<0, Rem+=Div, sll Q, QO=0 3. srl Div 0000 0000 0010 0000 0010 0000 0001 0000 1110 0111 0000 0111 0000 0111 0000 2 0000 0000 0000 0001 0000 0001 0000 0000 1000 1111 0111 0000 0111 0000 0111 3 0000 0000 0000 0000 1000 0000 1000 0000 0100 1111 1111 0000 0111 0000 0111 1. Rem=Rem-Div 2b. Rem<0, Rem+=Div, sll Q, QO=0 3. srl Div 1. Rem=Rem-Div 2b. Rem<0, Rem+=Div, sll Q, QO=0 3. srl Div 1. Rem=Rem-Div 2a. Rem>=0, sll Q, QO=1 3. srl Div 1. Rem=Rem-Div 2a. Rem>=0, sll Q, QO=1 3. srl Div 4 0000 0001 0001 0000 0100 0000 0100 0000 0010 0000 0011 0000 0011 0000 0011 5 0001 0011 0011 0000 0010 0000 0010 0000 0001 0000 0001 0000 0001 0000 0001
Need to finish this chart, please * Perform a division of two binary numbers (divide 0111 1010 by 0110) by creating a ta
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am