Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Common subexpression elimination

Known as: CSE, Elimination of common sub expressions, Global common subexpression elimination 
In compiler theory, common subexpression elimination (CSE) is a compiler optimization that searches for instances of identical expressions (i.e… Expand
Wikipedia

Related topics

Related topics

22 relations
Abstract semantic graphArray data structureAvailable expressionBasic block
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters
  • R. Mahesh, A. Vinod
  • IEEE Transactions on Computer-Aided Design of…
  • 2008
    • Corpus ID: 2143530
The complexity of linear-phase finite-impulse-response (FIR) filters is dominated by the complexity of coefficient multipliers… Expand
  • table I
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2008
2008
Common Subexpression Elimination in Automated Constraint Modelling
Typically, there are many alternative models of a given problem as a constraint satisfaction problem, and formulating an… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Design of Linear Phase FIR Filters in Subexpression Space Using Mixed Integer Linear Programming
  • Y. Yu, Y. Lim
  • IEEE Transactions on Circuits and Systems I…
  • 2007
    • Corpus ID: 10118151
In this paper, a novel optimization technique is proposed to optimize filter coefficients of linear phase finite-impulse response… Expand
Is this relevant?
2006
2006
Optimizing Polynomial Expressions by Algebraic Factorization and Common Subexpression Elimination
Polynomial expressions are frequently encountered in many application domains, particularly in signal processing and computer… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Contention resolution algorithm for common subexpression elimination in digital filter design
In this paper, a new algorithm, called contention resolution algorithm for weight-two subexpressions (CRA-2), based on an… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Is Compiling for Performance — Compiling for Power?
Energy consumption and power dissipation are increasingly becoming important design constraints in high performance… Expand
  • figure 1
  • table 1
  • table 3
  • table 4
  • table 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A new algorithm for elimination of common subexpressions
The problem of an efficient hardware implementation of multiplications with one or more constants is encountered in many… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination
Many applications in DSP, telecommunications, graphics, and control have computations that either involve a large number of… Expand
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Global common subexpression elimination
When considering compiler optimization, there are two questions that immediately come to mind; one, why and to what extent is… Expand
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Global common subexpression elimination
When considering compiler optimization, there are two questions that immediately come to mind; one, why and to what extent is… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE