3 Bit Multiplier Truth Table Access

Here is the .

| 0 1 0 | 0 0 0 | 0 0 0 0 0 0 | 0 | | 0 1 0 | 0 0 1 | 0 0 0 0 1 0 | 2 | | 0 1 0 | 0 1 0 | 0 0 0 1 0 0 | 4 | | 0 1 0 | 0 1 1 | 0 0 0 1 1 0 | 6 | | 0 1 0 | 1 0 0 | 0 0 1 0 0 0 | 8 | | 0 1 0 | 1 0 1 | 0 0 1 0 1 0 | 10 | | 0 1 0 | 1 1 0 | 0 0 1 1 0 0 | 12 | | 0 1 0 | 1 1 1 | 0 0 1 1 1 0 | 14 | 3 bit multiplier truth table

The partial products are fed into a series of adders. Here is the

| 1 0 0 | 0 0 0 | 0 0 0 0 0 0 | 0 | | 1 0 0 | 0 0 1 | 0 0 0 1 0 0 | 4 | | 1 0 0 | 0 1 0 | 0 0 1 0 0 0 | 8 | | 1 0 0 | 0 1 1 | 0 0 1 1 0 0 | 12 | | 1 0 0 | 1 0 0 | 0 1 0 0 0 0 | 16 | | 1 0 0 | 1 0 1 | 0 1 0 1 0 0 | 20 | | 1 0 0 | 1 1 0 | 0 1 1 0 0 0 | 24 | | 1 0 0 | 1 1 1 | 0 1 1 1 0 0 | 28 | 3 bit multiplier truth table

# Print the truth table print("A\tB\tP") for row in P: print(f"row[0]\trow[1]\trow[2]")