Factoring and eliminating common subexpressions in polynomial expressions

  title={Factoring and eliminating common subexpressions in polynomial expressions},
  author={Anup Hosangadi and Farzan Fallah and Ryan Kastner},
  journal={IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.},
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities for optimization. However existing compiler techniques for reducing code complexity such as common subexpression elimination and value numbering are targeted towards general purpose applications and are unable to fully optimize these expressions. This work presents algorithms to reduce the number of operations to… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 19 extracted citations


Publications referenced by this paper.
Showing 1-10 of 10 references

Faster Math Functions

  • R.Green
  • Sony Computer Entertainment Research and…
  • 2003
1 Excerpt

The Decomposition and Factorization of Boolean Expressions

  • C. T. McMullen
  • 2003

Modularised Fast Polynomial Transform Algorithm for Two Dimensional Digital Signal Processing

  • J.L.Wu, Y.M.Huang
  • IEEE Proceedings on Radar and Signal Processing…
  • 1990
1 Excerpt

Multi - level Logic Optimization and the Rectangular Covering Problem

  • A. S. Vincentelli, A. Wang
  • 1987

, " Faster Math Functions , " Sony Computer Entertainment Research and Development 2003 . [ 8 ] " GNU C Library

  • Green
  • An Introduction to Splines for Use in Computer…

Similar Papers

Loading similar papers…