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...

Full description

Saved in:
Bibliographic Details
Published in:IET circuits, devices & systems Vol. 14; no. 7; pp. 990 - 994
Main Authors: Liacha, Ahmed, Oudjida, Abdelkrim K, Bakiri, Mohammed, Monteiro, José, Flores, Paulo
Format: Journal Article
Language:English
Published: Stevenage The Institution of Engineering and Technology 01.10.2020
John Wiley & Sons, Inc
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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