Search algorithms for the multiple constant multiplications problem: Exact and approximate
This article addresses the multiplication of one data sample with multiple constants using
addition/subtraction and shift operations, ie, the multiple constant multiplications (MCM) …
addition/subtraction and shift operations, ie, the multiple constant multiplications (MCM) …
Optimal constant multiplication using integer linear programming
M Kumm - IEEE Transactions on Circuits and Systems II …, 2018 - ieeexplore.ieee.org
Constant multiplication circuits can be realized multiplierless by using additions,
subtractions, and bit-shifts. The problem of finding a multiplication circuit with minimum …
subtractions, and bit-shifts. The problem of finding a multiplication circuit with minimum …
[BOOK][B] Multiple constant multiplication optimizations for field programmable gate arrays
M Kumm, P Zipf - 2016 - Springer
As silicon technology advances, field programmable gate arrays appear to gain ground
against the traditional ASIC project starts, reaching out to form the mainstream …
against the traditional ASIC project starts, reaching out to form the mainstream …
Fine-grained critical path analysis and optimization for area-time efficient realization of multiple constant multiplications
In this paper, critical path of multiple constant multiplication (MCM) block is analyzed
precisely and optimized for high-speed and low-complexity implementation. A delay model …
precisely and optimized for high-speed and low-complexity implementation. A delay model …
An optimal and practical approach to single constant multiplication
J Thong, N Nicolici - … on Computer-Aided Design of Integrated …, 2011 - ieeexplore.ieee.org
We propose an exact solution to the single constant multiplication (SCM) problem. Existing
optimal algorithms are limited to constants of up to 19 bits. Our algorithm requires less than …
optimal algorithms are limited to constants of up to 19 bits. Our algorithm requires less than …
Efficient shift-add implementation of FIR filters using variable partition hybrid form structures
Single constant multiplication (SCM) and multiple constant multiplications (MCM) are among
the most popular schemes used for low-complexity shift-add implementation of finite impulse …
the most popular schemes used for low-complexity shift-add implementation of finite impulse …
Single-stage and cascade design of high order multiplierless linear phase FIR filters using genetic algorithm
In this work, a novel genetic algorithm (GA) is proposed for the design of multiplierless linear
phase finite impulse response (FIR) filters. The filters under consideration are of high order …
phase finite impulse response (FIR) filters. The filters under consideration are of high order …
Minimal logic depth adder tree optimization for multiple constant multiplication
M Faust, CH Chang - Proceedings of 2010 IEEE International …, 2010 - ieeexplore.ieee.org
Research on optimization of fixed coefficient FIR filters modeled as Multiple Constant
Multiplication (MCM) has been ongoing for two decades. An analysis of Minimal Signed …
Multiplication (MCM) has been ongoing for two decades. An analysis of Minimal Signed …
Bit-level multiplierless FIR filter optimization incorporating sparse filter technique
Multiplierless FIR filter optimization has been extensively studied in the past decades to
minimize the number of adders. A more accurate measurement of the implementation …
minimize the number of adders. A more accurate measurement of the implementation …
Design of high‐speed, low‐power, and area‐efficient FIR filters
In a recent work, we have introduced a new multiple constant multiplication (MCM)
algorithm, denoted as RADIX‐2r. The latter exhibits the best results in speed and power …
algorithm, denoted as RADIX‐2r. The latter exhibits the best results in speed and power …