Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,209,252 papers from all fields of science
Search
Sign In
Create Free Account
Common subexpression elimination
Known as:
CSE
, Elimination of common sub expressions
, Global common subexpression elimination
Expand
In compiler theory, common subexpression elimination (CSE) is a compiler optimization that searches for instances of identical expressions (i.e…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Abstract semantic graph
Array data structure
Available expression
Basic block
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Common Subexpression Elimination in Dotty
Allan Vincent Roger Renucci
,
Dmytro Petrashko
,
Martin Odersky
2015
Corpus ID: 50677260
Common subexpression elimination is a well-known compiler optimisa- tion that improves running time of compiled applications by…
Expand
Review
2014
Review
2014
FPGA Implementation of FIR Filter using Various Algorithms: A Retrospective
Jinalkumari K. Dhobi
,
D. B. Shukla
,
Dr.Kiritkumar R. Bhatt
2014
Corpus ID: 15603989
This Paper is a review study of FPGA implementation of Finite Impulse response (FIR) with low cost and high performance. The key…
Expand
2010
2010
A new common subexpression elimination algorithm with application in composite field AES S-box
M. Wong
,
M. Wong
International Conference on Information Sciences…
2010
Corpus ID: 15795086
Common subexpression elimination (CSE) is a critical procedure in many multiplierless implementation of DSP algorithms. The aim…
Expand
2009
2009
Enhancing constraint models of planning problems by common subexpression elimination
P. Gregory
,
Ian P. Gent
,
Andrea Rendl
,
Ian Miguel
2009
Corpus ID: 17575688
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction…
Expand
2009
2009
The Cost of Flattening with Common Subexpression Elimination
Andrea Rendl
,
Ian Miguel
,
Ian P. Gent
2009
Corpus ID: 561807
Compiling a solver-independent constraint model to solver input usually involves flattening, the decomposition of complex…
Expand
2008
2008
Sign-Extension Reduction Method in Common Subexpression Elimination Circuit
Yong-Eun Kim
,
Jin-Gyun Chung
,
M. Lee
2008
Corpus ID: 63894248
In FIR filter design, multipliers occupy most of the area. To efficiently reduce the area occupied by multipliers, Common…
Expand
2005
2005
COG-PETS: CODE GENERATION FOR PARAMETER ESTIMATION IN TIME SERIES
Christopher Kumar Anand
,
J. Carette
,
A. Curtis
,
David Miller
2005
Corpus ID: 15378144
We extend previous work on symbolic code generation for efficient solvers in the domain of image and signal processing, to take…
Expand
2004
2004
Synthesis of Multiplierless FIR Filter by Efficient Sharing of Horizontal and Vertical Common Subexpression Elimination
Yasuhiro Takahashi
,
Kazukiyo Takahashi
,
M. Yokoyama
2004
Corpus ID: 59494677
This paper proposes a novel method to be used for VLSI design of canonic signed digit (CSD) linear phase finite impulse response…
Expand
2004
2004
Optimizing Polynomial Expressions by Factoring and Eliminating Common Subexpressions
Anup Hosangadi
,
F. Fallah
,
R. Kastner
2004
Corpus ID: 15236523
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and…
Expand
2001
2001
Loop fusion and temporal common subexpression elimination in window-based loops
J. Hammes
,
A. Böhm
,
+4 authors
W. Najjar
Proceedings, International Parallel and…
2001
Corpus ID: 361113
This paper describes a system for compiling codes written in a conventional high-level language to recon gurable FPGA-based…
Expand