A 4x4 array multiplier multiplies two 4-bit binary numbers by arranging AND gates and adders in a grid-like pattern. Each bit of the first 4-bit number (multiplicand) is ANDed with each bit of the second 4-bit number (multiplier), creating 16 "partial products." As shown in the image, each bit of "q" is ANDed with each bit of "m" for four rows. These products are organized in rows, with each row shifted to the left to represent the binary place values for multiplication. Each column of partial products is then added vertically using full adders where columns without carries remain the same and others pass carry bits to the next column. The output for each column results in each bit of "p", which is the 8-bit product in this case.
Input a 4-bit number for the input "q" and a 4-bit number for the input "m". The outcome of the array will be an 8-bit binary product of the two input 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] |