This Article 
 Bibliographic References 
 Add to: 
Implementing Multiplication with Split Read-Only Memory
November 1995 (vol. 44 no. 11)
pp. 1352-1356

Abstract—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 n-bit multiplier using a table of squares for n-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.

[1] K. Hwang,Computer Arithmetic.New York: Wiley, 1979.
[2] H. Ling, "An Approach to Implementing Multiplication with Small Tables," IEEE Trans. Computers, vol. 39, no. 5, pp. 717-718, May 1990.
[3] M.A. Soderstrand,W.K. Jenkins,G.A. Jullien,, and F.J. Taylor,Residue Number System Arithmetic: Modern Applicationsin Digital Signal Processing. IEEE Press, 1986.

Index Terms:
Multiplication, squares, table of squares, read only memories, table look-up.
Bapiraju Vinnakota, "Implementing Multiplication with Split Read-Only Memory," IEEE Transactions on Computers, vol. 44, no. 11, pp. 1352-1356, Nov. 1995, doi:10.1109/12.475134
Usage of this product signifies your acceptance of the Terms of Use.