Signal Flow Graphs and Data Flow Graphs

  • Keshab K. Parhi
  • Yanni Chen


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.


Clock Cycle Critical Path Precedence Constraint Flow Graph Delay Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Parhi K, (1999) VLSI digital signal processing systems, design and implementation, John Wiley & Sons, New YorkGoogle Scholar
  2. 2.
    Crochiere R, Oppenheim A, Analysis of linear digital networks, Proc. IEEE, no. 4, pp 581–595, Apr. 1975.CrossRefGoogle Scholar
  3. 3.
    Bolton W, (1998) Newnes control engineering pocketbook, Oxford.Google Scholar
  4. 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. 5.
    Leiserson C, Rose F, Saxe J, Optimizing synchronous circuitry by retiming, Third Caltech Conference on VLSI, pp. 87–116, 1983.Google Scholar
  6. 6.
    Gerez S, Heemstra de Groot S, and Herrmann O, A polynomial-time algorithm for the computation of the iteration-period bound in recursive data flow graphs, IEEE Trans. On Circuits and Systems-I: Fundamental Theory and Applications, vol. 39, no. 1, pp 49–52, Jan. 1992.CrossRefGoogle Scholar
  7. 7.
    Ito K and Parhi K, Determining the minimum iteration period of an algorithm, Journal of VLSI Signal Processing, vol. 11, pp 229–244, 1995.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringUniversity of MinnesotaMinneapolisUSA
  2. 2.Marvell Semiconductor Inc.Santa ClaraUSA

Personalised recommendations