Title :
An approach to implementing multiplication with small tables
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fDate :
5/1/1990 12:00:00 AM
Abstract :
Table look-up is an attractive approach to implementing multiplication; however, the size of the requisite multiplication table is prohibitively large for wide operands. A novel transformation which reduces the number of table entries from 22b to 2b, where b is the width of the operands, is presented. Two implementation schemes are presented
Keywords :
table lookup; implementation schemes; multiplication; small tables; table entries; table lookup; transformation; Arithmetic; Delay; Hardware; Logic gates; Pipelines; Read only memory; Table lookup; Timing;
Journal_Title :
Computers, IEEE Transactions on
