Abstract
In this paper, we propose an algorithm of placement and routing for FPGA accelerators. The algorithm is designed to reduce the time for placement and routing of the register transfer level codes generated by a C to HDL compiler. In the codes generated from algorithms written in programming languages, only the limited kinds of operations are used, and they have strong sequentiality from top to bottom. Therefore, in our approach, all circuits for operations in the codes are placed and routed sequentially from top to bottom without finding global optimal placement in order to reduce the computation time. Experiments on some circuits showed good results. The execution time for placement/routing of about 100K gate circuits is a few seconds and more than 70% of CLBs can be utilized. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Miyashita, A., Fujiwara, T., & Maruyama, T. (2002). A placement/routing approach for FPGA accelerators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2438 LNCS, pp. 1177–1181). Springer Verlag. https://doi.org/10.1007/3-540-46117-5_135
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
