Sorting Network Development Using Cellular Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F10%3APU89584" target="_blank" >RIV/00216305:26230/10:PU89584 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Sorting Network Development Using Cellular Automata
Original language description
The sorting network design represents a task that has often been considered as a benchmark for various applications of evolutionary<br>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 dierent 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.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)