Determining the iteration bounds of single-rate and multi-rate data-flow graphs

2002 ◽  
Author(s):  
K. Ito ◽  
K.K. Parhi
Keyword(s):  
Data Flow ◽  
Rate Data ◽  
Data Flow Graphs ◽  
Flow Graphs

Signal Processing

2016 ◽  
pp. 153-177
Author(s):  
Deepika Ghai ◽  
Neelu Jain
Keyword(s):  
Signal Processing ◽  
Data Flow ◽  
Digital Signal ◽  
Rate Data ◽  
Data Flow Graph ◽  
Flow Graph ◽  
Iteration Bound ◽  
Signal Processing Algorithms ◽  
Data Flow Graphs ◽  
Flow Graphs

Digital signal processing algorithms are recursive in nature. These algorithms are explained by iterative data-flow graphs where nodes represent computations and edges represent communications. For all data-flow graphs, time taken to achieve output from the applied input is referred as iteration bound. In this chapter, two algorithms are used for computing the iteration bound i.e. Longest Path Matrix (LPM) and Minimum Cycle Mean (MCM). The iteration bound of single-rate data-flow graph (SRDFG) can be determined by considering the Multi-rate data-flow graph (MRDFG) equivalent of the SRDFG. SRDFG contain more nodes and edges as compared to MRDFG. Reduction of nodes and edges in MRDFG is used for faster determination of the iteration bound.

scholarly journals Inductive data flow graphs

2013 ◽  
Vol 48 (1) ◽  
pp. 129-142 ◽  
Author(s):  
Azadeh Farzan ◽  
Zachary Kincaid ◽  
Andreas Podelski
Keyword(s):  
Data Flow ◽  
Data Flow Graphs ◽  
Flow Graphs

Liveness and Boundedness of Synchronous Data Flow Graphs

2006 ◽  
Author(s):  
A.H. Ghamarian ◽  
M.C.W. Geilen ◽  
T. Basten ◽  
B.D. Theelen ◽  
M.R. Mousavi ◽  
...  
Keyword(s):  
Data Flow ◽  
Data Flow Graphs ◽  
Synchronous Data Flow ◽  
Flow Graphs
Sign in / Sign up

Export Citation Format

Share Document