- A multiplication
of two n-bit binary numbers
can be broken up into
n−1 additions of
n-bit binary numbers.
For example: (multiply two 4-bits numbers)
1 0 1 1 multiplicant x 1 0 0 1 multiplier ----------------------- 1 0 1 1 <--- 1 + 0 0 0 0 <--- 0 ----------------------- 0 1 0 1 1 + 0 0 0 0 <--- 0 ----------------------- 0 0 1 0 1 1 + 1 0 1 1 <--- 1 ----------------------- 1 1 0 0 0 1 1Notice that:
- The bits of the multiplier is used to filter the multiplicant
- Here is the schema for a 4-bit multiplier using
3×4 (12)
full adders:
