Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2009, Pages 1452-1457

  Gopalakrishnan, Sivaram ^a   Kalla, Priyank ^b  

^a SYNOPSYS INC   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC TECHNIQUES; AREA-EFFICIENT; COMMON SUBEXPRESSION ELIMINATION; CONVENTIONAL METHODS; HARDWARE IMPLEMENTATIONS; OPTIMIZATION TECHNIQUES; POLYNOMIAL SYSTEMS; SUB-EXPRESSIONS;

POLYNOMIALS;

EID: 70350074599     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/date.2009.5090892     Document Type: Conference Paper

References (21)

1. "Synopsys Design Compiler and DesignWare library", Available at htpp://www.synopsys.com.
2. G. DeMicheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, 94.
3. A. Peymandoust and G. DeMicheli, "Application of Symbolic Computer Algebra in High-Level Data-Flow Synthesis", IEEE Trans. CAD, vol. 22, pp. 1154-11656, 2003.
4. J. Smith and G. DeMicheli, "Polynomial circuit models for com-ponent matching in high-level synthesis", IEEE Trans. VLSI, vol. 9, 2001.
5. A. Hosangadi, F. Fallah, and R. Kastner, "Optimizing polyno-mial expressions by algebraic factorization and common subex-pression elimination", IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 25, pp. 2012-2022, Oct 2006.
6. Arvind and X. Shen, "Using term rewriting systems to design and verify processors", IEEE Micro, vol. 19, pp. 36-46, 1998.
7. Sivaram Gopalakrishnan and Priyank Kalla, "Optimization of polynomial datapaths using finite ring algebra", ACM Trans. Des. Autom. Electron. Syst., vol. 12, pp. 49, 2007.
8. JuanCSE, "Extensible, programmable and recon-figurable embedded systems group", Available at http://express.ece.ucsb.edu/suif/cse.html.
9. J. Smith and G. DeMicheli, "Polynomial methods for compo-nent matching and verification", in In Proc. ICCAD, 1998.
10. J. Smith and G. DeMicheli, "Polynomial methods for allocating complex components", in Proc. DATE, 1999.
11. B. Buchberger, Ein Algorithmus zum Auffinden der Basise-lemente des Restklassenringes nach einem nulldimensionalen Polynomideal, PhD thesis, Philosophiesche Fakultat an der Leopold-Franzens-Universitat, Austria, 1965.
12. B. Buchberger, "A Theoretical Basis for Reduction of Polyno-mials to Canonical Forms", ACM SIG-SAM Bulletin, vol. 10, pp. 19-29, 1976.
13. B. Buchberger, "Some Properties of Grobner Bases for Polyno-mial Ideals", ACM SIG-SAM Bulletin, 1976.
14. A. K. Verma and P. Ienne, "Improved use of the Carry-save Rep-resentation for the Synthesis of Complex Arithmetic Circuits", in Proceedings of the International Conference on Computer Aided Design, 2004.
15. A. Nicolau and R. Potasman, "Incremental tree-height reduc-tion for high-level synthesis", in Proc. DAC, 1991.
16. G. DeMicheli and M. Sami, Hardware/Software Co-Design, Kluwer Academic Publishers, 96.
17. J. Cohen, Computer Algebra and Symbolic Computation, A. K. Peters, 2003.
18. Maple, ", http://www.maplesoft.com.
19. MATLAB/Simulink, ", http://www.mathworks.com/products/simulink.
20. V. J. Mathews and G. L. Sicuranza, Polynomial Signal Process-ing, Wiley-Interscience, 2000.
21. M. R. Guthaus and et al., "Mibench: A Free, Commercially Representative Embedded Benchmark Suite", in IEEE 4th An-nual Workshop on Workload Characterization, Dec 2001.