Advertisement

Array Automata

  • Kendall PrestonJr.
  • Michael J. B. Duff
Part of the Advanced Applications in Pattern Recognition book series (AAPR)

Abstract

The idea that two-dimensional data arrays could be processed by matching arrays of computers was first introduced by von Neumann (1951). It was not until the paper by Unger (1958) that it was seriously proposed to construct such an array. Unger proposed using simple one-bit computers (processing elements) and, although Unger’s work inspired many subsequent proposals (e.g., McCormick, 1963), it took some fifteen years for technology to develop to the point where array construction was an economic proposition.

Keywords

Boolean Function Processing Element Random Access Memory Full Adder Instruction Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1984

Authors and Affiliations

  • Kendall PrestonJr.
    • 1
    • 2
    • 3
  • Michael J. B. Duff
    • 4
  1. 1.Carnegie-Mellon UniversityPittsburghUSA
  2. 2.University of PittsburghPittsburghUSA
  3. 3.Kensal ConsultingTusconUSA
  4. 4.University College LondonLondonEngland

Personalised recommendations