Machine Complexity Versus Interconnection Complexity in Iterative Arrays
Volkmar Hamacher · IEEE Transactions on Computers · 1971
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].