Publication Details
A Developmental Method for Construction of Arbitrarily Large Sorting Networks and Adders
Genetic algorithm, development, digital circuits design, sorting network, binary adder
An approach is presented for the construction of arbitrarily large sorting networks and adders using development and genetic algorithm. A novel solution was evolved in comparison with a conventional sorting networks (e.g. bubble-sort networks).
The paper deals with a non-traditional design method inspired by natural
ontogenesis (an embryonic approach) for construction of combinational logic
circuits (in particular sorting networks and adders). The general principle of the technique is based on a set of proper
instructions known beforehand that are repeatedly applied on the embryo
(a trivial instance of a problem) to construct more complex system. Genetic algorithm is used to find a suitable
sequence of instructions -- a prescription for the growth of the embryo. The system complexity can increase continually and infinitely. It is shown that
by employing of this approach the genetic algorithm is able to (1) rediscover the
principle of already known method and (2) find a novel algorithm, by means of
which we can obtain better solutions in comparison with a conventional method.
@TECHREPORT{FITPUB7736,
author = "Michal Bidlo",
title = "A Developmental Method for Construction of Arbitrarily Large Sorting Networks and Adders",
pages = 8,
year = 2005,
location = "Brno, CZ",
publisher = "Faculty of Information Technology BUT",
language = "english",
url = "https://www.fit.vut.cz/research/publication/7736"
}