By Topic

Memory efficient software synthesis from dataflow graph

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)
Wonyong Sung ; Codesign & Parallel Process. Lab., Seoul Nat. Univ., South Korea ; Junedong Kim ; Soonhoi Ha

Due to the limited amount of memory resources in embedded systems, minimizing the memory requirements is an important goal of software synthesis. This paper presents a set of techniques to reduce the code and data size for software synthesis from graphical DSP programs based on the synchronous dataflow (SDF) model. By sharing the kernel code among multiple instances of a block, we can further reduce the code size below the single appearance schedule. And, a systematic approach is presented to give up single appearance schedules to reduce the data buffer requirements. Experimental results from two real examples prove the significance of the proposed techniques

Published in:

System Synthesis, 1998. Proceedings. 11th International Symposium on

Date of Conference:

2-4 Dec 1998