Common Subexpression Elimination Involving Multiple Variables for Linear DSP Synthesis

Authors:
Anup Hosangadi;Farzan Fallah;Ryan Kastner
Affiliations:
University of California, Santa Barbara;Fujitsu Labs of America, Inc.;University of California, Santa Barbara
Venue:
ASAP '04 Proceedings of the Application-Specific Systems, Architectures and Processors, 15th IEEE International Conference
Year:
2004

Citing 0
Cited 5

Reducing hardware complexity of linear DSP systems by iteratively eliminating two-term common subexpressions

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Optimizing high speed arithmetic circuits using three-term extraction

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Algebraic Methods for Optimizing Constant Multiplications in Linear Systems

Journal of VLSI Signal Processing Systems
Xquasher: a tool for efficient computation of multiple linear expressions

Proceedings of the 46th Annual Design Automation Conference
Layout aware optimization of high speed fixed coefficient FIR filters for FPGAs

International Journal of Reconfigurable Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Common subexpression elimination is commonly employed to reduce the number of operations in DSP algorithms after decomposing constant multiplications into shifts and additions. Conventional optimization techniques for finding common subexpressions can optimize constant multiplications with only a single variable at a time, and hence cannot fully optimize the computations with multiple variables found in matrix form of linear systems like DCT, DFT etc. In this paper we transform these computations such that all common subexpressions involving any number of variables can be detected. We then present heuristic algorithms to select the best set of common subexpressions. Experimental results show the superiority of our technique over conventional techniques for common subexpression elimination.