I wanted to know how the processor does multiplication in a multi-cycle data-path right from the beginning i.e from Instruction Reading -> decoding the instruction-> reading register files etc.
In other word I wanted to know that given the booth's algorithm for multiplication implemented separately (a circuit is given) how will you extend the multi-cycle data-path to support multiply instruction using minimum resources.
Can you tell for devision also?