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 language | English (US) |
---|---|
Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |
Publisher | Publ by IEEE |
Pages | 1662-1665 |
Number of pages | 4 |
Volume | 3 |
ISBN (Print) | 0780312813 |
State | Published - Jan 1 1993 |
Event | Proceedings of the 1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, USA Duration: May 3 1993 → May 6 1993 |
Other
Other | Proceedings of the 1993 IEEE International Symposium on Circuits and Systems |
---|---|
City | Chicago, IL, USA |
Period | 5/3/93 → 5/6/93 |