The Booth-4 algorithm is a multiplication algorithm that uses a combination of shifting and addition/subtraction operations to perform signed multiplication of two numbers. It is specifically designed to optimize the multiplication process by reducing the number of required partial products and improving efficiency.
Using testbench, apply physical inputs and see output
| # | Input | Output | Bidirectional |
|---|---|---|---|
| 0 | X[0] | Z[0] | Y[0] |
| 1 | X[1] | Z[1] | Y[1] |
| 2 | X[2] | Z[2] | Y[2] |
| 3 | X[3] | Z[3] | Y[3] |
| 4 | Z[4] | ||
| 5 | Z[5] | ||
| 6 | Z[6] | ||
| 7 | Z[7] |