By Topic

Hierarchization of a priori defined dataflow subgraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Willems, M. ; Aachen Univ. of Technol., Germany ; Zivojnovic, V. ; Ritz, S.

DSP algorithms are frequently represented by dataflow graphs. These graphs serve as an abstract input specification for an implementation, either in software or hardware. While doing so, the transformation process might require a special treatment of specific subgraphs within the complete dataflow graph. A hierarchization of a subgraph appears as a replacement of the subgraph by a single vertex, representing the same functionality. The subgraph to be hierarchized might be defined by the designer manually or identified automatically, matching certain criterions. Because of the possibility of introducing a deadlock, not every hierarchization is valid. This paper presents an approach that allows to identity such deadlocking subgraphs. If an a priori defined subgraph is identified to result in a deadlock, a concept is presented that allows one to separate the subgraph into sub-subgraphs of maximum size. This allows to apply the special treatment to these sub-subgraphs and not to cancel it completely

Published in:

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on  (Volume:6 )

Date of Conference:

7-10 May 1996