Resource-constrained loop list scheduler for DSP algorithms

Ching Yi Wang, Keshab K Parhi

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

We present a new algorithm for resource-constrained scheduling for digital signal processing (DSP) applications when the number of processors is fixed and the objective is to obtain a schedule with the minimum iteration period. This type of scheduling is best suited for moderate speed applications where conservation of area and power is more important than speed. We define and make use of new graph dependent constraints to obtain a lower bound estimate on the iteration period for any data-flow graph. By satisfying these constraints before performing the scheduling task, we can restrict the design space and can generate valid schedules in less time than previously reported. The graph dependent constraints provide a more accurate lower bound estimate on the iteration period than previously published results. This new scheduling algorithm exploits the iterative nature of DSP algorithms and uses an iterative-loop based scheduling approach. This resource scheduling algorithm has been incorporated in the Minnesota ARchitecture Synthesis (MARS) system. Our approach exploits inter-iteration and intra-iteration precedence constraints and incorporates implicit retiming and pipelining to generate optimal and near optimal schedules.

Original languageEnglish (US)
Pages (from-to)75-96
Number of pages22
JournalJournal of VLSI Signal Processing
Volume11
Issue number1-2
DOIs
StatePublished - Oct 1 1995

    Fingerprint

Cite this