An Algorithm for Jointly Optimizing Quantization and Multiple Constant Multiplication

Authors:
Matthew B. Gately;Mark B. Yeary;Choon Yik Tang
Affiliations:
University of Oklahoma;University of Oklahoma;University of Oklahoma
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
2012

Citing 10
Cited 0

Efficient substitution of multiple constant multiplications by shifts and additions using iterative pairwise matching

DAC '94 Proceedings of the 31st annual Design Automation Conference
Digital Control of Dynamic Systems

Digital Control of Dynamic Systems
Wireless Communications

Wireless Communications
Multiplierless multiple constant multiplication

ACM Transactions on Algorithms (TALG)
Search algorithms for the multiple constant multiplications problem: Exact and approximate

Microprocessors & Microsystems
Design of multiplierless FIR filters with an adder depth versus filter order trade-off

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Optimization Algorithms for the Multiplierless Realization of Linear Transforms

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Multidimensional rational approximations with an application to linear transforms

IEEE Transactions on Signal Processing
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Design of Low-Complexity FIR Filters Based on Signed-Powers-of-Two Coefficients With Reusable Common Subexpressions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents a joint framework for quantization and Multiple Constant Multiplication (MCM) optimization, which yields a computationally efficient implementation of multiplierless multiplication in hardware and software. Frameworks of this nature have been developed in the context of Finite Impulse Response (FIR) filters, where frequency response specifications are used to drive the design. In this work, we look at a general case, considering as given a vector of ideal, real constants, which may come from any application and do not necessarily represent FIR filter coefficients. We first formulate a joint optimization problem for finding a fixed-point vector and a shift-add network that are optimal in terms of quantization error and MCM complexity. We then describe ways to finitize and prune the search space, leading to an efficient algorithm called JOINT_SOLVE that solves the problem. Finally, via extensive randomized experiments, we show that our joint framework is notably more computationally efficient than a disjointed one, reducing the MCM cost by 15%--60% on moderate size problems.