IMPLEMENTING MULTIPLICATION WITH SPLIT READ-ONLY MEMORY

In look-up table-based multiplication schemes, techniques based on tab les of squares require less memory than techniques based on direct imp lementations. In this paper, we present a method to realize an n-bit m ultiplier 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 addressin g requirements of the new storage technique are also discussed.