Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart

Share/Save/Bookmark

Heemstra de Groot, Sonia M. and Herrmann, Otto E. (1990) Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart. In: IEEE International Symposium on Circuits and Systems, ISCAS 1990, 1-3 May 1990, New Orleans, USA (pp. pp. 1805-1808).

open access
[img]
Preview
PDF
453kB
Abstract:A method for rate-optimal scheduling of recursive DSP algorithms is presented. The approach is based on the determination of the scheduling window of each operation and the construction of a scheduling-range chart. The information in the chart is used during scheduling to optimize some quality criteria (number of hardware resources, latency, register life time) at the same time that a rate-optimal solution is guaranteed. An algorithm based on this approach is introduced. It can schedule cyclic as well as acyclic data-flow graphs. The algorithm is powerful enough to solve optimally some problems for which other proposed methods fail
Item Type:Conference or Workshop Item
Copyright:© 1990 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/16201
Official URL:http://dx.doi.org/10.1109/ISCAS.1990.111986
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 113086