Software Synthesis from Dataflow Graphs
Shuvra S. Bhattacharyya
ISBN: | 9781461286011 |
Publisher: | Springer |
Published: | 5 October, 2011 |
Format: | Paperback |
Links | Australian Libraries (Trove) |
Editions: |
1 other edition
of this product
|
Software Synthesis from Dataflow Graphs
Shuvra S. Bhattacharyya
Software Synthesis from Dataflow Graphs addresses the problem of generating efficient software implementations from applications specified as synchronous dataflow graphs for programmable digital signal processors (DSPs) used in embedded real- time systems. The advent of high-speed graphics workstations has made feasible the use of graphical block diagram programming environments by designers of signal processing systems. A particular subset of dataflow, called Synchronous Dataflow (SDF), has proven efficient for representing a wide class of unirate and multirate signal processing algorithms, and has been used as the basis for numerous DSP block diagram-based programming environments such as the Signal Processing Workstation from Cadence Design Systems, Inc., COSSAP from Synopsys® (both commercial tools), and the Ptolemy environment from the University of California at Berkeley. A key property of the SDF model is that static schedules can be determined at compile time. This removes the overhead of dynamic scheduling and is thus useful for real-time DSP programs where throughput requirements are often severe. Another constraint that programmable DSPs for embedded systems have is the limited amount of on-chip memory. Off-chip memory is not only expensive but is also slower and increases the power consumption of the system; hence, it is imperative that programs fit in the on-chip memory whenever possible. Software Synthes
Shop Preferences
Customize which shops to display. You can include the following shops by logging in to change your settings.