Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction… 
2007
2007
The complexity of finite impulse response (FIR) filters is dominated by the number of adders (subtractors) used to implement the… 
2007
2007
The complexity of finite impulse response (FIR) filters is dominated by the number of adders (subtractors) used to implement the… 
2006
2006
The complexity of linear phase finite impulse response (FIR) filters used in the channelizer of a software defined radio (SDR… 
2005
2005
We propose a novel common subexpression elimination (CSE) method to be used for the VLSI design of a multiplierless finite… 
2005
2005
  • A. P. VinodE. Lai
  • 2005
  • Corpus ID: 16634573
Common subexpression elimination (CSE) techniques address the issue of minimizing the number of adders needed to implement the… 
2004
2004
This paper proposes a novel method to be used for VLSI design of canonic signed digit (CSD) linear phase finite impulse response… 
2004
2004
A contention resolution algorithm (CRA) is proposed for the common subexpression elimination of the multiplier block of the… 
1997
1997
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same… 
1997
1997
An approach for broadband modem FIR filter design optimization is presented. It addresses the minimization of the number of adder…