Building and analyzing processing graphs on FPGAs with strong time and hardware constraints

Ke Du

Open source

DOI
10.70675/2db7bda9z874cz4787z8396z5de6b1106998
Published
Not recorded
Container
Not recorded
Publisher
Agence Bibliographique de l'Enseignement Supérieur
Open access
unknown

Credibility signals

uncertain Score 58/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.70675/2db7bda9z874cz4787z8396z5de6b1106998,
  title = {Building and analyzing processing graphs on FPGAs with strong time and hardware constraints},
  author = {Ke Du},
  doi = {10.70675/2db7bda9z874cz4787z8396z5de6b1106998},
  url = {https://doi.org/10.70675/2db7bda9z874cz4787z8396z5de6b1106998}
}

RIS

TY  - JOUR
TI  - Building and analyzing processing graphs on FPGAs with strong time and hardware constraints
AU  - Ke Du
DO  - 10.70675/2db7bda9z874cz4787z8396z5de6b1106998
UR  - https://doi.org/10.70675/2db7bda9z874cz4787z8396z5de6b1106998
ER  - 

APA

Du, K. (n.d.). Building and analyzing processing graphs on FPGAs with strong time and hardware constraints. https://doi.org/10.70675/2db7bda9z874cz4787z8396z5de6b1106998

Source records