Multiplication Algorithms
Multiplication of the two fixed-point binary numbers in signed magnitude representation is done with paper and pencil through a process of successive shift and adds operations. This process can be best illustrated with a numerical example:
23 10111 Multiplicand
19 x 10011 Multiplier
10111
10111
00000
00000
10111
437 110110101 Product
This process looks at successive bits of multiplier, least significant bit first. If multiplier bit is 1, multiplicand is copied as it is; or else, we copy zeros. Now we shift numbers copied down one position to left from previous numbers. Finally, numbers are added and their sum produces product.