Skip to main content

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.


  • 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.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4419-6345-1_28
  • Chapter length: 26 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   259.00
Price excludes VAT (USA)
  • ISBN: 978-1-4419-6345-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Hardcover Book
USD   329.99
Price excludes VAT (USA)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Parhi K, (1999) VLSI digital signal processing systems, design and implementation, John Wiley & Sons, New York

    Google Scholar 

  2. Crochiere R, Oppenheim A, Analysis of linear digital networks, Proc. IEEE, no. 4, pp 581–595, Apr. 1975.

    CrossRef  Google 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 

  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.

    CrossRef  Google Scholar 

  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.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Keshab K. Parhi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Parhi, K.K., Chen, Y. (2010). Signal Flow Graphs and Data Flow Graphs. In: Bhattacharyya, S., Deprettere, E., Leupers, R., Takala, J. (eds) Handbook of Signal Processing Systems. Springer, Boston, MA.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-6344-4

  • Online ISBN: 978-1-4419-6345-1

  • eBook Packages: EngineeringEngineering (R0)