Editing Horner's method (section)

====Method====
To find the product of two binary numbers ''d'' and ''m'':
# A register holding the intermediate result is initialized to ''d''.
# Begin with the least significant (rightmost) non-zero bit in ''m''. {{ordered list | list-style-type = lower-alpha | start = 2
| Count (to the left) the number of bit positions to the next most significant non-zero bit.  If there are no more-significant bits, then take the value of the current bit position.
| Using that value, perform a left-shift operation by that number of bits on the register holding the intermediate result}}
# If all the non-zero bits were counted, then the intermediate result register now holds the final result.  Otherwise, add d to the intermediate result, and continue in step 2 with the next most significant bit in ''m''.