Finite impulse response (FIR) filtering is a ubiquitous operation in digital signal processing
systems and is generally implemented in full custom circuits due to high-speed and low …

In the last two decades, many efficient algorithms and architectures have been introduced
for the design of low-complexity bit-parallel multiple constant multiplications (MCM) …

This paper formulates and solves a multiple real-constant multiplication (MRCM) problem,
where the goal is to find a multiplierless shift-add network that implements the multiplication …

Over the years many efficient algorithms for the multiplierless design of multiple constant
multiplications (MCMs) have been introduced. These algorithms primarily focus on finding …

This brief addresses the problem of implementing very large constant multiplications by a
single variable under the shift-adds architecture using a minimum number of …

This article addresses the problem of minimizing the implementation cost of the time-
multiplexed constant multiplication (TMCM) operation that realizes the multiplication of an …

New theoretical lower bounds for the number of operators needed in fixed-point constant
multiplication blocks are presented. The multipliers are constructed with the shift-and-add …

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 …

In the context of multiple constant multiplication (MCM) design, we propose a novel common
sub-expression elimination (CSE) algorithm that models the optimal synthesis of coefficients …

In all the DSP (Digital Signal Processing) blocks such as digital filters, the filter coefficients
are known before hand. Hence, full flexibility of the multiplier is not necessary. Multiplierless …