I'm just starting to dive into digital logic and I'm stuck on making a circuit that multiplies two 2-bit numbers. I partially understand that you need to use adders but I just cant fully wrap my head around the concept. I have made my truth table and then proceeded with the K-maps, but that's where I'm stuck. Any help would be much appreciated!
Since there are only 16 possible inputs to this multiplier and its output is only 4 bits, it can be easily implemented as a lookup. In case you think that sounds silly, consider that many FPGAs actually implement soft logic this way. All you need is a memory with 16 words of 4 bits each.