Too bad I wasn't here for this thread. IIRC, to multiply in two's compliment, you had to sign extend the numbers involved. (Give me a moment while I check that)
Okay, I'm back.
Use booth's algorithm if you can understand it.
Otherwise, sign extend both the n-bit multiplicands to 2n-1 bits, multiply normally, and then cut off the front at the 2n-1 bit of the product and all partial products. (Warning, your multiplier will be really big)
Okay, I'm back.
Use booth's algorithm if you can understand it.
Otherwise, sign extend both the n-bit multiplicands to 2n-1 bits, multiply normally, and then cut off the front at the 2n-1 bit of the product and all partial products. (Warning, your multiplier will be really big)