Loop list scheduler for DSP algorithms under resource constraints

Ching Yi Wang, Keshab K Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We present a new algorithm for resource-constrained scheduling for DSP applications. We define new graph dependent constraints which directly results in the smallest iteration period for any data-flow graph. Previous synthesis systems have focused on simple DSP algorithms which contain no recursive loops or have single delays in the recursive loops. MARS is not restricted to such algorithms. This approach exploits inter-iteration and intra-iteration precedence constraints and incorporates implicit retiming and pipelining in generating optimal and near optimal schedules.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages1662-1665
Number of pages4
Volume3
ISBN (Print)0780312813
StatePublished - Jan 1 1993
EventProceedings of the 1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, USA
Duration: May 3 1993May 6 1993

Other

OtherProceedings of the 1993 IEEE International Symposium on Circuits and Systems
CityChicago, IL, USA
Period5/3/935/6/93

Fingerprint

Dive into the research topics of 'Loop list scheduler for DSP algorithms under resource constraints'. Together they form a unique fingerprint.

Cite this