In the context of multiple constant multiplication (MCM) filter design, we propose a search space that combines the shifted sum/difference of coefficients as well as minimal signed digit (MSD) representation. The search space further reduces the number of adders/subtractors in the synthesis of MCM from MSD representation. A novel common subexpression elimination (CSE) algorithm is adapted to the proposed search space. Our synthesized multiplierless filters are benchmarked against representative examples and found to achieve hardware reduction in most cases.link_to_subscribed_fulltex
Abstract — The digit-based recoding technique does not exploit the sharing of common partial product...
Efficient algorithms and architectures already exist for the design of low-complexity bit-parallel m...
In this paper, a new efficient algorithm is proposed for the synthesis of low-complexity finite-impu...
In the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpre...
In the context of multiple constant multiplications (MCM) design, we propose a novel common subexpre...
In the context of multiple constant multiplication (MCM) design, we propose a novel common subexpres...
Abstract — In the context of multiple constant mul-tiplication (MCM) design, we propose a novel com-...
In the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expre...
The multiple constant multiplication (MCM) operation is a fundamental operation in digital signal pr...
International audienceMany algorithms from digital signal processing, including digital filters or d...
ABSTRACT In the last decade, efficient algorithms have been proposed for the multiplication of one d...
A variable can be multiplied by a given set of fixed-point constants using a multiplier block that c...
The main contribution of this paper is an exact com-mon subexpression elimination algorithm for the ...
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications ...
In this work, an approach for transposing solutions to the multiple constant multiplication (MCM) pr...
Abstract — The digit-based recoding technique does not exploit the sharing of common partial product...
Efficient algorithms and architectures already exist for the design of low-complexity bit-parallel m...
In this paper, a new efficient algorithm is proposed for the synthesis of low-complexity finite-impu...
In the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpre...
In the context of multiple constant multiplications (MCM) design, we propose a novel common subexpre...
In the context of multiple constant multiplication (MCM) design, we propose a novel common subexpres...
Abstract — In the context of multiple constant mul-tiplication (MCM) design, we propose a novel com-...
In the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expre...
The multiple constant multiplication (MCM) operation is a fundamental operation in digital signal pr...
International audienceMany algorithms from digital signal processing, including digital filters or d...
ABSTRACT In the last decade, efficient algorithms have been proposed for the multiplication of one d...
A variable can be multiplied by a given set of fixed-point constants using a multiplier block that c...
The main contribution of this paper is an exact com-mon subexpression elimination algorithm for the ...
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications ...
In this work, an approach for transposing solutions to the multiple constant multiplication (MCM) pr...
Abstract — The digit-based recoding technique does not exploit the sharing of common partial product...
Efficient algorithms and architectures already exist for the design of low-complexity bit-parallel m...
In this paper, a new efficient algorithm is proposed for the synthesis of low-complexity finite-impu...