摘要 |
The high speed multiplier takes advantage of results from previous calculations by recognizing that in many cases the multiplicand between a first and second multiplication differs only slightly. Thus, the present system divides the multiplicand into a cache lookup bit (CLB) and a table lookup bit (TLB). The results of a first multiplication are stored in a cache. The CLB of a of the multiplicand in the second multiplication is then compared to the CLB of the multiplicand in the second multiplication. If the CLB matches, the product of the first multiplication is retrieved. The product of the TLB of the multiplicand and the multiplier is then retrieved from a lookup table and either added or subtracted from the retrieved product.
|