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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
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 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
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
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
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
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
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
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
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 is a well-known compiler optimisation that saves time by avoiding the repetition of the same… (More)
Is this relevant?