High-level algorithms for the optimization of gate-level area in digit-serial multiple constant multiplications

Abstract

The last two decades have seen tremendous effort on the development of high-level synthesis algorithms for efficient realization of the multiplication of a variable by a set of constants using only addition, subtraction, and shift operations. These algorithms generally target the minimization of the number of adders and subtractors, assuming that shifts are… (More)
DOI: 10.1016/j.vlsi.2011.11.008

Topics

16 Figures and Tables

Cite this paper

@article{Aksoy2012HighlevelAF, title={High-level algorithms for the optimization of gate-level area in digit-serial multiple constant multiplications}, author={Levent Aksoy and Cristiano Lazzari and Eduardo Costa and Paulo F. Flores and Jos{\'e} C. Monteiro}, journal={Integration}, year={2012}, volume={45}, pages={294-306} }