Sorting network development using cellular automata

  • Authors:
  • Michal Bidlo;Zdenek Vasicek;Karel Slany

  • Affiliations:
  • Brno University of Technology, Faculty of Information Technology, Brno, Czech republic;Brno University of Technology, Faculty of Information Technology, Brno, Czech republic;Brno University of Technology, Faculty of Information Technology, Brno, Czech republic

  • Venue:
  • ICES'10 Proceedings of the 9th international conference on Evolvable systems: from biology to hardware
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The sorting network design represents a task that has often been considered as a benchmark for various applications of evolutionary design and optimization techniques. Although the specific structure of this class of circuits allows to use a simple encoding in combination with additional mechanisms for optimizing the area- and delay-efficiency of designed sorting networks, the design of large sorting networks represents a difficult task. This paper proposes a novel cellular automaton-based approach for the development of specific instances of sorting networks. In order to explore the area of generative cellular automata applied on this specific circuit structures, two different encodings are introduced: (1) an absolute encoding and (2) a relative encoding. The abilities of the both techniques are investigated and a comparative study is provided considering a variety of experimental settings.