Parameterized dataflow modeling of DSP systems

  • Authors:
  • B. Bhattacharya;S. S. Bhattacharyya

  • Affiliations:
  • Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA;-

  • Venue:
  • ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dataflow has proven to be an attractive computation model for programming DSP applications. A restricted version of dataflow, termed synchronous dataflow (SDF), that offers strong compile-time predictability properties, but has limited expressive power, has been studied extensively in the DSP context. Many extensions to synchronous dataflow have been proposed to increase its expressivity, while maintaining its compile-time predictability properties as much as possible. We propose a parameterized data-flow framework that can be applied as a meta-modeling technique to significantly improve the expressive power of an arbitrary data-flow model that possesses a well-defined concept of a graph iteration. Indeed, the parameterized dataflow framework is compatible with many of the existing dataflow models for DSP including SDF, CSDF, and SSDF. We develop a precise, formal semantics for parameterized synchronous dataflow that allows data-dependent dynamic DSP systems to be modeled in a natural and intuitive fashion. Desirable properties of a modeling environment like dynamic re-configurability and design re-use emerge as inherent characteristics of the parameterized framework. An example of a speech compression application is used to illustrate the efficacy of the parameterized modeling techniques in real-life data-dependent DSP systems.