A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity

Abstract

Multiple constant multiplication (MCM) has been an active research area for the last decade. Most work so far have only considered the number of additions to realize a number of constant multiplications with the same input. In this work, we consider the number of full and half adder cells required to realize those additions, and a novel complexity measure… (More)

7 Figures and Tables

Topics

  • Presentations referencing similar topics