Abstract
A new cellular automaton-based approach allowing to generate sorting networks is presented. Since the traditional table-based transition function in this case involves excessive number of rules, a program-based representation of the transition function is applied. The sorting networks are encoded by the cell states and generated during the cellular automaton development. The obtained results are compared with our previous approaches utilizing cellular automata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bidlo, M., Vasicek, Z.: Gate-level evolutionary development using cellular automata. In: Proc. of The 3nd NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2008, pp. 11–18. IEEE Computer Society (2008)
Bidlo, M., Vasicek, Z.: Comparison of the uniform and non-uniform cellular automata-based approach to the development of combinational circuits. In: Proc. of The 4th NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2009, pp. 423–430. IEEE Computer Society (2009)
Bidlo, M., Vasicek, Z.: Instruction-based development of cellular automata. In: Proc. of The 2012 IEEE Congress on Evolutionary Computatio, CEC 2012, IEEE Computer Society (2012)
Bidlo, M., Vasicek, Z., Slany, K.: Sorting Network Development Using Cellular Automata. In: Tempesti, G., Tyrrell, A.M., Miller, J.F. (eds.) ICES 2010. LNCS, vol. 6274, pp. 85–96. Springer, Heidelberg (2010)
Bidlo, M., Škarvada, J.: Instruction-based development: From evolution to generic structures of digital circuits. International Journal of Knowledge-Based and Intelligent Engineering Systems 12(3), 221–236 (2008)
Choi, S.S., Moon, B.R.: Isomorphism, normalization, and a genetic algorithm for sorting network optimization. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 327–334. Morgan Kaufmann Publishers Inc., San Francisco (2002)
Haddow, P.C., Tufte, G.: Bridging the genotype–phenotype mapping for digital FPGAs. In: Proc. of the 3rd NASA/DoD Workshop on Evolvable Hardware, pp. 109–115. IEEE Computer Society, Los Alamitos (2001)
Koza, J.R., Keane, M.A., Streeter, M.J., Mydlowec, W., Yu, J., Lanza, G.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers (2003)
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn. Addison Wesley (1998)
Miller, J.F.: Evolving Developmental Programs for Adaptation, Morphogenesis, and Self-Repair. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds.) ECAL 2003. LNCS (LNAI), vol. 2801, pp. 256–265. Springer, Heidelberg (2003)
Miller, J.F., Thomson, P.: A Developmental Method for Growing Graphs and Circuits. In: Tyrrell, A.M., Haddow, P.C., Torresen, J. (eds.) ICES 2003. LNCS, vol. 2606, pp. 93–104. Springer, Heidelberg (2003)
von Neumann, J.: The Theory of Self-Reproducing Automata. In: Burks, A.W. (ed.) University of Illinois Press (1966)
Kumar, S., Bentley, P.J. (eds.): On Growth, Form and Computers. Elsevier Academic Press (2003)
Tufte, G., Haddow, P.C.: Towards development on a silicon-based cellular computing machine. Natural Computing 4(4), 387–416 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bidlo, M., Vasicek, Z. (2012). Cellular Automaton as Sorting Network Generator Using Instruction-Based Development. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33349-1
Online ISBN: 978-3-642-33350-7
eBook Packages: Computer ScienceComputer Science (R0)