Machine Complexity Versus Interconnection Complexity in Iterative Arrays
- 1 March 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (3) , 321-323
- https://doi.org/10.1109/t-c.1971.223238
Abstract
A procedure is given for the construction of a von Neumann neighborhood iterative array to simulate a Moore neighborhood array in real time for the cases of up to three-dimensional arrays. The increase in the typical machine complexity accompanying this neighborhood complexity reduction is significantly less than that found in the general n-dimensional study of Cole [1].Keywords
This publication has 2 references indexed in Scilit:
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State MachinesIEEE Transactions on Computers, 1969
- Machines models of self-reproductionPublished by American Mathematical Society (AMS) ,1962