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

S.M. Heemstra de Groot, O.E. Herrmann

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    7 Citations (Scopus)
    51 Downloads (Pure)


    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
    Original languageUndefined
    Title of host publicationProceedings of the International Conference on circuits and systems 1990
    Number of pages4
    Publication statusPublished - 1 Sep 1990

    Publication series



    • METIS-113086
    • IR-16201

    Cite this