Consider the multiplication aalgorithm for C2 multiplication based on add and sh...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Consider the multiplication aalgorithm for C2 multiplication based on add and shift for operands of 4 bits.
Give the iterative values of Z[8:4] and Z[3:0] and the performed operation.
X = -510 (10112) * Y = -410 (11002)
Nota:
| In each row, you give the value of Z[8:4] and Z[3:0] in binary with all necessary bits just after the iteration operation.
In the field "Operation" you may also put "No operation" and you copy the values of Z[8:4] and Z[3:0] from the last row to show they do not change.
|
| Iteración | Z[8:4] | Z[3:0] | Operation |
| 2 | 2 | Initialization | |
| 0 | 2 | 2 | |
| 2 | 2 | | |
| 1 | 2 | 2 | |
| 2 | 2 | | |
| 2 | 2 | 2 | |
| 2 | 2 | | |
| 3 | 2 | 2 | |
| 2 | 2 | |
After the procedure, give the 8 bits as a result of the multiplication (8 binary digits):
2Give the result in decimal: 10Want instant access to all verified answers on informatica.cv.uma.es?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!