Unfolding Synchronous Data-Flow Graphs
Timothy W. O’Neil · Parallel and distributed computing and systems · 2011
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). Despite claims to the contrary,the unfoldingof such graphs proves to be a non-trivial problem. We demonstrate this in thispaper,aswell asspecifythecircumstancesunderwhich unfolding may take place.