Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs

  • Nimish Sane
  • Hojin Kee
  • Gunasekaran Seetharaman
  • Shuvra S. Bhattacharyya
Article

DOI: 10.1007/s11265-011-0610-1

Cite this article as:
Sane, N., Kee, H., Seetharaman, G. et al. J Sign Process Syst (2011) 65: 229. doi:10.1007/s11265-011-0610-1

Abstract

Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interfaces (GUIs) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the dataflow interchange format (DIF) language—a language for specifying DSP-oriented dataflow graphs—with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.

Keywords

Dataflow graphs High-level languages Model-based design Topological patterns Signal processing systems 

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Nimish Sane
    • 1
  • Hojin Kee
    • 2
  • Gunasekaran Seetharaman
    • 3
  • Shuvra S. Bhattacharyya
    • 1
  1. 1.Department of Electrical and Computer Engineering, and Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA
  2. 2.National InstrumentsAustinUSA
  3. 3.Air Force Research LaboratoryRomeUSA

Personalised recommendations