15 search results - page 1 / 3 » Optimization of area in digit-serial Multiple Constant Multi... |
DSD
2010
IEEE
13 years 4 months ago
2010
IEEE
—Although many efficient high-level algorithms have been proposed for the realization of Multiple Constant Multiplications (MCM) using the fewest number of addition and subtract...
DAC
2007
ACM
14 years 5 months ago
2007
ACM
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
ISCAS
2011
IEEE
12 years 8 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
GLVLSI
2011
IEEE
12 years 8 months ago
2011
IEEE
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
FPL
2005
Springer
13 years 9 months ago
2005
Springer
This paper presents a design and optimization technique for the Multiple Restricted Multiplication problem [1]. This refers to a situation where a single variable is multiplied by...