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… (More)
Wikipedia

Related topics

Related topics

22 relations
Abstract semantic graphArray data structureAvailable expressionBasic block
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Common Subexpression Elimination in Dotty
Common subexpression elimination is a well-known compiler optimisation that improves running time of compiled applications by… (More)
Is this relevant?
2013
2013
A Common Subexpression Elimination Tree Algorithm
A common subexpression elimination algorithm is proposed to minimize the complexity of the multiple constant multiplication… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
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… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters
The complexity of linear-phase finite-impulse-response (FIR) filters is dominated by the complexity of coefficient multipliers… (More)
  • table I
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2007
2007
A Greedy Common Subexpression Elimination Algorithm for Implementing FIR Filters
The complexity of finite impulse response (FIR) filters is dominated by the number of adders (subtractors) used to implement the… (More)
  • figure 1
  • table 1
  • table II
  • figure 2
  • figure 3
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods
The most computationally intensive part of a wideband receiver is the channelizer. The computational complexity of linear phase… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
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… (More)
  • figure 1
  • figure 3
  • table I
  • figure 4
  • figure 7
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Common Subexpression Elimination in a Lazy Functional Language
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same… (More)
Is this relevant?