Skip to main content
SpringerLink
Log in
Book cover

Handbook of Signal Processing Systems pp 1277–1302Cite as

Signal Flow Graphs and Data Flow Graphs

  • Chapter
  • First Online:

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  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. Parhi, K.: VLSI Digital Signal Processing Systems, Design and Implementation. John Wiley & Sons, New York (1999)

    Google Scholar 

  3. Crochiere, R., Oppenheim, A.: Analysis of linear digital networks. Proc. IEEE 64(4), 581–595 (1975)

    Article  Google Scholar 

  4. Bolton, W.: Newnes Control Engineering Pocketbook. Newnes, Oxford, UK (1998)

    Google Scholar 

  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. Leiserson, C., Rose, F., Saxe, J.: Optimizing synchronous circuitry by retiming. In: Third Caltech Conference on VLSI, pp. 87–116 (1983)

    Google Scholar 

  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. Ito, K., Parhi, K.: Determining the minimum iteration period of an algorithm. Journal of VLSI Signal Processing 11(3), 229–244 (1995)

    Article  Google Scholar 

Download references

Acknowledgements

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.

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Minnesota, 200 Union St.S.E., Minneapolis, MN, 55455, USA

    Keshab K. Parhi

  2. Marvell Semiconductor Inc., 5488 Marvell Lane, Santa Clara, CA, 95054, USA

    Yanni Chen

Authors
  1. Keshab K. Parhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yanni Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Keshab K. Parhi .

Editor information

Editors and Affiliations

  1. , Dept. of Electrical and, University of Maryland, A. V. Williams Bldg. 2311, College Park, 20742, Maryland, USA

    Shuvra S. Bhattacharyya

  2. Leiden Inst. Advanced Computer Science, Leiden Embedded Research Center, Leiden University, Niels Bohrweg 1, Leiden, 2333 CA, Netherlands

    Ed F. Deprettere

  3. Software for Systems on Silicon, RWTH Aachen University, Templergraben 55, Aachen, 52056, Germany

    Rainer Leupers

  4. , Department of Pervasive Computing, Tampere University of Technology, Korkeakoulunkatu 1, Tampere, 33720, Finland

    Jarmo Takala

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Parhi, K.K., Chen, Y. (2013). Signal Flow Graphs and Data Flow Graphs. In: Bhattacharyya, S., Deprettere, E., Leupers, R., Takala, J. (eds) Handbook of Signal Processing Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6859-2_39

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6859-2_39

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6858-5

  • Online ISBN: 978-1-4614-6859-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation