Factoring and Eliminating Common Subexpressions in Polynomial Expressions

@inproceedings{2004FactoringAE,
  title={Factoring and Eliminating Common Subexpressions in Polynomial Expressions},
  author={},
  year={2004}
}
  • Published 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 paper presents algorithms to reduce the number of operations to… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS
19 Citations
7 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-7 of 7 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

Similar Papers

Loading similar papers…