| 摘要 |
<p>A multiplier X is copied into a variable Z. The bits of the multiplier X are read two at a time, starting with the least significant two bits. If the bit pair X (i+1)X iis equal to 11, then 1 is added to Z (i+2). The process continues for successive non-overlapping pairs of bits, until the most significant three bits of X are reached. The last three bits are encoded using table look-up process. Independent claims are also included for the following: (1) system for multiplying two binary numbers; (2) computer program product comprising computer usable medium storing control logic program.</p> |
