Timeline for 3-bit multipliers - how do they work?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2014 at 20:08 | comment | added | helloworld922 | Olin's talking about 3bit*3bit. 3bits=8 possible numbers (2 cubed). 8*8 = 64 total possible outcomes. Read the result at the address of the combination of the inputs (3 bits from op1, 3 bits from op2). | |
| Feb 14, 2014 at 20:06 | comment | added | David | If you have two numbers that are three bits wide then you have 6 total bits of information. The answer here is suggesting a lookup table of 2^6 which would hold all the answers, precomputed. | |
| Feb 14, 2014 at 20:01 | comment | added | user3195417 | It seems you are describing how to implement multipliers that take 3 numbers of 3 bits each as input. Am I mistaken? I need to build a multiplier that takes two numbers, each of 3 bits. | |
| Feb 14, 2014 at 19:39 | history | answered | Olin Lathrop | CC BY-SA 3.0 |