Intrinsic Evolution of Sorting Networks: A Novel Complete Hardware Implementation for FPGAs

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.

• Type: Conference
• Year: 2005
• Where: ICES
• Authors: Jan Korenek, Lukás Sekanina
• Keywords: ICES 2005, Large Sorting Networks, Largest Sorting Networks, Ordinary Fpga