Paper Info
Title
Radix-2(R) Recoding With Common Subexpression Elimination For Multiple Constant Multiplication
Abstract
In a recent work on multiple constant multiplication (MCM) problems, a fully predictable sub-linear runtime heuristic was introduced, called Radix-2(R) MCM. This method shows competitive results in speed, power and area, comparatively with the leading algorithms. In this study, the authors combine Radix-2(R) MCM with an exact common subexpression elimination (CSE) algorithm. The resulting algorithm denoted Radix-2(R)-CSE allows a substantial reduction in the number of addition/subtraction operations in MCM by maximising the sharing of partial terms after an initial recoding in Radix-2(R) MCM. The savings over Radix-2(R) MCM ranges from 4.34 to 18.75% (10% on average) when considering a set of 14 benchmark finite impulse response filters of varying complexity.
Year
DOI
Venue
2020
10.1049/iet-cds.2020.0213
IET CIRCUITS DEVICES & SYSTEMS
Keywords
DocType
Volume
FIR filters, digital arithmetic, computational complexity, optimisation, common subexpression elimination, multiple constant multiplication problems, fully predictable sub-linear runtime heuristic, radix-2(r) recoding, MCM problems, radix-2(r) MCM, radix-2(r)-CSE, substantial reduction, addition-subtraction operations, finite impulse response filters
Journal
14
Issue
ISSN
Citations 
7
1751-858X
0
PageRank 
References 
Authors
0.34
0
5
Name
Order
Citations
PageRank
Ahmed Liacha1174.54
Abdelkrim Kamel Oudjida2316.05
Mohammed Bakiri300.34
Jose Monteiro4660128.33
Paulo Flores527025.28