Heuristic datapath allocation for multiple wordlength systems

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2001, Pages 791-796

  Constantinides, George A ^a   Cheung, Peter Y K ^a   Luk, Wayne ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AREA SAVINGS; DATA-FLOW GRAPHS; DATAPATH ALLOCATION; INTERMEDIATE STAGE; ITERATIVE REFINEMENT; REFINEMENT PROCESS; WORD LENGTH; WORDLENGTH SELECTION;

DATA FLOW ANALYSIS; EXHIBITIONS; GRAPHIC METHODS; ITERATIVE METHODS;

SCHEDULING;

EID: 84893684949     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2001.915122     Document Type: Conference Paper

References (16)

1. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, August 1979.
2. R. Cmar, L. Rijnders, P. Schaumont, S. Vernalde, and I. Bolsens. A methodology and design environment for DSP ASIC fixed point refinement. In Proc. Design Automation and Test in Europe, München, 1999.
3. G. A. Constantinides, P. Y. K. Cheung, and W. Luk. Multiple precision for resource minimization. In Proc. IEEE Symposium on Field-Programmable Custom Computing Machines. IEEE Computer Society, April 2000.
4. G. A. Constantinides, P. Y. K. Cheung, and W. Luk. Multiple-wordlength resource binding. In H. Gruenbacher and R. Hartenstein, editors, Field-Programmable Logic: The Roadmap to Reconfigurable Systems, Lecture Notes in Computer Science. Springer-Verlag, 2000.
5. G. A. Constantinides, P. Y. K. Cheung, and W. Luk. Optimal datapath allocation for multiple-wordlength systems. IEE Electronics Letters, 36(17):1508-1509, August 2000.
6. G. A. Constantinides, P. Y K. Cheung, and W. Luk. Roundoff-noise shaping in filter design. In Proc. IEEE International Symposium on Circuits and Systems, May - June 2000.
7. G. DeMicheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill, New York, 1994.
8. R. P. Dick, D. L. Rhodes, and W. Wolf. TGFF: Task graphs for free. In Proc. CODES/CASHE'98, pages 97-101, 1998.
9. M. Ercegovac, D. Kirovski, and M. Potkonjak. Low-power behavioural synthesis optimization using multiple precision arithmetic. In Proc. 37th Design Automation Conference, 1999.
10. R. S. Garfinkel and G. L. Nemhauser. Integer Programming. John Wiley and sons, New York, 1972.
11. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
12. S. D. Haynes, J. Stone, P. Y. K. Cheung, and W. Luk. Video image processing with the Sonic architecture. IEEE Computer. 33(4):50-57, April 2000.
13. M. Ishikawa and G. D. Micheli. A module selection algorithm for high-level synthesis. In Proc. IEEE International Symposium on Circuits and Systems, pages 1777-1780, 1991.
14. K. Kum and W. Sung. Word-length optimization for highlevel synthesis of digital signal processing systems. In Proc. IEEE International Workshop on Signal Processing Systems SIPS98, pages 569-678, 1998.
15. H. Schwab. lp-solve. ftp://ftp. es.ele.tue.nl/pub/lp-solve, 1997.
16. M. Willems, V. Bürsgens, H. Keding, T. Grötker, and M. Meyer. System-level fixed-point design based on an interpolative approach. In Proc. 34th Design Automation Conference, pages 293-298, June 1997.