Symbolic algebra and timing driven data-flow synthesis

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2001, Pages 300-305

  Peymandoust, A ^a   De Micheli, G ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; CRITICAL PATH ANALYSIS; DIGITAL ARITHMETIC; DIGITAL LIBRARIES; MULTIMEDIA SYSTEMS; OPTIMIZATION;

COMPUTER ALGEBRA; DATA-FLOW SYNTHESIS;

DATA FLOW ANALYSIS;

EID: 0035215526     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Polynomial methods for component matching and verification
2. Polynomial methods for allocating complex components
3. Using symbolic algebra in algorithmic level DSP synthesis
4. On the number of operations simultaneously executable in fortran-like programs and their resulting speedup
5. Some properties of gröbner bases for polynomial ideals
6. Ideals, Varieties, and algorithms
7. Incremental tree height reduction for high level synthesis
8. Integrating program transformations in the memory-based synthesis of image and video algorithms
9. The strict time lower bound and optimal schedules for parallel prefix with resource constraints
10. The decomposition and factorization of logic synthesis
11. MIS: A multiple-level logic optimization and the rectangular covering problem