akanimax / cl-3_lab_2017 Goto Github PK

please provide the problem statement for the code which you are doing, either in comments, or just push the lab manual. It gets very difficult to keep track of what is asked and what are we trying to do

The fact that we can multiply only numbers in the range 0 to 2^limit is a bit constrained.
i propose that we should take any two numbers and then equalize the bits before calling multiply (a call like equalize_bits(num1, num2) )
if we can achieve this, then the check that bits must be a multiple of 4 can be avoided easily

P.S. check out bit_length() function

need more verbose explanation of the steps taken by Booth's Multiplier