Application of symbolic computer algebra in high-level data-flow synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 22, Issue 9, 2003, Pages 1154-1165

  Peymandoust, Armita ^a   De Micheli, Giovanni ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Component mapping; Data flow synthesis; Design reuse; DSP synthesis; Gr bner basis; High level synthesis; Symbolic algebra

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; COMPUTER AIDED DESIGN; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DATA FLOW ANALYSIS; HIGH LEVEL LANGUAGES; LINEAR ALGEBRA; OPTIMIZATION;

COMPONENT MAPPING; DATA FLOW SYNTHESIS; HIGH LEVEL SYNTHESIS; SYMBOLIC ALGEBRA;

INTEGRATED CIRCUIT LAYOUT;

EID: 0041392188     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.816213     Document Type: Article

References (22)

1. G. De Micheli, Synthesis and Optimization of Digital Circuits. New York: McGraw-Hill, 1994.
2. DesignWare Library (1994). [Online]. Available: http://www.synopsys.com/
3. J. Smith and G. De Micheli, "Polynomial methods for component matching and verification," in Proc. Int. Conf. Computer-Aided Design, 1998.
4. ____, "Polynomial methods for allocating complex components," in Proc. Design, Automation, Test Eur. Conf., 1999.
5. ____, "Polynomial circuit models for component matching in high-level synthesis," IEEE Trans. VLSI, vol. 9, pp. 783-800, Dec. 2001.
6. J. F. Hart et al., Computer Approximations. New York: Wiley, 1968.
7. Maple (1988). [Online]. Available: http://www.maplesoft.com
8. Mathematica (1987). [Online]. Available: http://www.wri.com
9. B. Buchberger, "Some properties of Gröbner bases for polynomial ideals," ACM SIG-SAM Bullet., 1976.
10. K. Geddes, S. Czapor, and G. Labahn, Algorithms for Computer Algebra. Nowell, MA: Kluwer, 1992.
11. T. Becker and V. Weispfenning, Gröbner Bases. New York: Springer-Verlag, 1993.
12. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms. New York: Springer-Verlag, 1997.
13. D. J. Kuck, The Structure of Computers and Computations. New York: Wiley, 1978, vol. I.
14. D. J. Kuck, Y. Muraoka, and S. C. Chen, "On the number of operations simultaneously executable in Fortran-like programs and their resulting speedup," IEEE Trans. Comput., vol. C-21, Dec. 1972.
15. A. Nicolau and R. Potasman, "Incremental tree height reduction for high level synthesis," in Proc. Design Automation Conf., 1991, pp. 770-774.
16. D. Kolson, A. Nicolau, and N. Dutt, "Integrating program transformations in the memory-based synthesis of image and video algorithms," in Proc. Int. Conf. Computer-Aided Design, Nov. 1994.
17. H. Wang, A. Nicolau, and K. Siu, "The strict time lower bound and optimal schedules for parallel prefix with resource constraints," IEEE Trans. Comput., Nov. 1996.
18. R. Brayton and C. McMullen, "The decomposition and factorization of logic synthesis," in Proc. IEEE Int. Symp. Circuits Syst., May 1982.
19. R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, "MIS: A multiple-level logic optimization and the rectangular covering problem," in Proc. Int. Conf. Computer-Aided Design, 1987.
20. M. Willems, H. Keding, T. Grötket, and H. Meyr, "Fridge: An interactive fixed-point code generation environment for HW/SW CoDesign," in Proc. Int. Conf. Acoustics, Speech, Signal Process., 1997.
21. G. Constantinides, P. Cheung, and W. Luk, "Heuristic datapath allocation for multiple wordlength systems," in Proc. Design, Automation Test Eur., 2001.
22. D. Menard, D. Chillet, F. Charot, and O. Sentieys, "Automatic floating-point to fixed-point conversion for DSP code generation," in Proc. Int. Conf. Compilers, Architecture, Synthesis Embedded Syst., 2002.