Abstract
It is a often hard to find a feasible and optimum route because the routing resources are constrained in coarse-grain RA (CGRA) and several functions are often defined in same one element of RA. In this paper, a proposed propriety-based path encoding genetic algorithm is applied for the routing problem of CGRA. By mapping Fast Fourier Transform of the butterfly computation to CTaiJi that is a newly developed CGRA, the proposed GA shows good ability to find the good solution. © Springer-Verlag 2009.
Author supplied keywords
Cite
CITATION STYLE
Guo, Y., Zeng, S., Kang, L., Liu, G., Hu, N., & Zhao, K. (2009). A route system based on genetic algorithm for coarse-grain reconfigurable architecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5821 LNCS, pp. 11–17). https://doi.org/10.1007/978-3-642-04843-2_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
