Abstract
Binary matrixes (matrixes having only 0 and 1 elements) occur in many theoretical and practical areas (e.g. in the theory of graphs and relations, grammars, coding, etc.) therefore the binary matrix operations have high importance in these topics. It is an obvious idea to use cellular processor consisting of micro-cells for the execution of these operations. The present paper gives a powerful cellular algorithm for the multiplication of two binary matrixes, taking into account the cellprocessor architecture developed by T. Legendi. Moreover, on the basis of this solution cellular algorithms are given for coding and for the computation of the m-th power of a binary matrix.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Legendi: Cellprocessors in computer architecture (Computational Linguistics and Computer Languages, vol. XI, 1977, pp. 147–167)
T. Legendi: A 2D transition function definition language for a subsystem of the CELLAS cellular processor simulation language (Computational Linguistics and Computer Languages, vol. XIII, 1979, pp. 169–194)
T. Legendi: Programming of cellular processors (Proceedings of the Braunschweig Cellular Meeting, June 2–3, 1977)
E. Katona — T. Legendi: Cellular algorithms for decimal arithmetic operations (to appear in Elektronische Informationsverarbeitung und Kybernetic, Akademie-Verlag, Berlin)
E. Katona: Binary addition and multiplication in cellular space (submitted to the conference FCT'81, Szeged, Hungary)
E. Katona: The application of cellprocessors in conventional data processing (Proceedings of the Third Hungarian Computer Science Conference, Budapest, 1981)
E. Katona: Cellular algorithms (Selected results of the cell-processor team led by T. Legendi; Von Neumann Society, Budapest, 160 pages, in Hungarian)
E. Katona: Cellular algorithms for binary matrix operations (manuscript in Hungarian)
G. Polner: Coding of bitstrings according to a binary matrix (manuscript in Hungarian)
R. Vollmar: Algorithmen in Zellularautomaten (B. G. Teubner, Stuttgart, 1979, 192 pages)
W. T. Beyer: Recognition of topological invariants by iterative arrays (Ph.D. diss., MIT, Cambridge, Mass., 1969)
H. Nishio: Real time sorting of binary numbers by 1-dimensional cellular automaton (Proceedings of the International Symposium on Uniformly Structured Automata and Logic, Tokyo, 1975, pp. 153–162)
G. Fay: Cellular design principles: a case study of maximum selection in CODD-ICRA cellular space (Computational Linguistics and Computer Languages, vol. XI, pp. 73–124 and vol. XII, pp. 165–231, 1978)
W. M. Gentleman: Some complexity results for matrix computations on parallel processors (Journal of the ACM, vol. 25, 1978, pp. 112–115)
A. R. Smith: Cellular automata Theory (Technical Report no. 2, Stanford University, Stanford, Cal., 1969)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katona, E. (1981). Cellular algorithms for binary matrix operations. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105119
Download citation
DOI: https://doi.org/10.1007/BFb0105119
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10827-6
Online ISBN: 978-3-540-38715-2
eBook Packages: Springer Book Archive