2018
DOI: 10.1145/3243930
|View full text |Cite
|
Sign up to set email alerts
|

Automated Synthesis of Streaming Transfer Level Hardware Designs

Abstract: As modern field-programmable gate arrays (FPGA) enable high computing performance and efficiency, their programming with low-level hardware description languages is time-consuming and remains a major obstacle to their adoption. High-level synthesis compilers are able to produce register-transfer-level (RTL) designs from C/C++ algorithmic descriptions, but despite allowing significant design-time improvements, these tools are not always able to generate hardware designs that compare to handmade RTL designs. In … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…Induced forests and feedback vertex set problems have been extensively studied in the literature. Applications can be found in several domains, such as program verification (Shamir, 1979), deadlock prevention and resolution in operating systems (Wang et al., 1985; Carneiro et al., 2019), constraint satisfaction and bayesian inference (Dechter and Pearl, 1988; Bar‐Yehuda et al., 1998), the study of monopolies in distributed systems (Peleg, 1998), combinatorial circuit design (Bafna et al., 1999), optical networks (Kleinberg and Kumar, 2001), parallel systems and distributed computing (Bossard, 2014), complex networks (Zañudo et al., 2017), hardware description languages and compilation (Daigneault and David, 2018), automated systems for storage and retrieval (Gharehgozli et al., 2021), as well as biology systems and bioinformatics (Aracena et al., 2021).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Induced forests and feedback vertex set problems have been extensively studied in the literature. Applications can be found in several domains, such as program verification (Shamir, 1979), deadlock prevention and resolution in operating systems (Wang et al., 1985; Carneiro et al., 2019), constraint satisfaction and bayesian inference (Dechter and Pearl, 1988; Bar‐Yehuda et al., 1998), the study of monopolies in distributed systems (Peleg, 1998), combinatorial circuit design (Bafna et al., 1999), optical networks (Kleinberg and Kumar, 2001), parallel systems and distributed computing (Bossard, 2014), complex networks (Zañudo et al., 2017), hardware description languages and compilation (Daigneault and David, 2018), automated systems for storage and retrieval (Gharehgozli et al., 2021), as well as biology systems and bioinformatics (Aracena et al., 2021).…”
Section: Literature Reviewmentioning
confidence: 99%