Unfolding Synchronous Data-Flow Graphs

2011 Parallel and Distributed Computing and Systems   unpublished
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). Despite claims to the contrary, the unfolding of such graphs proves to be a non-trivial problem. We demonstrate this in this paper, as well as specify the circumstances under which unfolding may take place.
doi:10.2316/p.2011.757-098 fatcat:hdkbdhzaq5cd5hoicc45ta7t2e