Abstract
In this paper we develop a model of cellular automata for massive parallel arithmetic computations with complex numbers on a bit level, show that complex numbers should be represented in the second order negabinary coding system, and suggest a system of automaton rules for evaluating complex arithmetic expressions.
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
References
Bandman O. L., Cellular-Neural Computations. Formal Model and Possible Applications.-Parallel Computing Technologies: Third International Conference, PaCT-95, St. Petersburg, Russia, September 12-25, 1995. pp. 21–35.
Valkovskii V. A., Zerbino D. D. The Realization of Arithmetical Computation in Alternative Codes on Cellular Automata.-Problems of Information and Control, No 2, 1997, pp. 49–64. (in Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farid, T., Zerbino, D. (1999). Realization of Complex Arithmetic on Cellular Automata. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_51
Download citation
DOI: https://doi.org/10.1007/3-540-48387-X_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66363-8
Online ISBN: 978-3-540-48387-8
eBook Packages: Springer Book Archive