A specialized architecture was developed and evaluated to evolve relatively large sorting networks in an ordinary FPGA. Genetic unit and fitness function are also implemented on the same FPGA. We evolved sorting networks up to N=28. The evolution of the largest sorting networks requires 10 hours in FPGA running at 100 MHz. The experiments were performed using COMBO6 card. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kořenek, J., & Sekanina, L. (2005). Intrinsic evolution of sorting networks: A novel complete hardware implementation for FPGAs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3637 LNCS, pp. 46–55). Springer Verlag. https://doi.org/10.1007/11549703_5
Mendeley helps you to discover research relevant for your work.