Publications

Detailed Information

Optimized RTL Code Generation from Coarse-Grain Dataflow Specification for Fast HW/SW Cosynthesis

Cited 8 time in Web of Science Cited 11 time in Scopus
Authors

Jung, Hyunuk; Yang, Hoeseok; Ha, Soonhoi

Issue Date
2008-07
Publisher
Springer Verlag
Citation
J Sign Process Syst, 52(1), 13-34, July
Keywords
HW/SW codesignsystem level designdataflow graph (DFG)RTLVHDL
Abstract
This paper presents a new methodology of automatic RTL code generation from coarse-grain dataflow specification for fast HW/SW cosynthesis. A node in a coarse-grain dataflow specification represents a functional block such as FIR and DCT and an arc may deliver multiple data samples per block invocation, which complicates the problem and distinguishes it from behavioral synthesis problem. Given optimized HW library blocks for dataflow nodes, we aim to generate the RTL codes for the entire hardware system including glue logics such as buffer and MUX, and the central controller. In the proposed design methodology, a dataflow graph can be mapped to various hardware structures by changing the resource allocation and schedule information. It simplifies the management of the area/performance tradeoff in hardware design and widens the design space of hardware implementation of a dataflow graph. We also support Fractional Rate Dataflow (FRDF) specification for more efficient hardware implementation. To overcome the additional hardware area overhead in the synthesized architecture, we propose two techniques reducing buffer overhead. Through experiments with some real examples, the usefulness of the proposed technique is demonstrated.
ISSN
1939-8018 (print)
1939-8115 (online)
Language
English
URI
https://hdl.handle.net/10371/7508
DOI
https://doi.org/10.1007/s11265-007-0070-9
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share