Radix-2r recoding with common subexpression elimination for multiple constant multiplication

In a recent work on multiple constant multiplication (MCM) problems, a fully predictable sub-linear runtime heuristic was introduced, called Radix-2r MCM. This method shows competitive results in speed, power and area, comparatively with the leading algorithms. In this study, the authors combine Rad...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IET circuits, devices & systems Ročník 14; číslo 7; s. 990 - 994
Hlavní autoři: Liacha, Ahmed, Oudjida, Abdelkrim K, Bakiri, Mohammed, Monteiro, José, Flores, Paulo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Stevenage The Institution of Engineering and Technology 01.10.2020
John Wiley & Sons, Inc
Témata:
addition‐subtraction operations
Algorithms
Boolean
common subexpression elimination
computational complexity
Critical path
digital arithmetic
finite impulse response filters
FIR filters
fully predictable sub‐linear runtime heuristic
Heuristic
Linear programming
MCM problems
multiple constant multiplication problems
Multiplication
optimisation
radix‐2r MCM
radix‐2r recoding
radix‐2r‐CSE
Research Article
substantial reduction
Subtraction
Variables
addition-subtraction operations
MCM problems
radix-2r-CSE
radix-2r recoding
FIR filters
optimisation
radix-2r MCM
multiple constant multiplication problems
digital arithmetic
common subexpression elimination
substantial reduction
fully predictable sub-linear runtime heuristic
finite impulse response filters
computational complexity
ISSN:1751-858X, 1751-8598, 1751-8598
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In a recent work on multiple constant multiplication (MCM) problems, a fully predictable sub-linear runtime heuristic was introduced, called Radix-2r MCM. This method shows competitive results in speed, power and area, comparatively with the leading algorithms. In this study, the authors combine Radix-2r MCM with an exact common subexpression elimination (CSE) algorithm. The resulting algorithm denoted Radix-2r-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-2r MCM. The savings over Radix-2r 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1751-858X
1751-8598
1751-8598
DOI:10.1049/iet-cds.2020.0213