This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms for High-Level Synthesis
November/December 1989 (vol. 6 no. 6)
pp. 18-31

Synthesis algorithms that offer a technique for scheduling operations and allocating registers and buses in light of both timing constraints and available hardware resources are presented. They enhance current scheduling techniques by using a global priority function that minimizes storage, interconnections, and functional unit cost. Algorithms for allocating registers and buses minimize storage and interconnection costs and take into account the interdependence of both tasks. The algorithms are also applicable to more than one method of synthesis; although first implemented in the HAL system, they have since been integrated into more specialized high-level synthesis systems.

Citation:
Pierre G. Paulin, John P. Knight, "Algorithms for High-Level Synthesis," IEEE Design & Test of Computers, vol. 6, no. 6, pp. 18-31, Nov.-Dec. 1989, doi:10.1109/54.41671
Usage of this product signifies your acceptance of the Terms of Use.