Paper Info
Title
Implementing Multiplication with Split Read-Only Memory
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.
Year
DOI
Venue
1995
10.1109/12.475134
IEEE Trans. Computers
Keywords
Field
DocType
split read-only memory,entire table,new storage technique,n-bit integer,n-bit multiplier,implementing multiplication,storage requirement,direct implementation,new scheme,look-up table-based multiplication scheme,new technique,multiplication,arithmetic,read only memory,look up table
Resource management,Integer,Read-only memory,Computer science,Parallel computing,Multiplier (economics),Implementation,Read only storage,Multiplication
Journal
Volume
Issue
ISSN
44
11
0018-9340
Citations 
PageRank 
References 
5
0.78
1
Authors
1
Name
Order
Citations
PageRank
Bapiraju Vinnakota123725.36