Issue No. 11 - November (1995 vol. 44)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.475134
<p><it>Abstract</it>—In look-up table-based multiplication schemes, techniques based on tables of squares require less memory than techniques based on direct implementations. In this paper, we present a method to realize an <it>n</it>-bit multiplier using a table of squares for <it>n</it>-bit integers. A new technique to store tables of squares is also presented. The new scheme is shown to compare favorably, in terms of storage requirements, with a scheme wherein the entire table of squares is stored directly. The addressing requirements of the new storage technique are also discussed.</p>
Multiplication, squares, table of squares, read only memories, table look-up.
B. Vinnakota, "Implementing Multiplication with Split Read-Only Memory," in IEEE Transactions on Computers, vol. 44, no. , pp. 1352-1356, 1995.