Multiple Constant Multiplication (MCM) over integers is a frequent operation arising in
embedded systems that require highly optimized hardware. An efficient way is to replace …

Constant multiplication circuits can be realized multiplierless by using additions,
subtractions, and bit-shifts. The problem of finding a multiplication circuit with minimum …

The multiplication by a constant is a frequently used operation. To implement it on Field
Programmable Gate Arrays (FPGAs), the state of the art offers two completely different …

This work compares two finite impulse response (FIR) filter architectures for FPGAs for which
the coefficients can be reconfigured during run-time. One is a recently proposed filter …

Many algorithms from digital signal processing, including digital filters or discrete transforms,
require the multiplications with several constants. These can be efficiently implemented …

As silicon technology advances, field programmable gate arrays appear to gain ground
against the traditional ASIC project starts, reaching out to form the mainstream …

Constant matrix multiplication (CMM), ie, the multiplication of a constant matrix with a vector,
is a common operation in digital signal processing. It is a generalization of multiple constant …

This work presents two novel methods that simultaneously optimize both the design of a
finite impulse response (FIR) filter and its multiplierless hardware implementation. We use …

In this work we optimally solve the problem of multiplierless design of second-order Infinite
Impulse Response filters with minimum number of adders. Given a frequency specification …

Pipelining is a common method to implement high speed FIR filters. While the efficient
pipelining of multiplications is well understood, no attention has been paid on the pipelining …