Timothy W. O'Neil
synchronous data-flow graphs, unfolding
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.
Important Links:
Go Back
