The Community for Technology Leaders
Asia and South Pacific Design Automation Conference (2007)
Yokohama
Jan. 23, 2007 to Jan. 26, 2007
ISBN: 1-4244-0629-3
pp: 480-485
N. Liveris , Northwestern Univ., Evanston, IL
C. Lin , Northwestern Univ., Evanston, IL
J. Wang , Northwestern Univ., Evanston, IL
H. Zhou , Northwestern Univ., Evanston, IL
P. Banerjee , Northwestern Univ., Evanston, IL
ABSTRACT
In this paper we present a new algorithm for retiming synchronous dataflow (SDF) graphs. The retiming aims at minimizing the cycle length of an SDF. The algorithm is provably optimal and its execution time is improved compared to previous approaches.
INDEX TERMS
cycle length, retiming, synchronous data flow graphs
CITATION

C. Lin, J. Wang, H. Zhou, P. Banerjee and N. Liveris, "Retiming for Synchronous Data Flow Graphs," 2007 Asia and South Pacific Design Automation Conference(ASP-DAC), Yokohama, 2007, pp. 480-485.
doi:10.1109/ASPDAC.2007.358032
89 ms
(Ver 3.3 (11022016))