Journal of Signal Processing Systems

, Volume 71, Issue 3, pp 275–286

Parameterized Scheduling of Topological Patterns in Signal Processing Dataflow Graphs

Authors

    • Department of Electrical and Computer Engineering,and Institute for Advanced Computer StudiesUniversity of Maryland
  • Chung-Ching Shen
    • Department of Electrical and Computer Engineering,and Institute for Advanced Computer StudiesUniversity of Maryland
  • Shenpei Wu
    • Department of Electrical and Computer Engineering,and Institute for Advanced Computer StudiesUniversity of Maryland
  • Shuvra S. Bhattacharyya
    • Department of Electrical and Computer Engineering,and Institute for Advanced Computer StudiesUniversity of Maryland
Article

DOI: 10.1007/s11265-012-0719-x

Cite this article as:
Wang, L., Shen, C., Wu, S. et al. J Sign Process Syst (2013) 71: 275. doi:10.1007/s11265-012-0719-x
  • 237 Views

Abstract

In recent work, a graphical modeling construct called “topological patterns” has been shown to enable concise representation and direct analysis of repetitive dataflow graph sub-structures in the context of design methods and tools for digital signal processing systems (Sane et al. 2010). In this paper, we present a formal design method for specifying topological patterns and deriving parameterized schedules from such patterns based on a novel schedule model called the scalable schedule tree. The approach represents an important class of parameterized schedule structures in a form that is intuitive for representation and efficient for code generation. Through application case studies involving image processing and wireless communications, we demonstrate our methods for topological pattern representation, scalable schedule tree derivation, and associated dataflow graph code generation.

Keywords

SchedulingDataflowSoftware toolsImage registrationTurbo decoder

Copyright information

© Springer Science+Business Media New York 2012