Open AccessRadix‐2 r recoding with common subexpression elimination for multiple constant multiplication
Author(s) -
Liacha Ahmed,
Oudjida Abdelkrim K.,
Bakiri Mohammed,
Monteiro José,
Flores Paulo
Publication year - 2020
Publication title -
iet circuits, devices and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.251
H-Index - 49
ISSN - 1751-8598
DOI - 10.1049/iet-cds.2020.0213
Subject(s) - subtraction , multiplication (music) , radix (gastropod) , finite impulse response , computer science , parallel computing , arithmetic , constant (computer programming) , algorithm , benchmark (surveying) , multiplication algorithm , heuristic , mathematics , combinatorics , artificial intelligence , botany , geodesy , binary number , biology , programming language , geography
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.