| A2 A1 A0 | B2 B1 B0 | P5 P4 P3 P2 P1 P0 | Decimal Product | |----------|----------|-------------------|----------------| | 0 0 0 | 0 0 0 | 0 0 0 0 0 0 | 0 | | 0 0 0 | 0 0 1 | 0 0 0 0 0 0 | 0 | | 0 0 0 | 0 1 0 | 0 0 0 0 0 0 | 0 | | 0 0 0 | 0 1 1 | 0 0 0 0 0 0 | 0 | | 0 0 0 | 1 0 0 | 0 0 0 0 0 0 | 0 | | 0 0 0 | 1 0 1 | 0 0 0 0 0 0 | 0 | | 0 0 0 | 1 1 0 | 0 0 0 0 0 0 | 0 | | 0 0 0 | 1 1 1 | 0 0 0 0 0 0 | 0 |
A 3-bit multiplier is a digital circuit that takes two 3-bit binary numbers, A and B, as inputs and produces a 6-bit output, P. The output P represents the product of A and B. 3 bit multiplier truth table
Here is an example code implementation in Python to generate the 3-bit multiplier truth table: | A2 A1 A0 | B2 B1 B0
| 1 1 0 | 0 0 0 | 0 0 0 0 0 0 | 0 | | 1 1 0 | 0 0 1 | 0 0 0 1 1 0 | 6 | | 1 1 0 | 0 1 0 | 0 0 1 1 0 0 | 12 | | 1 1 0 | 0 1 1 | 0 1 0 0 1 0 | 18 | | 1 1 0 | 1 0 0 | 0 1 1 0 0 0 | 24 | | 1 1 0 | 1 0 1 | 0 1 1 1 1 0 | 30 | | 1 1 0 | 1 1 0 | 1 0 0 1 0 0 | 36 | | 1 1 0 | 1 1 1 | 1 0 1 0 1 0 | 42 | Summary of Outputs P0cap P sub 0 :
A 3-bit multiplier generally requires and 3 to 6 Full Adders , depending on the specific optimization of the carry-save or ripple-carry architecture. Summary of Outputs P0cap P sub 0 : P1cap P sub 1 : P2cap P sub 2 P5cap P sub 5