Abstract
Synchronous data flow graphs (SDFGs) are widely used to model digital signal processing (DSP) algorithms and streaming applications. Any valid SDFG can be converted to an equivalent homogenous SDFG (HSDFG). Retiming and unfolding are important graph transformation techniques for performance optimization of SDFGs. In this paper, we review the relationship among the three transformation techniques and reveal the equivalence of the combinations of them. The equivalence makes it possible to analyze and optimize SDFGs directly, without carrying out the explicit conversion procedures which are usually time and space-consuming.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
