Signal Flow Graphs and Data Flow Graphs
Signal processing programs differ from the traditional computing programs in the sense that these programs are referred to as non-terminating programs. In other words, input samples are processed periodically (typically with a certain iteration period or sampling period) and the tasks are repeated infinite number of times. A traditional dependence graph representation of such a program would require infinite number of nodes. Signal flow graphs and data flow graphs are powerful representations of signal processing algorithms and signal processing systems because these can represent the operations using a finite number of nodes.
KeywordsClock Cycle Critical Path Precedence Constraint Flow Graph Delay Element
Unable to display preview. Download preview PDF.
- 1.Parhi K, (1999) VLSI digital signal processing systems, design and implementation, John Wiley & Sons, New YorkGoogle Scholar
- 3.Bolton W, (1998) Newnes control engineering pocketbook, Oxford.Google Scholar
- 4.Lee E, Messerschmitt D, Synchronous data flow, Proc. IEEE, special issue on hardware and software for digital signal processing, pp.1235–1245, Sept. 1987.Google Scholar
- 5.Leiserson C, Rose F, Saxe J, Optimizing synchronous circuitry by retiming, Third Caltech Conference on VLSI, pp. 87–116, 1983.Google Scholar