Multiplication !!


Shift - add multiplication, unsigned;

 multiply X by Y.

We will need 2 n/2 bit registers, U V, for the high order and low order bits of the result, and a register C, for the carry out.

The Algorithm :

   U = 0;
   FOR i = 1 to n DO
      { IF Y0 = 1 THEN CU = U + X;
        linear shift right CUV;
        circular shift right Y}