Title
Partial product reduction by using look-up tables for M×N multiplier
Abstract
In this paper we present a new technique for partial product reduction in multiplication operations. The method is based on the construction of counter elements by means of look-up tables. The organization of these counters into reduction trees takes advantage of the inherent benefits of the integration of the memories and provides an alternative to classic operation methods. We show several reduction schemes that illustrate the proposed technique and describe hybrid examples that combine stored logic with classic combinational counters in order to adapt them better to each scheme. Our approach outperforms other schemes used for comparison. In this sense, not only an independent technology model has been established, but also an FPGA approximation has been implemented to measure such factors in a real-life technology platform.
Year
DOI
Venue
2008
10.1016/j.vlsi.2008.01.005
Integration
Keywords
Field
DocType
fpga approximation,real-life technology platform,classic operation method,reduction scheme,proposed technique,independent technology model,n multiplier,look-up table,partial product reduction,classic combinational counter,reduction tree,new technique,look up table,multiplication,multiplication operator
Lookup table,Computer science,Arithmetic,Field-programmable gate array,Electronic engineering,Multiplier (economics),Multiplication,Integrated circuit,Partial product reduction
Journal
Volume
Issue
ISSN
41
4
Integration, the VLSI Journal
Citations 
PageRank 
References 
8
0.55
25
Authors
4