loading...
General Architecture for Hardware Implementation of Genetic Algorithm
Napa, California April 24-April 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FCCM.2006.4314th Annual IEEE Symposium on Field-P ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tatsuhiro Tachibana, Nara Institute of Science and Technology
Yoshihiro Murata, Nara Institute of Science and Technology
Naoki Shibata, Shiga University, Japan
Keiichi Yasumoto, Nara Institute of Science and Technology
Minoru Ito, Nara Institute of Science and Technology
In this paper, we propose a technique to flexibly implement Genetic Algorithms (GAs) for various problems on FPGAs. For the purpose, we propose a common architecture for GA. The proposed architecture allows designers to easily implement a GA as a hardware circuit consisting of parallel pipelines which execute GA operations. The proposed architecture is scalable to increase the number of parallel pipelines. The architecture is applicable to various problems and allows designers to estimate the size of resulting circuits. We give a model for predicting the size of resulting circuits from given parameters. Based on the proposed method, we have implemented a tool to facilitate GA circuit design and development. Through experiments using Knapsack Problem and Traveling Salesman Problem (TSP), we show that the FPGA circuits synthesized based on the proposed method run much faster and consume much lower power than software implementation on a PC, and that our model can predict the size of the resulting circuit accurately enough.
Citation:
Tatsuhiro Tachibana, Yoshihiro Murata, Naoki Shibata, Keiichi Yasumoto, Minoru Ito, "General Architecture for Hardware Implementation of Genetic Algorithm," fccm, pp.291-292, 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.