Data routing in dataflow graphs

An extension to the cyclo-static dataflow graph model ([5]) is proposed. It is based an the insight that in current digital signal processing (DSP) applications a significant amount of time and resources is spend on the routing of the data between the processing operations. If this part of the application is to be synthesized from a specification to a software or a hardware realization both automatically and efficiently, a systematic approach is to be taken for that data routing. The new model fits in GRAPE, an environment for the fast prototyping DSP systems on arbitrary target architectures, consisting of programmable DSP processors and FPGAs. Besides the definition of the model, we present some clarifying examples. We discuss the code generation of data-routing specifications for a specific synthesis path. Finally, a larger example and ifs implementation validate the model.