There will be two 4-bit inputs that represents the binary factors and an 8-bit output for the product. With the use of Full Adders, it combines the partial products and produces the final binary multiplication result.
To test this project, there are two inputs. You would set one of them to a negative in 2's complement form, in binary. You would then multiply both these inputs in binary and should have a signed integer that accurately represents the multiplication.
N/A
# | Input | Output | Bidirectional |
---|---|---|---|
0 | q[0] | p[0] | |
1 | q[1] | p[1] | |
2 | q[2] | p[2] | |
3 | q[3] | p[3] | |
4 | m[0] | p[4] | |
5 | m[1] | p[5] | |
6 | m[2] | p[6] | |
7 | m[3] | p[7] |