IEEE Computer Society Annual Symposium on VLSI
DOI: 10.1109/isvlsi.2004.1339528
|View full text |Cite
|
Sign up to set email alerts
|

Control and data flow graph extraction for high-level synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0
1

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(15 citation statements)
references
References 4 publications
0
14
0
1
Order By: Relevance
“…Translating a behavioral specification to the Register Transfer Level and deriving a data and control flow graph is shown in [23]. The behavioral description is written in a hardware description language, instead of a high-level programming language.…”
Section: Related Workmentioning
confidence: 99%
“…Translating a behavioral specification to the Register Transfer Level and deriving a data and control flow graph is shown in [23]. The behavioral description is written in a hardware description language, instead of a high-level programming language.…”
Section: Related Workmentioning
confidence: 99%
“…Existing methods for the definition of the structures of control and data flow graphs are shown in [37][38][39][40][41][42][43]. The following techniques are suggested for obtaining the element level parameters.…”
Section: Obtaining Of Required Parametersmentioning
confidence: 99%
“…Scheduling and allocation are operations on this CDFG representation. However, conventional CDFGs [28] do not provide a method for supporting parallel and timed constructs. This is because traditional HLS methods automatically extract parallelism from sequential specifications, and there is no ability to specify explicitly parallel and timed behaviors.…”
Section: Extending Cdfgs To Support Parallel Andmentioning
confidence: 99%