Multiple Constant Multiplication Optimization Using Common Subexpression Elimination and Redundant Numbers

Multiple Constant Multiplication Optimization Using Common Subexpression Elimination and Redundant Numbers

The multiple constant multiplication (MCM) operation is a fundamental operation in digital signal processing (DSP) and digital image processing (DIP). Examples of the MCM are in finite impulse response (FIR) and infinite impulse response (IIR) filters, matrix multiplication, and transforms. The aim...

Full description

Bibliographic Details
Main Author: Al-Hasani, Firas Ali Jawad
Language:en
Published: University of Canterbury. Electrical and Computer Engineering 2014
Subjects:
Common subexpression elimination (CSE)
multiple constant multiplication (MCM)
multiplier block (MB)
multiplierless multiple constant multiplication
adder step
logic depth (LD)
logic operator (LO)
lower bound and optimality
graph dependent method
radix number system
redundant number representations
pattern preservation algorithm (PPA)
zero-dominant set (ZDS)
polynomial ring
radix polynomials
complete residue system modulo radix
congruent relation
tree encoder
graph encoder
subexpression tree algorithm (STA)
A-operation
combinatorial model of multiple constant multiplication
demand graph
dynamic capacitated arc routing problem
metaheuristics
ant colony optimization (ACO)
max-min ant system (MMAS)
parallel computing
computer cluster.
Online Access:http://hdl.handle.net/10092/9054

Internet

http://hdl.handle.net/10092/9054

Similar Items