A 4-bit array multiplier is a combinational circuit that multiplies two 4-bit binary numbers using AND gates and full adders. Each bit of one number is multiplied by each bit of the other to create partial products. These products are aligned in a grid, with each row shifted one position to the left, like multiplication. These partial products are then added together using half-adders and full adders. Each takes three inputs and creates a sum resulting in an 8-bit binary number.
Figure #1 4x4 Mutipler Array
In order to test the product, two binary inputs need to be inputted into the code: the first four bits being the first number and the last four bits being the last number. These numbers are then run through the code, which outputs an 8-bit number that is the result of multiplying the two given numbers.
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] |