Scheduling on Cyclo Static Data Flow Graphs

This Book main objective is to present differentalgorithms for showing how to schedule cyclo staticdata flow graphs(CSDFGs) which are used to representdigital signal processing applications and tooptimize their schedules. We present an iterationbound equation for CSDFGs and equation for checkingthe liveness of a CSDFG which is a key factor forconstructing a static schedule. Optimizing theschedule is also explained by designing rotationscheduling algorithm which continuously applies thedown rotate operation on the given CSDFG for aconstant number of times, which is determinedexperimentally.