Signal Flow Graphs and Data Flow Graphs



This chapter first introduces two types of graphical representations of digital signal processing algorithms including signal flow graph (SFG) and data flow graph (DFG). Since SFG and DFG are in general used for analyzing structural properties and exploring architectural alternatives using high-level transformations, such transformations including retiming, pipelining, unfolding and folding will then be addressed. Finally, their real-world applications to both hardware and software design will be presented.


Clock Cycle Field Programmable Gate Array Critical Path Precedence Constraint Flow Graph 
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.



Many parts of the text and figures in this chapter are taken from the text book in [2]. These have been reprinted with permission of John Wiley & Sons, Inc. The authors are grateful to John Wiley & Sons, Inc., for permitting the authors to use these figures and parts of the text from [2]. They are also grateful to George Telecki, associate publisher at Wiley for his help in this regard.


  1. 1.
    Woods, R.: Mapping decidable signal processing graphs into FPGA implementations. In: S.S. Bhattacharyya, E.F. Deprettere, R. Leupers, J. Takala (eds.) Handbook of Signal Processing Systems, second edn. Springer (2013)Google Scholar
  2. 2.
    Parhi, K.: VLSI Digital Signal Processing Systems, Design and Implementation. John Wiley & Sons, New York (1999)Google Scholar
  3. 3.
    Crochiere, R., Oppenheim, A.: Analysis of linear digital networks. Proc. IEEE 64(4), 581–595 (1975)CrossRefGoogle Scholar
  4. 4.
    Bolton, W.: Newnes Control Engineering Pocketbook. Newnes, Oxford, UK (1998)Google Scholar
  5. 5.
    Lee, E., Messerschmitt, D.: Synchronous data flow. Proc. IEEE, special issue on hardware and software for digital signal processing 75(9), 1235–1245 (1987)Google Scholar
  6. 6.
    Leiserson, C., Rose, F., Saxe, J.: Optimizing synchronous circuitry by retiming. In: Third Caltech Conference on VLSI, pp. 87–116 (1983)Google Scholar
  7. 7.
    Gerez, S., Heemstra de Groot, S., 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 39(1), 49–52 (1992)Google Scholar
  8. 8.
    Ito, K., Parhi, K.: Determining the minimum iteration period of an algorithm. Journal of VLSI Signal Processing 11(3), 229–244 (1995)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2013

Authors and Affiliations

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

Personalised recommendations