A LEARNING MACHINE SYNAPSE PROCESSOR SYSTEM APPARATUS

Abstract: A neural synapse processor apparatus having a neuron architecture for the synapse processing elements of the apparatus. The apparatus which we prefer will have a N neuron structure having synapse processing units that contain instruction and data storage units, receive instructions and data, and execute instructions. The N neuron structure should contain communicating adder trees, neuron activation function units, and an arrangement for communicating both instructions, data, and the outputs of neuron activation function units back to the input synapse processing units by means of the communicating adder trees. The apparatus can be structured as a bit-serial or word parallel system. The preferred structure contains N<2> synapse processing units, each associated with a connection weight in the N neural network to be emulated, placed in the form of a N by N matrix that has been folded along the diagonal and made up of diagonal cells and general cells. Diagonal cells, each utilizing a single synapse processing unit, are associated with the diagonal connection weights of the folded N by N connection weight matrix and general cells, each of which has two synapse processing units merged together, and which are associated with the symmetric connection weights of the folded N by N connection weight matrix. The back-propagation learning algorithm is first discussed followed by a presentation of the learning machine synapse processor architecture. An example implementation of the back-propagation learning algorithm is then presented. This is followed by a Boltzmann like machine example and data parallel examples mapped onto the architecture.

Description: A LEARNING MACHINE SYNAPSE PROCESSOR SYSTEM APPARATUS CROSS REFERENCE TO RELATED APPLICATIONS The present application claims priority and is a continuation-in- part of the following related co-pending Patent Applications: APPARATUS AND METHOD FOR NEURAL PROCESSOR, S. Vassiliadis, and G.G. Pechanek, U.S. Serial No. 07/526,866, filed May 18, 1990, (IBM Docket EN9-90-045), sometimes referred to as "SNAP". A TRIANGULAR SCALABLE NEURAL ARRAY PROCESSOR, G.G. Pechanek, and S. Vassiliadis, U.S. Serial No. 07/682,785, filed April 8, 1991 (IBM Docket EN9-91-018) sometimes referred to as "T-SNAP". SPIN: A SEQUENTIAL PIPELINED NEURO COMPUTER, S. Vassiliadis, G.G. Pechanek.and J.G. Delgado-Frias, U.S. Serial No. 07/682, , filed April 8, 1991 (IBM Docket EN9-91-026) sometimes referred to as "SPIN". In addition, filed concurrently are related applications: VIRTUAL NERUOCOMPUTER ARCHITECTURES FOR NEURAL NETWORKS, G.G. Pechanek, J.G. Delgado-Frias, and S. Vassiliadis, U.S. Serial No. 07/ , filed May, , 1991 (IBM Docket EN9-91-053) some¬ times referred to as "VIRTUAL". PLAN: PYRAMID LEARNING ARCHITECTURE NEUROCOMPUTER, G.G. Pechanek, S. Vassiliadis, and J.G. Delgado-Frias, U.S. Serial No. 07/ , filed May , 1991 (IBM Docket EN9-91-055) some¬ times referred to as "PLAN". SCALABLE FLOW VIRTUAL LEARNING NEUROCOMPUTER G.G. Pechanek, S. Vassiliadis, and J.G. Delgado-Frias, U.S. Serial No. 07/ , filed May , 1991 (IBM Docket EN9-91-054) sometimes referred to as "SVLM". These co-pending applications and the present application are owned by one and the same assignee, namely, International Business Machines Corpo¬ ration of Armonk, New York. The descriptions set forth in these co-pending applications are hereby incor¬ porated into the present application by this reference. FIELD OF THE INVENTION This invention relates to computer systems and particularly to a learning machine synapse processor system architecture which can provide the Back- Propogation, a Boltzmann like machine, and matrix processing illustrated by the examples which can be implemented by the described computer system. REFERENCES USED IN THE DISCUSSION OF THE INVENTIONS During the detailed discussion of our inventions, we will reference other work including our own unpublished works which are not Prior Art but which will aid the reader in following our discussion. These additional references are: D.E. Rumelhart, J.L. McClelland, and the PDP Research Group, Parallel Dis¬ tributed Processing Vol. 1: Foundations Cambridge, Massachusetts: MIT Press 1986. (Herein referred to as "Rumelhart 86".) J.N. Hwang, J. A. Vlontzos, and S.Y. Kung, "A Systolic Neural Network Archi¬ tecture for Hidden Markov Models, IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol 37, No 12. pp. 1967-1979, 1989. (Herein referred to as'Ηwang 89".) . M. Caudill, "Neural Networks Primer - Part III," Al Expert pp. 53-59, June 1988. (Herein referred to as"Caudill 88".) APPARATUS AND METHOD FOR NEURAL PROCESSOR, S. Vassiliadis, and G.G. Pechanek, U.S. Serial No. 07/526,866, filed May 18, 1990, (IBM Docket EN9-90-045, herein sometimes referred to as "SNAP" or "Vassiliadis SNAP 90".) A TRIANGULAR SCALABLE NEURAL ARRAY PROCESSOR, G.G. Pechanek, and S. Vassiliadis, U.S. Serial No. 07/682,785, filed April 8, 1991 (IBM Docket EN9-91-018 herein sometimes referred to as "T-SNAP" or "T-SNAP".) SPIN: A SEQUENTIAL PIPELINED NEURO COMPUTER, S. Vassiliadis, G.G. Pechanek.and J.G. Delgado-Frias, U.S. Serial No. 07/682, , filed April 8, 1991 (IBM Docket EN9-91-026 herein sometimes referred to as "SPIN" or "Vassilliadis 91".) B. Widrow and M. E. Hoff, "Adaptive Switching Circuits," IRE WESCON Con¬ vention Record, pp. 96-104, 1960. (Herein called "Widrow 60".) S. Grossberg, "Competitive Learning: From Interactive Activation to Adaptive Resonance," Cognitive Science 11 pp. 23-63, 1987 (Herein referred to as"Grossberg 87".) E. B. Eichelberger and T. W. Williams, "A Logic Design Structure for Testability," Proceedings 14th Design Automation Conference, IEEE, 1977. (Herein referred to as "Eichelberger 77".) J.J. Hopfield, "Neurons With Graded Response Have Collective Computa¬ tional Properties Like Those of Two-State Neurons," Proceedings of the National Academy of Sciences 81, pp. 3088-3092, May, 1984. (Herein referred to as "Hopfield 84".) D.H. Ackley, G.E. Hinton and T.J. Sejnowski, "A Learning Algorithm for Boltzmann Machines," Cognitive Science 9, pp. 147-169, 1985. (Herein referred to as "Ackley 85".) J. L. McClelland and D.E. Rumelhart, Explorations in Parallel Distributed Processing: A handbook of Models, Programs and Exercises Cambridge, Massachusetts: MIT Press, 1988. (Herein referred to as "McClelland 88".) and J.J. Hopfield, "Neural Networks and Physical Systems with Emergent Col¬ lective Computational Abilities," Proceedings of the National Academy of Sci¬ ences 79, pp. 2554-2558, 1982. (Herein referred to as "Hopfield 82".) BACKGROUND OF THE INVENTION According to a Webster's New Collegiate Dictionary, the word "learn" means "to gain knowledge or understanding of or skill in by study, instruction, or experience". A neural network's knowledge is encoded in the strength of interconnections or weights between the neurons. In a completely connected network of N neurons there are Λ/ 2 interconnection weights available that can be modified by a learning rule. The "learning" process a network is said to go through, in a similar sense to Webster's definition, refers to the mech¬ anism or rules governing the modification of the interconnection weight values. One such learning rule is called Back-Propagation as illustrated by D.E. Rumelhart, J.L. McClelland, and the PDP Research. Group, Parallel Dis¬ tributed Processing Vol. 1: Foundations Cambridge, Massachusetts: MIT Press 1986. (This work is herein referred to as "Rumelhart 86".) The Back- Propagation learning rule will be described and followed by a discussion of the synapse processor architecture to be used for the implementation of a learning machine. A back-propagation example, using an input/output encoder neural network, will then be illustrated. As our synapse processor architecture which is the subject of this patent is applicable for modeling other neural networks and for the execution of a more general class of par¬ allel data algorithms, we will show in a further series of examples the imple¬ mentation of a Boltzmann like machine and matrix processing with our new system. During the detailed discussion of our inventions, we will reference other work including our own unpublished works, as mentioned above. These back¬ ground literature references are incorporated herein by reference. SUMMARY OF THE INVENTIONS Our newly developed computer system may be described as a neural synapse processor apparatus having a new architecture for the synapse proc¬ essing elements of the apparatus. The apparatus which we prefer will have a N neuron structure having synapse processing units that contain instruction and data storage units, receive instructions and data, and execute instructions. The N neuron structure should contain communicating adder trees, neuron activation function units, and an arrangement for communi¬ cating both instructions, data, and the outputs of neuron activation function units back to the input synapse processing units by means of the communi¬ cating adder trees. The preferred apparatus which will be described contains N 2 synapse proc¬ essing units, each associated with a connection weight in the N neural network to be emulated, placed in the form of a N by N matrix that has been folded along the diagonal and made up of diagonal cells and general cells. ln our preferred system the diagonal cells, each utilizing a single synapse processing unit, are associated with the diagonal connection weights of the folded N by N connection weight matrix and the general cells, each of which has two synapse processing units merged together, and which are associated with the symmetric connection weights of the folded N by N connection weight matrix. With our new architecture for the synapse processing elements which will be described in the best way we know to implement the improvements, back- propagation and Boltzmann like machine algorithms can be utilized and the implementation of both back-propagation and a Boltzmann like machine on our General Purpose Learning Machine (GPLM), as discussed for an ' input/output encoder neural network example, can be achieved, as well as the GPLM implementation of data parallel algorithms for matrix multiplication, addition, and Boolean operations. These and other improvements are set forth in the following detailed description. For a better understanding of the inventions, together with advantages and features, reference may be had to the co-pending applica¬ tions for other developments we have made in the field. However, specifically as to the improvements, advantages and features described herein, reference will be made in the description which follows to the below-described drawings. BRIEF DESCRIPTION OF THE DRAWINGS. FIGURE 1 shows a multi-layer back propagation network; FIGURE 2 shows a three layer back propagation network; FIGURE 3 shows a weight/Y value multiplication structure in two parts, FIGURE 3-A (Diagonal Cell) and FIGURE 3-B (General Cell); FIGURE 4 illustrates our preferred synapse processor architecture in two parts, FIGURE 4-A (DIAGONAL SYNAPSE PROCESSOR DSYP) and FIGURE 4-B (GENERAL SYNAPSE PROCESSOR GSYP); FIGURE 5 shows a preferred communicating adder tree; FIGURE 6 illustrates a 4-neuron general purpose learning machine with synapse processor architecture; FIGURE 7 illustrates a synapse processor tagged instruction/data format; FIGURE 8 illustrates a neural network for the input/output encoding problem; FIGURE 9 illustrates our synapse processor architecture implemented on GPLM; (Note: For convenience of illustration, FIGURES 9-20 may be separated. As a convention we place the top of the FIGURE as the first sheet, with subsequent sheets proceeding down when viewing the FIGURE, in the event that multiple sheets are used.) FIGURE 10 illustrates the initialization and first layer execution with our system; FIGURE 11 illustrates the second layer execution with our system; FIGURE 12 illustrates the third layer execution with our system; FIGURE 13 illustrates the fourth layer execution with our system; FIGURE 14 illustrates the learning mode - reverse communicate E8, E9, E10 & E11 ; FIGURE 15 illustrates the learning mode - create weighted error summations ER4, ER5, ER6, AND ER7; FIGURE 16 illustrates the learning mode - reverse communicate E4, E5, E6, and E7 and create error summation ER2; FIGURE 17 illustrates the learning mode - reverse communicate E3; FIGURE 18 illustrates the learning mode - Step 1 weight updating; FIGURE 19 illustrates the learning mode - Step 2 weight updating; (P = P) FIGURE 20 illustrates the learning mode - Step 3 weight updating; FIGURE 21 illustrates neuron calculations as matrix operations; while FIGURE 22 illustrates general matrix multiplication. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS Our detailed description follows as parts explaining our preferred embod¬ iments of our inventions provided by way of example. BACK-PROPAGATION LEARNING BACKGROUND The back-propagation learning algorithm is typically implemented on feed¬ forward multi-layer neural networks, though application to recurrent networks has been addressed, for example - see... Rumelhart 86 and Hwang 89. We will discuss the feed-forward networks only. The feed-forward network func¬ tions as a pattern classifier or pattern mapper where input patterns are applied and the network learns a mapping or classification of these input pat¬ terns to an output set of patterns. It is assumed that a subset of classifica¬ tions or input/output mappings is initially known that can serve as "teachers" for the network. After learning the subset of classifications the network can then respond to unseen patterns and map them to an already learned classi¬ fication. The network's ability to make a correct classification of the previ¬ ously unseen patterns is termed a "generalization". The network consists of an input layer, an output layer, and one or more hidden layers of neurons and is set up with an input neuron unit for each character in the input pattern and an output neuron unit for each classification or character in the output pattern, FIGURE 1. The number of hidden layers of neurons and the number of neurons in each hidden layer is more difficult to determine. The Kolmogorov theorem - per Caudill 88 - indicates that a three layer neural network, made up of m input neurons, n output neurons, and 2m + 1 hidden layer neurons will be able to map an input pattern of m characters to an output pattern of n characters, where the input characters are constrained to 0 < value < 1. The Kolmogorov theorem does not guarantee a minimum neural network solution to the mapping problem though. See Caudill 88. A method for choosing the minimum number of hidden units for an optimum solution is not known. Experience, common sense, use of the Kolmogorov theorem, or experimental methods are usually used to select the number of hidden units. Once the number of layers and number of neurons per layers are chosen, the connection structure is then decided upon. The feed-forward networks typically allow for complete connectivity between adjacent layers and may also have connections between non-adjacent layers, but all con¬ nections are in a feed-forward direction only. The feed-forward connection restriction is assumed to mean no feed-back connection weights and no con¬ nections between neurons within a layer. For this connection structure, the weights are usually randomly determined prior to training as in Rumelhart 86. As we turn to FIGURE 1 and other FIGURES, the following notation will be used: • N neurons in total network. • The subscript L is used to denote the K layers where 1 < L < K • There are M L neurons in each layer such that M, + M 2 + ... + M κ = N. • The weights are double subscripted, W, j which indicates the connection weight from unit j connected to unit i. • The external inputs will be denoted by a new variable Ex, where 1 ≤ i < N. Each neuron will be allowed to possess an External input Ex,. • All neuron outputs will be denoted by Y,. • The neurons are numbered sequentially in the following manner: — layer L = 1 neurons: Y r .Y 2 .-.-. Y M - layer L = 2 neurons: Y M1 _,, Y M1 _ 2 , ..., Y M , Mz — continuing until: - layer L = K neurons: Y N - Mκ -.. YN- MK ^2 , -, YN The neuron sigmoid function is modified from the previously assumed form - see ...Vassiliadis SNAP 90, T-SNAP, and Vassiliadis SPIN 91 by way of example - to the form described in, equation 1. The change has been the addition of a term Ex, which represents the external input to a neuron processing element. N Yi m- Fi∑ WijYj + Ex,) (1 ) 7 = 1 In many feed-forward neural networks, only the input layer of neurons use an external input. In the literature, e.g. Rumelhart 86, the input neurons of a feedforward network take on an identity activation/output function, where Y, = Ex,, rather than the sigmoid function as do the other neurons in the neural network. A sigmoid function can be used instead for the input neurons, allowing all neurons to possess the same activation func¬ tion, by extending the range of Ex, to — A < Ex, < + A, where - A will equate to Y, = 0 and + A will equate to Y, = 1 assuming the case where Ex, is the only input to a neuron. Within some acceptable range of error, the input neurons can be forced to a "0" or a "1" state via use of the external input Ex,. The Ex, for the other neurons in the network can be equated to zero if not required. The neuron activation function F(z,) is set equal to a sigmoid function whose form, for example, is: γ ι = F M = — - ~ ι (2) (1 + e " ή Where: - e = Natural Log (2.71828...) - For the function F(z,): N -i = ∑ Yj + EXi (3) j = - - T is a global control parameter used to modify the slope of the sigmoid function for a given set of z, values. Given a set of known input/teacher patterns, a known input is applied to the back-propagation network, and the network is run in an execution mode producing some output. The network is then placed into a learning mode where the weights are adjusted according to some rule. The mis¬ match between the teacher pattern and the actually produced output pattern represents an error. The basic concept behind the back- propagation learning rule is one of minimizing the total network error, E(W), over all input/teacher patterns, as a function of the adjustable weights. The network error E(W) is chosen as a quadratic function of the teaching inputs and the network outputs (back-propagation / delta rule equations from Rumelhart 86): Q N p = 1 / = 1 Where: — Q equals the number of patterns p. — There are teacher inputs tf on the output units. For a particular pattern p, E(W) P is: Based on the work of Widrow and Hoff (Widrow 60), which showed that for single layer linear threshold unit systems, instead of systems of units with continuous valued outputs, a plot of the quadratic error function vs a range of values of a network weight is a smooth function with one minimum. By using a procedure to minimize the mean square error, the network does a gradient descent along the error surface until the single minimum is reached. In other words, a weight is changed in such a manner as to minimize the error function. To be more specific, the gra¬ dient descent is accomplished by making the weight change proportional to the negative of the derivative of the error function. This gradient descent concept used on linear threshold neurons is extended to neurons which have a sigmoidal type response. To minimize the mean square error with neurons having activation func¬ tions defined by equations 1 and 2 the derivative of the error function with respect to any weight change must be calculated. The weight must be changed according to a gradient descent formula: (Where p is a constant of proportionality.) Taking the derivative of the error function, equation 5, with respect to the weights in chain rule fashion is: The first part of equation 7, (dE")j(dzf) represents how the error E p changes with respect to input changes of the i th unit. The second part of equation 7, (dzf)j(dW, represents how the / ' " • input changes with respect to the changing of a particular weight ll,,. Since the external inputs Ex, are assumed to be constant during network execution, the derivative of the second part of equation 7 is given as: The derivative of the first part of equation 7 is based on the original delta rule algorithm used with linear neurons as interpreted by Rumelhart 86. If the neurons were linear the Yf would be equal to or a multiplicative con¬ stant times the input zf . To be "consistent" with this linear formulation, the first derivative is defined in accordance with Rumelhart 86 as ^ - tf 0 ) (*?) To implement a gradient descent on the error surface E, the weight changes are made according to this learning rule based on equation 6: AW ij -m- pδ YP (10) (Where p represents the learning rate, a constant of proportionality.) The determination of δf for all the neurons in the multi-layer network represents the essence of the back-propagation algorithm. Using the derivative chain rule on equation 9 gives: The first term (dE p )j(dYf) represents the change in the error as a function of the output of the neuron and the second term (dYf)j(dzf) represents the change in the output as a function of the input changes. The second term is valid for both output and hidden neurons. The derivative of the acti¬ vation function, equation 2, is: Equation 11's first term's calculation is dependent upon whether the unit is an output neuron or one of the hidden neurons. For output units, since the teaching input is available: And: Substituting. equation 12 for output neurons into equation 14 gives: δ p = (tf - Yf)Yf( . - Yf) (15) Then for the output neurons equation 10 becomes: &.W l . } = pYf(tf - Yf)Yf( . - Yf) (16) For the i' h hidden unit in layer L with output Y, and with Y, connected to a feed-forward layer, write (dE p )j(dYf) in chain rule fashion as: Where m = M, + M 2 + ... + M L Equation 17 represents the effect Y, in layer L has on the feed-forward layers of neurons Y m + ι, Y m + 2 , •••, YN- Continuing: Since the only effect being investigated is that due to Y, the derivative with respect to Y, of all the inputs in the feed-forward layers results in: Substituting equation 9 in equation 19 gives: W ci is interpreted as the connection weight from the hidden unit i to a neuron unit c in a feed-forward layer. Repeating equation 11 : ec i uat,on 1 1 Substituting equation 12 and 20 into equation 11 gives: N # = Yf(1 - Yf) ∑ δ W ci (21) c = m + 1 Then, based on equation 10: N AW l} - = pYfYf( . - Yf) ∑ δ W ci (22) c = m + 1 Layer L's hidden unit error signal δf can be back-propagated to layers previous to L to continue the weight modification process. For multilayer neural networks, equation 16 and 22 constitute the back- propagation learning rules. All weights are updated according to the fol¬ lowing general rule: New W jj = OLD W 9 + AW tj - • (23) Turning now to the FIGURES in more detail, back-propagation can be viewed from a high level as shown in FIGURE 2, illustrating a three layer back-propagation network. See Grossberg 87. FIGURE 1 , outlines the main computational blocks involved in a three layer, F1 , F2, and F3, back propagation network. Inputs to the network pass through the three layers, F1 , F2, and F3, to generate the actual network outputs from the F3 layer. The F1 , F2, and F3 layers of units have nonlinear, differentiable, and non- decreasing activation functions which directly produce the neuron's output in each layer. These activation functions go to differentiator blocks, F6 and F7, and to error signal blocks, F4 and F5. Blocks F6 and F7 differen¬ tiate the activation functions from layers F3 and F2 respectively, each pro¬ viding a signal to their corresponding error blocks F4 and F5. Block F4 also receives the direct output from layer F3 and a teaching input, labeled EXPECTED OUTPUTS. Block F4 creates a learning signal which is based on the difference from the expected output and the actual output multi¬ plied by the derivative of the actual output F3, equation 15. The weights, between F3 and F2, are then modified by the learning signal, equation 16 and 23. The weights to layer F2, also called the hidden layer, are modi¬ fied by a slightly different rule since there is no teacher, i.e. expected outputs, for the F2 layer. The learning signal from the F5 block is equal to equation 21 , and the weights are updated based on equation 22 and 23. The network works in two phases, an execution or a forward propagation phase and a learning phase which is a backward propagation through the network modifying the weights starting from the F3 layer and propagating back to the input layer. This cycle, a forward propagation phase gener¬ ating new outputs followed by the backward propagation phase updating the weights continues until the actual and target values agree or are within some acceptable tolerance. LEARNING MACHINE SYNAPSE PROCESSOR ARCHITECTURE The TSNAP structure as described in T-SNAP. required the HOST processor to provide the learning function required by a neural network model since TSNAP did not provide any weight modification mechanisms. Additionally, TSNAP does not provide the neuron execution function as described by equation 1. In order to accommodate multiple learning algorithms and the new neuron definition, equation 1 , major modifications to the TSNAP architec¬ ture are required. These modifications provide capabilities beyond those normally associated with the neural network paradigm. Instead of the fixed multiplication function provided in TSNAP, a more general processor archi¬ tecture is put in place where the multiplication element is replaced by a new type of computing element which receives and executes instructions. This new architecture we now term the Synapse Processor Architecture (SPA). Bit serial communications is an underlying assumption for the following architec¬ ture discussion implemented by our illustrated preferred embodiment of the system apparatus, but this bit serial embodiment for a SPA is not limited to a bit serial implementation as the architecture is applicable to a word parallel format, as also detailed below. The weight/Y value multiplier function corresponds to the input synapse proc¬ essing in a coarse functional analogy to a biological neuron as defined by equations 1 and 2. The expanded multiplier cell or "synapse" processor architecture includes the weight/Y value multiplication and additional func¬ tions as will be described. Two types of processor "cell" structures are required to implement the neural execution capability without learning, the general cell and diagonal cell structures. The basic execution structure, without learning, and new processor structure, supporting learning, are shown in FIGURE 3 and FIGURE 4. The term "element", used in the following discussion, refers to the minimum archi¬ tected functional unit required for synapse processing without weight modifi¬ cation capability, namely a weight register, a Y value register, and a multiplier symbolically indicated as W v Y j . The first "cell", FIGURE 3-A, is associated with the diagonal elements, W„ x Y„ and the second "cell", G-CELL, FIGURE 3-B, is associated with the rest of the elements W,,Y, and contains two elements placed in the G-CELL, shown in a top and bottom arrangement. The modifications to the basic neural execution structure, FIGURE 3-A and 3-B, are shown in FIGURES 4-A and 4-B and consist in the addition of a tag compare function, a command (CMD) register, a temporary (TEMP) register, Conditional Execution Bits (CEB) in each data register, a data path register, a command path bit, selector and distributor control struc¬ tures, and expanded functions in addition to multiplication, as represented by the Execution Unit (EXU) block. Briefly, the tag compare function allows for individual synapse processor "element" selection or all processor selection through a broadcast B bit. The commands control instruction and data paths as well as the expanded EXU function, a data path register and a command path bit are programmable storage elements. A temporary register provides additional storage capability in each element, and the selector and distributor structures control the internal element path selection based on the stored data/command paths and a command's source and destination addresses. The new form of processor cell is termed the Synapse Processor, SYP, DSYP for the diagonal cells and GSYP for the General Cells, G-CELLS. An essential and novel architectural characteristic of the SYP cells supporting complete connectivity in a neural network model is briefly reviewed by exam¬ ination of FIGURES 3-A and 3-B. For example, with a neural network model in an execution mode, implying a multiplication operation in each processing cell, the diagonal cell multiplies its stored weight with its stored Y value and supplies the multiplied result to the attached add tree. In the reverse com¬ munications mode for the diagonal cells, a Y value is received from the attached add tree and stored into the Y value register. The "G-CELLS" of the structure also generate a weight times Y value and supply the product to their attached add trees. In the reverse communications mode for these "G-CELLS", a Y y value received from the bottom multiplier add tree is stored into the top Y value register and likewise a Y, value received from the top multiplier add tree will be stored into the bottom Y value register. This switch in storing the Y values is an essential characteristic supporting com¬ plete connectivity. For the expanded cells, FIGURES 4-A and 4-B, this path switch is programmable, allowing further unique architectural features for processing. The synapse processor programmability is obtained through the commands or instructions which are received at a synapse processor CMD register from the attached Add tree which is in a reverse communications mode. Each SYP element upon receipt of an instruction will execute the operation specified by that instruction. The instruction types include a data and command path determining instruction, arithmetic, and logical instructions. Each SYP contains a command register for each processing element specifying the source and destination paths and EXU functions; a DSYP contains one command register, and the GSYP contains two command registers. Here see FIGURE 3 for the preferred weight/Y Value Multiplication Structure and FIGURE 4 for an illustration of our Synapse Processor Architec¬ ture. The function of the communicating adder tree - see T-SNAP - is reviewed with reference to FIGURE 5. The symbolic summation tree is shown on the left of FIGURE 5 with Adders at each stage designated by the letter A. Pipeline latches have been left out for more clarity. The more detailed representation of the communicating adder tree structure that will be used is shown on the right-hand side of FIGURE 5. Three Adder elements are shown in a 2 stage pipelined tree arrangement. The Add element has a SWitch 1 , SW1 , block on its output and two SWitch 2s, SW2, blocks bypassing the Adder. The commu¬ nicating adder tree can be placed into one of two modes, namely a forward summation mode and a reverse communications mode, also termed a bypass mode. A common control signal is used at each adder element in order to guarantee that all nodes of the tree provide the same function. In a general sense though, the tree processing nodes could be of expanded functional capability, and the processing node control could be made more flexible by having separate control mechanisms in each of the tree nodes. The use of separate control lines or tagged commands to the tree processing nodes are two examples of mechanisms which would extend the trees' processing capa¬ bilities. The more extended functions of the tree node functional units may contain additional storage elements, as required by the function definition. For the purposes of this description, the communicating adder tree proc¬ essing nodes will all provide the same function on their input data, namely summation or bypass communication, utilizing a common tree control signal which is enabled/disabled from a central control point. One of the functions specified by the tree control signal is the Adder bypass. Both switches, SW1 and SW2, have an on/off control which, when in the "off" state, keeps the switch open, i.e. in a high impedance state and when in the "on" state bypasses the Adder via a low impedance path. When SW1 is enabled, SW2 is disabled and vice versa. In this manner, the Adder tree can provide the summation function, for example, in one direction, SW1's on - SW2's off, while essentially acting as a communication path in Adder bypass mode, SW1 's off - SW2's on. The Adder tree using 2 to 1 functional elements, such as 2-1 adders, will require Iog 2 /V stages. Alternatively, the forward Adder and communications path functions can be implemented with 3-1 , 4-1 , ..., N-1 func¬ tional elements, such as 3-1 , 4-1 , ..., N-1 adders, and their bypass switches, utilizing all the same element types or in combination, to produce the speci¬ fied function. It should be noted that the Communicating Adder, FIGURE 5, represents its logical function since, for example, depending upon tech- nology, the SW1 's function, where "off" equals a high impedance state, could be incorporated in the gate devices required by the last internal stage of each adder element, thereby adding no additional delay to the add function. Alternatively, a separate communications tree path could be provided, thereby allowing communications to occur, for example, while a summation function is in progress. A 4 neuron example is shown in FIGURE 6 which connects the communi¬ cating adder trees and sigmoid generators to provide a complete picture of the modified SPA structure used in a General Purpose Learning Machine (GPLM) and to symbolically indicate the top and bottom connections for the Add tree. In FIGURE 6, the sigmoid generator, SIG, provides the function as described in equations 2 and 3 and the Y derivative generator, SIG', provides the function described by equation 12. The networks external inputs Ex, are supplied to a final adder stage prior to the sigmoid generators. The learning processor represents a central control point for the array of synapse processors and interfaces with the Host computer which has access to the learning processor's internal storage containing the modeled network's con¬ nection weights, neuron Y values, Y derivative values, "teacher" values, and traced values. Some of the functions the learning processor possesses are the following: 1. All synapse processor initializations 2. Starting the GPLM 3. Stoping the GPLM • Convergence checking of a modeled network's output as compared to the desired output. • Host specified R update cycles have been completed. 4. Communicating Adder Tree control 5. Synapse processor instruction issuing 6. Sequence control for multi-layer networks 7. Synapse processor data issuing 8. All δ, calculations in learning algorithms The synapse processor registers associated with a neuron input are con¬ nected in a serial daisy chained fashion for LSSD scanning. See Eichelberger 77. LSSD scanning supports testing and register initialization. Each neuron may have one or up to multiple scan strings depending upon an implementation technology. For example, a separate scan path containing only the weight registers for each neuron can be provided resulting in N weight register scan paths interfacing with the learning processor. The learning processor will initialize the weight registers via the scan path while the weight updates in learning mode will be accomplished in parallel within the GPLM structure. The Y values are initialized, if required, by reverse com¬ municating them through the adder tree structure. An example of the storage of elements required in a neural calculation for neuron 3 is written here and highlighted in FIGURE 6. ^ 3 = F(W 2Λ Y, + W 3 2 Y 2 + W 3j Y 3 + W 3A Y 4 ) FIGURE 6 illustrates a 4-neuron General Purpose Learning Machine with Synapse Processor Architecture. Each neuron output, Y„ is attached to the learning processor which issues the instructions to the Y, neuron's synapse processors through the reverse communications path of the Add tree. Both specific synapse processor element and group synapse processor control can be obtained with the addition of tag bits and a Broadcast, "B", bit added to all communications, and tag and "B" bit compare functions in each synapse processor. FIGURE 7 depicts the instruction and data format. A "B" bit is added as the first bit in the field indicating a broadcast command/data for B = 1 and a tagged command/data for B = 0. A broadcast message/data goes to all N synapse processors linked to a particular Y, neuron independent of the TAG. The TAG field must be at least log 2 V bits long allowing specific identification of all synapse processors belonging to a neuron. The received tag is bit by bit compared with a stored tag in each synapse processing element which after the last tag bit compare is completed it is known whether the following CMD/DATA is to be received by a particular synapse processor element. A tag match results in the CMD or Data being received while a no match situation prevents the reception of the CMD/Data. A parity bit or error correction bits denoted by a P can also be included in the tag field, as shown in FIGURE 7, for error handling reasons. The reverse communicated commands or data also contain a single bit (CMD) indicating whether the bit string is data or command, an AUTO bit indicating a special automatic execution mode, and error correction/detection bit/s (ECC). It is assumed that the command and data bit lengths are of equal length. Table 1 contains the Synapse Processor instruction set. Utilizing the Hopfield neural network model - see Hopfield 84 - as an example, an automatic mode can be specified for a network operation, where instead of requiring the repeated sending of a MPY instruction after each network execution cycle in order to initiate the next network cycle the auto¬ matic mode would start the next update cycle automatically after receipt of the newly calculated Y values. This automatic mode is initiated by setting the AUTO bit to a "1" in the command desired, such as MPY for use in the Hopfield network model, which sets an automatic mode flag in the synapse processors. The first operation is initiated with the receipt of the instruction with the AUTO bit set to a "1". The instruction would be repeated upon receipt of the new updated data continuing until a new command is received which stops the processing, such as receipt of a NOP instruction. A capital A will be appended to an instruction mnemonic to indicate that the auto bit is to be set to a "1", for example MPYA. The source and destination addresses are relative to the command register. The relative addressing is shown in FIGURE 4-B where the top command reg¬ ister CMD TREG relative addresses are shown in columnar fashion located to the right of the register blocks, while the relative addressing for the bottom command register CMD BREG is shown in columnar fashion located to the left of the register blocks. It should be noted, for example, that the bottom command register R2 is the same as the top command register R5. A bit string received from the Add tree, if it is a command, is serialized into one of the two CMD registers in each G-cell and the single CMD register of a diag¬ onal cell. Alternatively, a data bit string received from the Add tree, is serial ized to one of the six other registers available in a G-cell and one of the 3 other registers available in a diagonal cell. In the DSYPs a source or desti¬ nation address of R4 through R6 and CR2 are mapped as follows: • CR2 → CR1 For example, assume a three bit source or destination address. Then by having the GSYPs use all three bits and the DSYPs use only the 2 Isb bits the proper mapping can be provided: 000 → CR1 001 → R1 010 → R2 011 → R3 100 → CR2 101 → R6 110 → R5 111 → R4 The destination register path remains as specified by a PATH instruction and is stored in a data path register or in a command path bit register. The PATH command must be reissued if a different path is desired. If no command is specified, the default register path is as described in T-SNAP. All synapse processor data registers are (D + 1) bits in length, due to the conditional execution bit in each data register., See FIGURE 7 showing the instruction and data formats. If a CEB is set to a "zero" in an instruction's destination register, that command will be treated as a NOP instruction, ie. the destina¬ tion register's contents will not be changed and "zeros" will be fed to the Add tree. If the CEB is set to a "one" the register's contents can be modified. For example, this bit is used on the weight registers to identify the presence or absence of a connection since a zero weight value is not always sufficient to accomplish this, as will be seen in the Boltzmann like machine example presented later. "Zeros" are always fed to the Add tree if the Add tree is not a destination point or a NOP situation is occurring. The CEBs can be set upon initialization through the chip's scanning facility or the path command. Table 1 lists the present preferred instruction set functions. CHIID *AUT0* SOURCE 1 SOURCE 2 DESTINATION IHHED.DATA COMMENTS PATH l N.U. H.U. N.U. R1,R2,R3,R4, C NOT USED IF DESTINATION IS CR1 OR CR2 SET THE R5.R6 E COMMAND PATH BIT TO A 0 FOR CR1 AND A CR1.CR2 B (N.U.) 1 FOR CR2. (CEB FIELD NOT USED) ELSE SET THE DATA PATH REGISTER TO THE ' . DESTINATION ADDRESS AND THE DESTINATION 1 REGISTER'S CEB AS SPECIFIED. *AUTO* 1 -• AUTOMATIC REPEAT OF FUNCTION AFTER RECEIPT OF UPDATED DATA FROM SOURCE EXTERNAL TO SYNAPSE PROCESSOR TABLE 1 SYNAPSE PROCESSOR INSTRUCTION SET As indicated, the PATH command sets up the data and command path within a synapse processor for information reverse communicated up the Adder tree and this path remains the same unless a new PATH command is received which changes the path. For example, in a Hopfield network model on GPLM, if the default path had been changed due to previous processing, . the PATH command would be issued once allowing, in reverse communi¬ cation mode, the top Adder tree to connect its received Y value to the bottom Y value register and the bottom Adder tree to connect its received Y value to the top Y value register. For the Hopfield model this path command remains in effect through out the network execution, assuming a fixed weight mode of execution. The PATH command also allows the specification of the path for the next commands. This represents an interesting new function in that it allows the neurons to operate in two unique modes. In the first mode, termed YINMODE, for all neurons, the command received from the bottom Adder tree is sent to CMD BREG (CR1), and the command received from the top Adder tree is sent to CMD TREG (CR1 ). Then, for YINMODE all neuron input SYPs will function as specified in the command field. In this way each neuron can be specified with a different input synapse processing function, common across all inputs to that neuron. For example, all inputs to neuron 8 may be specified with a weight register value * neuron Y value multiply oper¬ ation while all inputs to neuron 7 may be specified with an Temp, register value * neuron Y value operation. Since all neuron communicating adder trees are independent of each other, each neuron input function can have dif¬ ferent execution times in YINMODE for different neurons, but note that if this is the case the summation results would occur at different times, which can cause synchronization problems in the learning processor if not handled. YINMODE can be used to asynchronously select a neuron for processing. In the second mode, termed YOUTMODE, for all neurons, the command received from the bottom Adder tree is sent to CMD TREG (CR2), and the command received from the top Adder tree is sent to CMD BREG (CR2). Then, for YOUTMODE all neuron Y value outputs will have the same synapse function applied at their input destination SYP. In this way, each neuron can have multiple functions at its input SYPs. For example, all Y8 destination SYPs may be specified with a weight register value * neuron Y value multiply operation while all Y7 destination SYPs can be specified with a Temp, register value * neuron Y value operation. All functions specified at a neuron input must execute in the same length of time even though the functions are dif¬ ferent. In general, YINMODE and YOUTMODE can not be interchanged within a single network structure as conflicts could result. In the initial description of TSNAP in T-SNAP, the neurons functioned in a fixed operational mode which corresponds to YOUTMODE in GPLM with all neuron specified with the same function. The input/output encoder problem and the Boltzmann like machine example will make use of the YINMODE. An example of a Boltzmann like machine will follow the back-propagation example presented in this description. Many instructions specify a destination which is local to the individual synapse processor. This local processing can cause synchronization prob¬ lems if not handled correctly. Instead of proliferating synchronization mech¬ anisms throughout the GPLM structure the synchronization problem will be localized to the learning processor at the neuron output point. No notification of local processing completion will be generated from the synapse processors. Rather a fixed hardware mechanism will be provided at the neuron output point to guarantee safety of the operations. It is also not desir¬ able to "solve" the problem via means of queues at the synapse processor locations as this increases the size of the synapse processor limiting the number which could be placed on a single chip. Rather, the instruction issuing point will resolve and avoid all hazards. Any local processing command to the same synapse processor must be separated from the next command to that same synapse processor by the specified synapse processor instruction's execution time. For example, a multiply that takes 2L clocks to ensure the completion of a MPY command must complete before the second command can be sent. This is necessary so that a command buffer register is not required, as each command must remain constant in a synapse processor during the operation of the function commanded. Non¬ local instructions, i.e. those instructions where the destination is the ADD TREE provide notification of operation completion when the converged tree result reaches the learning processor. For non-local instructions, the learning processor waits until a result is received before sending a new instruction to the synapse processors attached to that tree. Each neuron output point, in the learning processor, can then be set up with a synchroni- zation mechanism to safely issue instructions to each synapse at a maximum rate. As a final note, a GPLM compiler would be required to ensure no destination conflicts occur in programs using the described instruction set. BACK-PROPAGATION LEARNING EXAMPLE An input/output encoder problem will be used to demonstrate how back- propagation is employed on the GPLM structure. Table 2 presents the input to output pattern encoding problem. See Rumelhart 86. INPUT OUTPUT PATTERNS PATTERNS 00 1000 01 0100 10 0010 11 0001 TABLE 2 INPUT/OUTPUT ENCODING PROBLEM The network structure used for this problem is shown in FIGURE 8. illustrates a neural network for the input/output encoding problem and Since all neuron outputs are available to the learning processor there is no such thing as hidden units in multilayer networks when mapped onto a GPLM structure. Multi-layer networks are mapped onto a completely connected network struc¬ ture where unused connection paths are kept at a zero weight value by the weight registers' Conditional Execution Bit being set to zero. There are 11 neurons used in the input/output encoding problem requiring an 1 1 neuron GPLM structure. The input/output encoder problem does not require all pos- sible connections available in the 11-neuron GPLM structure. For example, the input/output encoder network equation for neuron 9 is: Y 9 = f=(W 3A Y + W 3β Y 5 + W 9β Y 6 + W 9 Y 7 ) FIGURE 9 shows the general 1 1 neuron GPLM with each neuron's CMD, Weight, Y value, and Temp, register values for a completely connected 11 neuron structure but with the learning processor, sigmoid, and derivative blocks removed for clarity. There are Ceiling (\og 2 N) adder stages used with delay blocks, equivalent to an adder stage delay, used as required. The ceiling function takes the next largest integer of the operand value, i.e. Ceiling (log 2 11 = 3.459...) = 4. During execution mode, the Y values are calculated layer by layer, layer 1 first whose Y value results are used for layer 2, and continuing through the layers. After all K layers of neurons have been processed the network is placed into a learning mode. The output neurons calculate the error signals from the output layer and then reverse communicate the error signal values through the tree to the synapse processing cells. The back-propagation of error signals is done layer by layer beginning at the output layer and contin¬ uing to the input layer. By executing the proper instructions in the various synapse processors, the back-propagation algorithm can be executed. A detailed example with ordered procedures will explain how the input/output encoder learning problem is implemented with a back- propagation algorithm when mapped onto the GPLM. For some pattern p (in general the superscript p is removed for clarity), the following itemized procedure is followed in the GPLM neurocomputer: The "no-connection" weights are blanked out for clarity. The positions of the reg¬ isters as viewed relative to the command register are shown in FIGURE 9. 1. GPLM is initialized by scanning in the initial set of weight values with the weight register's CEB bit set to a "1" as shown in FIGURE 10. The other weight values and all Y value registers are scanned in with a zero value. 2. After initialization GPLM is placed into execution mode and an input pattern applied, EX1 and EX2. The default path is assumed for the General Synapse Processors. Specifically, commands received from the top ADD tree go to CR2, the bottom command register, and commands received from the bottom ADD tree go to CR2, the top command register. Data received from the top ADD tree goes to R5 the Y, register and data received from the bottom ADD tree goes to R5 the Y y register. (Relative addressing is assumed.) 3. Neurons 1 , 2, ..., 1 1 issue MPYA R1 * R2 → ADD TREE. (Where the ADD tree is specified for the summation operation.) The automatic mode is used to improve performance by not having to reissue the multiply instruction for each layer of the network execution. Since the Y value reg¬ isters in the GPLM structure are initially zero, all weight times Y values will produce a zero product which when summed produce a zero summa¬ tion value. 4. The first layer of neurons is executed on the GPLM structure creating the first layer neuron outputs and their derivatives, FIGURE 10. (The learning processor ignores the other neuron output values, namely Y 3 , Y 4 , .... Yn.) • Y, = F(£x,) • Y 2 = F(Ex 2 ) • Or, = Y,(1 - Y,) • Dr 2 = Y 2 (1 - Y 2 ) 5. The first layer neuron outputs are fed back into GPLM, and the second layer of neurons is executed creating the second layer of neuron outputs and their derivatives, FIGURE 11. (Only neuron 3 responds as no data or commands are reverse communicated for the other neurons, and only neuron 3 has a valid weight, weight register CEB = 1 , and Y value product.) • Reverse communicate Y, and Y 2 . • Y 3 = F(W 3 Y, + W 3 2 Y 2 ) • Dr 3 = Y 3 ( . - Y 2 ) 6. This continues until all layers have been executed, and the network output and their derivatives are obtained, FIGURES 12 and 13. Reverse communicate Y 3 Y 4 = F(W,. 3 Y 3 ) Y 5 = F(W 5 . 3 Y 3 ) Ye = F(W 6 . 3 Y 3 ) Y 7 = F(W 7,3 Y 3 ) Dr 4 = Y 4 (1 - Y 4 ) Dr 5 = Y s (1 - Y 5 ) Dr e = Y 6 (1 - Y s ) Dr 7 = Y 7 (1 - Y 7 ) Reverse communicate Y 4 , Y 5 , Y 6 , and Y 7 Y 8 = F(W B Y< + W B,5 Y 5 + WssY 6 + W 8 Y 7 ) y 9 = F(W/ 9ι4 Y 4 + W 9ι5 Y 5 + M 9 . 6 Y 6 + W9.7Y7) Y10 = F(H 10 . 4 Y4 + W, 0 , 5 Y 5 + W,o. 6 Y 6 + W/,0,7 7 ) Y11 = F(IΛ „, 4 Y 4 + W„, 5 Y 5 + Wu.eYs + Wu. Y ) Dr a = Y 8 (1 - Y 8 ) Dr 9 = Y 9 (1 - Y 9 ) Dr„ = Y„(1 - Y„) 7. After all 11 neuron values and their derivatives have been calculated and placed into a Y value and Y derivative array, GPLM is placed into the learning mode. 8. The learning processor checks the Y,s for convergence to the minimum specified error. If reached, the learning process can be stopped for pattern p. If the convergence has not been reached, the learning for pattern p continues. • ConvergenceTestY s — \(t a — Y s )\ ≤ MinimumError • ConvergenceTestYg = \(t 3 — Y 9 )| < MinimumError • ConvergenceTestYw = |(f, 0 - Y,o)| < MinimumError • ConvergenceTestY = \(t — Y,,)| < MinimumError 9. The learning processor calculates the δf for the output neurons for use in updating the weights between the output neurons and the neurons in the previous layer. . <5 8 ___. E8 = (t e - Y 8 )Dr 8 . δ 9 = £9 = (t 9 - Y s )Dr 9 . ,5,o = £10 = (fιo - ,o)Or, 0 . δ u = E . . = (t - Y-,)Dr u 10. The data path is changed and the error signals are then reverse commu¬ nicated to their respective multiplier input cells temporary registers, FIGURE 14. • Neurons 1 , 2, ..., 11 change the data path by issuing PATH R4. The issuance of PATH R4 stops the automatic multiply mode specified by MPYA issued in step 3 above. The data being received goes to the relative address R4 temporary register in the GSYPs and R3 in the DSYPs. The command path remains unchanged. • E8, E9, E10, and E11 are reverse communicated from the Ys, g, Y.o, and V,, source points. 1. Issue MPY instruction to multiply the error signals times the appropriate weights. The products are summed, creating the error summations, ERf, to be used in the next layer back weight modification process, FIGURE 15. Since the command path was not changed, i.e. top ADD tree command to bottom command register (CR2) and bottom ADD tree command to top command register (CR2), the error signals are residing in R3 the tempo¬ rary register address relative to the received commands. ERf = ∑ δ p W cl (25) c = m + \ Where m = M, + M 2 + ... + M L • Neurons 8, 9, 10, and 11 issue MPY R6 * R3 → ADD TREE. Valid sum of products will only be obtained through the GSYP's top ADD trees as the bottom commands R6 (weight register relative to the bottom command) weight register CEB bit is equal to zero. • £R 4 = W 8 , 4 £ 8 + W 9Λ E 9 4- W, 0ι4 £,o + W E • ER 5 = W 8 .sE e + W 9 , 5 E 9 + l I o.s£,o + W„. 5 £„ • ER 6 = W 8 . β E B + W 9 , e E 9 + Wπ.βExo + W„. 6 £ιι • ER 7 = W 8 . 7 E S + W 9 E 9 + M ,o ,7 £,o + W , 7 E 12. The error signals in layer L are calculated for use in the next layer pre¬ vious to L, if present, by using equation 21 in terms of the newly calcu¬ lated derivative, equation 24, and error summation equation 25, FIGURE 16. Neuron 3 will be placed in YINMODE via PATH CR1 , Neuron 3 will then be issued a multiply command, and finally Neuron 3 will be placed in YOUTMODE via PATH CR2 to be consistent with the other neurons in the GPLM structure. δ = DrfERf (26) • <5 4 = £4 = Dr ER • δ 5 = £5 = Dr 5 ER 5 • δ e = E6 = Dr 6 ER 6 • 0 7 = £7 = Dr 7 ER 7 • Reverse communicate E4, E5, E6, and E7 to their respective multiplier input cells. • PATH CR1 • Neuron 3 issues MPY R6 * R3 → ADD TREE. • ER 3 = W*. 3 E4 + W 5 . 3 E5 + W 6,3 £6 + W 7 _ 3 £7 • PATH CR2 13. The error signal for layer 2 (E3) is calculated and reverse communicated in the structure, FIGURE 17. <5? = DrfERf (26) • δ 3 - £3 = Dr 3 ER 3 • Reverse communicate E3 to its respective multiplier input cells. • Since no weights are to be adjusted in the first layer, the back- propagation algorithm can now be stopped. 14. The neurons' AW, j can now be calculated in three instruction steps. Sub¬ stituting δ, — Ei. AW jj -- pYfEi p (27) a. STEP 1 - Neurons 1 , 2, ..., 1 1 issue MPY R5 * R3 → R4 FIGURE 18. • TEMPREG 3Λ = Y,£3 • TEMPREG 3i2 = Y 2 E3 • TEMPREG 4 , 3 = Y 3 £4 • continuing until: • TEMPREG =- Y 7 £11 b. STEP 2 - Neurons 1 , 2 11 issue MPY R4 * IMD → R4 FIGURE 19, IMD contains the learning rate p. • ΔM 3 .ι = pTEMPREG 3 • ΔW 3,2 = pTEMPREG 3 , 2 • ΔW 4ι3 = pTEMPREG,, 3 • continuing until: • ΔM/,,.7 = pTEMPREG c. STEP 3 - Neurons 1 , 2, ..., 11 issue ADD R6 + R4 → R6 (The new weight values are now calculated) FIGURE 20 where the new weight values are indicated as I/!/',-,. New W j j = OLD W j j + AWJJ equation 23 for all neurons . W' 3 . 2 = W 3,2 + AW 3 . 2 • continuing until: . ! n 7 = i r V 11 7 + ΔWΛ ..7 15. A new path command is sent in preparation for the next learning cycle, PATH R2, so that the new Y values are sent to the proper registers. 16. GPLM is placed in execution mode, and the existing pattern p is applied again until the adjusted weights allow the output pattern to match the teaching pattern with a minimum specified error. Until the minimum spec¬ ified error is reached, GPLM will alternate between execution mode and learning mode. After convergence to the minimum specific error is reached, a new pattern can be applied and the process repeated until all teaching patterns have been applied. FEED-FORWARD EXECUTION AND BACK-PROPAGATION PERFORMANCE The steps for various modes of exeuction are illustrated hereinbelow. EXECUTION MODE: First Layer Timing: MPYA instruction issue: (L — 1) 4* ( \og 2 N)δ A MPY plus ADD tree: δ M + ( \og 2 N)δ A + δ A Sigmoid delay: <5 S Second Layer Timing: Reverse communicate Y values overlapped with sigmoid delay: ( log 2 N)δ A MPY plus ADD tree: δ M + ( \og 2 N)δ A + δ A Sigmoid delay: δ s This continues for all K layers such that in general for K layers the feed¬ forward execution delay is: (Note that each layer is done sequentially.) ( - 1) + K(δ M + 2( \og 2 N)δ A + δ A + δ s ) ' LEARNING MODE: New definitions are: • δ E , = Error signal calculation delay. • δ C τ = Convergence test delay. • δcMD'ND = (L — 1) + ( \og 2 N)δ A delay for communicating a command (CMD) or separate non overlapped data (ND). • δ ADD = Lδ A + 1 • L bit length of data and command words. Assuming no weighted inputs on the first layer that need to be calculated, as in the input/output encoder neural network, and all Y value derivatives are available, then: Set Up: Convergence test and PATH command: δ C τ + CMD First Back-Propagation: Calculate error signals, reverse communicate the calculated error signals: δ El + δ ND MPY and sum error signals: δ CMD + δ M + ( \og 2 N)δ A Second Back-Propagation: Calculate error signals, issue PATH, reverse communicate the calculated error signals: δ ε , 4 δ ND , and issue PATH. MPY and sum error signals: <5 CWD + δ M 4 ( \og 2 N)δ A This continues for K-2 similar back-propagations such that in general for K layers: (K - 2)(δ B 4 δ ND 4 δ CMD 4 δ M 4 2( \og 2 N)d A ) The final back-propagation does not require a forward summation operation, consequently: δ ε , 4- δ ND The final weight updating is done in three steps made up of three local com¬ mands; two MPYs and one ADD: 3<5 CMD + 2δ M 4* <5„ 00 Substituting for δ CMD and δ ND and reducing results in a learning mode timing delay in general for K layers as: δ cτ + S CMD + (K ~ 2)(<5E/ 4 δ ND 4 * δ CMD + δ M + 2( \og 2 N)δ A ) + δ Ei + δ ND + 3δ CMD + 2δ M + Assuming δ A is equal to one time unit, the learning mode timing delay is given by: δ cτ + (K - -)δ Ei + Kδ M + 2(K + 1) 4 * (AK - 3)( log 2 /V) - 2 As N increases in size, the learning delay only increases by a small factor of log 2 /V and the convergence test time and error signal calculation delay time. For example, assuming N = 128 neurons and L = 52 bits, then the learning mode timing delay is: δ CT(N = 128) + (K - 1)«E (W = 128) + *-M + ~ K + 83 If N = 1024 and L = 58 bits then the learning time would be: δ CT(N = 1024) + (K - - )-Ei { N = 1024) + Kδ M + 154K 4 86 BOLTZMANN LIKE MACHINE LEARNING EXAMPLE The following discussion is not meant to be a tutorial on the Boltzmann machine - see Ackley 85 - but rather a presentation of how a Botzmann algo¬ rithm, from Ackley 85, Rumelhart 86, and McClelland 88, can be mapped onto GPLM. The Boltzmann machine is made up of a network of completely connected binary threshold neural units just as in the original Hopfield network - as in Hopfield 82. Instead of the random and asynchronous neuron selection coupled with a deterministic update rule Hopfield used, a probabilistic update rule is used on the asynchronously selected neuron units. In addition, instead of the Hopfield single layer of neurons, the Boltzmann machine can be specified as a multilayer machine with input, hidden, and output units where the input and output units can be "clamped", i.e. set to a desired value. In order to modify the connection weights, all neuron outputs must be monitored and the statistics of their activation values recorded since the change in the connection weight between two connected units is proportional to the difference in probabilities of the connected units being "on" at the same time in a free running mode versus a "clamped" mode after the network has achieved "equilibrium" in both modes. Simulated annealing involving the use of the Temperature parameter T plays an important role in the Boltzmann machine, and "equilibrium" is obtained through the control of the temper¬ ature. For the input/output encoder problem described in Ackley 85, the "equilibrium" procedure followed was that "...all the undamped units were randomized with equal probability "on" or "off" (corresponding to raising the temperature to infinity), and then the network was allowed to run for the fol- lowing times at the following temperatures: (2@20, 2@15, 2(2.12, and 4@10). After this annealing schedule it was assumed that the network had reached equilibrium, and statistics were collected at a temperature of 10 for 10 units of time, (note) One unit of time is defined as the time required for each unit to be given, on the average, one chance to change its state. This means that if there are n undamped units, a time period of 1 involves n random probes in which some unit is given a chance to change its state.". The statistics concern how often connected pairs of units are "on" together at "equilibrium". A Boltzmann like machine implementation of an input/output encoder problem as modeled on GPLM will be described. The network of neurons is assumed to be three layers with ,, M 2 , and M 3 neurons in layer 1 , 2, and 3 respectively. Layers 1 and 3 are completely connected within their respective layers but are not connected to each other. Instead both layers 1 and 3 are completely connected to the hidden layer 2, in which the hidden units are not connected with each other. All weights of the indicated connections are ini¬ tially set to zero with the weight CEB bit is set to a "1" for all valid connection weights. Neurons are binary having a "0" or a "1" activation state. The "on'V'off" energy difference Δ£, for the i th neuron is defined as: N AE i = ) v 'J J Assuming an N neuron input/output encoder network with its specified con¬ nection weights has been initialized on GPLM and a set of known input/output patterns which can act as teachers exist, then with a random "seed" specified to allow cycle repeatability: 1. Begin a network update cycle by "clamping" the input and output units to one of the I/O encoder patterns. • In GPLM this is accomplished by reverse communicating the network input Y values and network output Y values to their respective synapse processor, switching the path i.e. top ADD tree values go to bottom Y value register and vise versa. Random Y values with equal probability of being "on" or "off" are chosen for the hidden units and reverse com¬ municated in the same fashion as the input/output Y values. 2. Randomly select a hidden unit neuron for updating, as input/output units are clamped. • Learning processor requires a random number generator which can produce a uniformly distributed random integer between 1 and N. • Issue PATH command to selected neuron to change the command path so that no switch occurs, i.e. top ADD tree command to top command register and visa versa. (PATH CR1) (The data path remains unchanged.) • Issue MPY R1 * R2 → ADD TREE to the selected neuron. 3. Determine the "On" State Probability, OSP, of the selected i th neuron. OSP i = 1— — (l 4 e ~Δ ) • The sigmoid generator must have a T parameter input loadable from the learning processor. 4. OSP is the output of the sigmoid function for the selected neuron due to the previously issued MPY R1 * R2 → ADD TREE instruction to the selected , neuron. 5. The learning processor determines the selected neuron's activation value Y. IF (random # < OSP,)THEN Y,* = 1 ELSE Y j = 0 6. The newly updated Y value is reverse communicated in the network. 7. Continue with neuron selection and updating process until enough cycles have been run to obtain statistically significant neuron activity and the network reaches "equilibrium" through an annealing schedule, ie. varying the parameter T. The learning processor records, for the connected neurons, a value indicating how often the connected units were "on" at the same time. 8. If there are more patterns to be run, select the next input/output encoder pattern and "clamp" it on the network and run the network as defined above beginning with step 2. Continue taking statistics over all patterns run on the network. 9. After running all the patterns, the statistic values recorded represent the probability that a pair of connected neurons were "on" together. The learning processor keeps an array of the "clamped" statistics. 10. The network is "undamped", all neuron values randomized with equal probability of being "on" or "off", and the network, following an annealing schedule, is allowed to reach "equilibrium". 11. Statistics of pairs of "on" units are then recorded for as many annealings as were done in the "clamped" mode of operation. The learning processor keeps an array of the "undamped" statistics. 12. Two methods for updating the connection weights in the network structure are: a. AW, = p(p, j - p', ; ) b. AW — 4 fixed weight step - IF p ( > p'ij or — fixed weight step - IF p η < p' η • Where:p, y is the average probability of a pair i, j being "on" simul¬ taneously in the "clamp" mode and p',, is the average probability of a pair i. j being "on" simultaneously in the free running mode of operation. For example, the first weight update method above can be accomplished by using the synapse processors' Y and temp registers and a procedure, such as the following, based on a PASCAL like pseudo-code with explana- tions in parenthesis. The FOR loops would be translated into N parallel operations across the N neurons. a. For i = 1 to N (The next operations are done in parallel across all N neurons.) b. - For j = 1 to N shift register scan P„ into neuron i's Y registers. (N values scanned into Y registers in one operation done in parallel for N neurons.) c. — For j — 1 to N shift register scan — P', y into neuron i's Temp regis¬ ters. (N values scanned into Temp registers in one operation done in parallel for N neurons.) d. ADD R24 R3 → R3, (P - P' u ) → R3. (N ADD instructions issued in parallel, one per neuron.) e. MPY R31MD1/2 → R3, AW„ → R3. (N MPY instructions issued in parallel, one per neuron.) f. ADD R1 R3 → R1 , W' η → R1. (N ADD instructions issued in par¬ allel, one per neuron.) g. — END h. - END i. END 13. Repeat the process until the difference p, — p',, is less than or equal to some specified minimum error. PARALLEL DATA ALGORITHMS MATRIX MULTIPLICATION The neuron input sum of product calculation can be viewed as a matrix multi¬ plication as shown in FIGURE 21 where there are i columns and j rows. The neuron input matrix z, is defined as: z i = Y, W i] + Y 2 W i2 + ... + Y N W l iN NEURON CALCULATIONS AS MATRIX OPERATIONS Neuron calculations are illustrated by FIGURE 21. This is a subset of the general case of matrix multiplications. Consider two N x N matrices as shown in FIGURE 22, with i columns and j rows. GENERAL MATRIX MULTIPLICATION FIGURE 22 illustrates general matrix multiplication. Assuming a row of the Y value matrix is loaded into GPLM by reverse communicating a j row of the Y matrix for each result j row in result matrix z, N values of the result matrix z are calculated in parallel under the general form such as the following, based on a PASCAL like pseudo-code. The FOR loops would be translated into N parallel operations across the N neurons. 1 . FOR i = 1 to N 2. FOR k = 1 to N 3. END FOR 4. END FOR The following procedure will be followed: (Delays in parenthesis assume the ADD tree stage delay δ A = 1.) 1 . Load W matrix (scan in values assuming N W values per neuron and scanning in the N neurons' N W values in parallel takes (NL) time) 2. Load first Y row by reverse communicating Y values (( — 1) 4 log 2 /V) 3. MPYA R1 * R2 → ADD TREE (Where the ADD tree has been initialized for the summation process.) ((L — 1) 4 log 2 /V) 4. Calculate first row of result z matrix - Multiply Y & W registers followed by summation tree (δ M 4 log 2 /V) 5. Store the N z values in learning processor STORE ) 6. Reverse communicate second Y row - ((L — 1) 4 \og 2 N) 7. When the new Y values have been received, calculate second row of the result z matrix - Multiply Y & W registers followed by summation tree ( δ M 4 log,/V) 8. Store the N z values in learning processor. (<5 S 7Ό R _ F ) 9. Continue with row calculations until 10. Reverse communicate N' h Y row - (( — 1) 4 log 2 /V) 11. When the new Y values have been received, calculate N' h row of result z matrix - Multiply Y & W registers followed by summation tree (δ M 4 log 2 /V) 12. Store final row of result z matrix in learning processor. (δ S τo R ε) 13. End After the initialization of the W matrix by scanning in the W values and assuming the store operations can be overlapped with the reverse communi¬ cation of the next row Y values, the total processing time for the N x N 2 calcu¬ lations is: N x N Matrix Multiplication = (L - 1) 4* log 2 /V 4 N(δ M 4 (L - 1) 4 2 \og 2 N) 4 δ STORE MATRIX ADDITION AND BOOLEAN OPERATIONS Assuming matrices of the same form as given in FIGURE 22 both Y and W matrices can be loaded into GPLM structure since there are Λ/ 2 unique Y and W registers in the structure. Local addition or Boolean operations on the Y and W registers can be done within the structure with the result sent to the temporary registers. At completion of the operation the original Y and W matrices will remain intact in the structure and the temp registers will contain the result matrix. The result can be scanned out or individually read out from the synapse processor cells or used for further operations (chaining or linking of instructions). While we have described our preferred embodiments of our inventions it will be understood that those skilled in the art, both now and in the future, upon the understanding of these discussions will make various improvements and enhancements thereto which fall within the scope of the claims which follow. These claims should be construed to maintain the proper protection for the inventions first disclosed.

Claims: What is claimed is: 1. A computer system apparatus having a neural synapse processor archi¬ tecture comprising a N neuron structure, said N neuron structure having synapse proc¬ essing units that contain instruction and data storage units, receive instructions and data, and execute instructions, and wherein said N neuron structure contains communicating adder trees, neuron activation function units, and means for communicating both instructions, data, and the outputs of neuron activation function units back to the input synapse processing units by means of said communicating adder trees. 2. The apparatus according to claim 1 further comprising N 2 synapse proc¬ essing units, each associated with a connection weight in the N neural network to be emulated, placed in the form of a N by N matrix that has been folded along the diagonal and made up of diagonal cells and general cells. 3. The apparatus according to claim 2 wherein said diagonal cells, each comprising a single synapse processing unit, are associated with the diag¬ onal connection weights of the folded N by N connection weight matrix and the general cells, each of which has two synapse processing units merged together, and which are associated with the symmetric connection weights of the folded N by N connection weight matrix. 4. The apparatus according to claim 3 wherein the diagonal cells' single synapse processing units are each comprised of a tag matching unit, a desti¬ nation path control mechanism for externally received instructions and data by means of an instruction/data decoding mechanism, a data path storage unit, and a distributor unit, instruction and data storage units comprised of one instruction storage unit, one weight value storage unit, one neuron acti¬ vation function unit output value storage unit herein termed a Y value storage unit, and one temporary data storage unit, a storage unit operand selection mechanism controlled by means of an instruction decoding mechanism, a selector unit, and addressing means relative to the instruction storage unit, a result destination path control mechanism controlled by means of an instruc¬ tion decoding mechanism and a distributor unit, and a programmable exe¬ cution unit. 5. The apparatus according to claim 3 wherein the diagonal cells' synapse processing units supply results to and receive instructions and data from an attached communicating adder tree of the N neuron structure. 6. The apparatus according to claim 3 wherein the general cells' two synapse processing units merged together are comprised of two tag matching units, a common destination path control mechanism for externally received instructions and data by means of two instruction/data decoding mech¬ anisms, two data path storage units, two command path bits, and a common distributor unit, instruction and data storage units comprised of two instruc¬ tion storage units, two weight value storage units, two Y value storage units, and two temporary data storage units, two storage unit operand selection mechanisms controlled by means of two instruction decoding mechanisms, a common selector unit, and two addressing means relative to the two instruc¬ tion storage units, two result destination path control mechanisms controlled by means of two instruction decoding mechanisms and a common distributor unit, and two programmable execution units. 7. The apparatus according to claim 3 wherein the general cells' two merged synapse processing unit structures are organized symbolically as a top synapse processing unit and a bottom synapse processing unit each of said top and bottom synapse processing unit supplying a result to and receiving instructions and data from an attached communicating adder tree of the N neuron structure. 8. The apparatus according to claim 1 wherein the synapse processors' data storage units contain conditional execution bits with one bit per data storage unit which said bit controls the use of the data and whether the data may be overwritten. 9. The apparatus according to claim 1 wherein the neuron activation function unit is a non-linear sigmoid generator providing a Y value output and sigmoid derivative generator providing a Y(1-Y) value output. 10. The apparatus according to claim 1 wherein the communicating adder trees contain \og 2 N 2 to 1 communicating adder stages. 11 . The apparatus according to claim 10 wherein each stage in the communi¬ cating adder trees contain 2 to 1 communicating adders comprised of a 2 to 1 adder, an adder bypass path for the purposes of communicating values in a reverse direction than that obtained from the addition, and means for switching between the addition function and the reverse communication's path. 12. The apparatus according to claim 1 wherein the communicating adder trees each connect to an additional summation stage wherein an external input value is summed with the output of the communicating adder tree and said additional summation stage provides results to the neuron activation function unit. 13. The apparatus according to claim 1 wherein a programmable processor controlling apparatus which interfaces to an attached Host computer and to the N communicating adder trees provides the following functions: • communicating adder tree control • synapse processor initializations • synapse processor instruction issuing • algorithmic data calculations • synapse processor data issuing • starting a neural network emulation • sequence control for multi-layer networks • stopping a neural network emulation — by convergence testing to a desired result — by completing a host specified number of emulation cycles 14. The programmable processor controlling apparatus of claim 13 contains a weight array, a Y value array, a Y(1-Y) array, a teacher array, and a trace array. 15. The apparatus according to claim 1 wherein there are N 2 synapse proc¬ essing units, N communicating adder trees, and N neuron activation function units for a N neuron structure. 16. The apparatus according to claim 15 wherein each communicating adder tree connects to N synapse processing units at the leaf nodes of the tree and one neuron activation function unit which connects to the root of the tree pro¬ viding results to a programmable processor controlling apparatus and where said communicating adder trees, synapse processing units, and neuron acti¬ vation function units constituting the N neuron structure have: • means for inputting weights and data values to each synapse processing unit, • means for communicating tagged instructions, data, and neuron output values herein termed Y values back to the input synapse processing units, • means for controlling the destination of instructions, data, and Y values in each synapse processing unit, • means for the execution of the received instructions in each synapse proc¬ essing unit, • means for the execution of a previously received instruction when, in an auto mode, data is received to be used in the next operation, • means for operand selection and destination path control allowing results to stay locally in each synapse processing unit or to be sent to the attached communicating adder tree, • means for the summation of values received from the synapse processing units, • means for the inputting of external input values to each neuron activation function unit,. • means for the generation of new instructions, data, and neuron activation function unit Y values. 17. The apparatus according to claim 16 wherein the means for inputting weights and data values to each synapse processing unit comprises a host interface controlling mechanism in the form of a programmable processor controlling apparatus which has access to each weight and data value storage unit in each synapse processing unit. 18. The apparatus according to claim 16 wherein the means for communi¬ cating tagged instructions, data, and neuron output values herein termed Y values back to the input synapse processing units is by means of the commu¬ nicating adder trees acting in a communications mode and tag matching units in each synapse processing unit wherein the tag comprises a broadcast bit and a tag address field. 19. The apparatus according to claim 16 wherein the means for controlling the destination of instructions, data, and Y values in each synapse processing unit is, for instructions, by an instruction decoding mechanism, a command path bit, and distributor logic in the general cells and by an instruction decoding mechanism, a register mapping logic whereby R4 → R3, R5 → R2, R6 → R , and CR2 → CR , and distributor logic in the diagonal cells and, for data including Y values, by a data decoding mechanism and a data path storage unit in both the diagonal cells and the general cells. 20. The apparatus according to claim 19 wherein in one mode of operation of the general cells, termed the YINMODE, the data path storage units and the command path bits are set up such that instructions received from the top communicating adder tree are directed to the top synapse processing unit's instruction storage unit and instructions received from the bottom communi¬ cating adder tree are directed to the bottom synapse processing unit's instruction storage unit and data received from the top communicating adder tree are directed to the top synapse processing unit's specified data storage unit and data received from the bottom communicating adder tree are directed to the bottom synapse processmg unit's specified data storage unit. 21. The apparatus according to claim 19 wherein in a second mode of opera¬ tion of the general cells, termed the YOUTMODE, the data path storage units and the command path bits are set up such that instructions received from the top communicating adder tree are directed to the bottom synapse proc¬ essing unit's instruction storage unit and instructions received from the bottom communicating adder tree are directed to the top synapse processing unit's instruction storage unit and data received from the top communicating adder tree are directed to the bottom synapse processing unit's specified data storage unit and data received from the bottom communicating adder tree are directed to the top synapse processing unit's specified data storage unit. 22. The apparatus according to claim 16 wherein the means for the execution of the received instructions in each synapse processing unit is through a pro¬ grammable execution unit responding to NOP, PATH, Arithmetic, and Logical instructions containing specifications of an auto operation mode, the source operands, the result destination, and specification of immediate data. 23. The apparatus according to claim 16 wherein the means for the execution of a previously received instruction when, in an auto mode, data is received to be used in the next operation is by means of an auto mode flag as set by a received instruction having the capability of setting the auto mode and by receipt of valid data that is sent only after sufficient timing delay, as con¬ trolled by a time out mechanism in a programmable processor controlling apparatus, to ensure no conflicts. 24. The apparatus according to claim 16 wherein the means for operand selection and destination path control allowing results to stay locally in each synapse processing unit or to be sent to the attached communicating adder tree is by means of an instruction decoding mechanism and distributor logic with no operation completion indication given to an attached programmable processor controlling apparatus for those results staying locally within the synapse processing unit. 25. The apparatus according to claim 16 wherein the means for the summa¬ tion of values received from the synapse processing units is through the attached communicating adder trees acting in a function execution mode. 26. The apparatus according to claim 16 wherein the means for the inputting of external input values to each neuron activation function unit is through an externally applied input to a final summation stage located at the output of the communicating adder tree. 27. The apparatus according to claim 16 wherein the means for the gener¬ ation of new instructions, data, and neuron activation function unit Y values is by means of neuron activation function units and a programmable processor controlling apparatus which interfaces to an attached Host computer and to the N communicating adder trees. 28. The programmable processor controlling apparatus of claim 27 wherein a time out state machine controlling mechanism is used on the instruction and data issuing mechanism to avoid hazards on the structure. 29. The apparatus of claim 16 wherein the data are in a bit-serial format which for the data is, in the order the bits are received into a diagonal or general cell, first a broadcast bit, next a tag field, next an error handling bit/s, continuing with a command bit set to an inactive state to indicate data, a spare bit, a data field, and ending in error handling bit/s. 30. The apparatus of claim 16 wherein the instructions are in a bit-serial format which for instructions is, in the order the bits are received into a diag¬ onal or general cell, first a broadcast bit, next a tag field, next an error han¬ dling bit/s, continuing with a command bit set to an active state to indicate an instruction, an auto bit, a command field indicating the instruction type, a source-1 field indicating the first operand, a source-2 field indicating the second operand, a destination field indicating the destination of results, an immediate data field, and ending in error handling bit/s. 31. The apparatus of claim 16 wherein there is provided means for sequen¬ tially performing to emulate a completely connected N neural network by: a) the placement of the N communicating adder trees in a communi¬ cations mode, b) the loading to the structure of the initial weights, Y values, the general cells' data paths and command path bits set to YOUTMODE, c) the issuing of a multiply instruction to the N communicating adder trees, d) the receipt of the multiply instruction in the synapse processor units' instruction storage units, e) the placement of the N communicating adder trees in a function mode, f) the multiplication of neuron Y_ values by weights W l} values, g) the products of Y values by weights directed to the attached communi¬ cating adder trees h) the summation of the directed product values on the communicating adder trees in a function mode, i) the application of and the summation of an external input value with the summation of the directed product values from the communicating adder trees, j) the generation of N neuron Y values from the neuron activation function units, k) the placement of the communication adder trees in a communications mode, and I) the issuing of the N neuron Y values to the N communicating adder trees thereby completing one neural network update cycle. 32. The apparatus of claim 16 wherein there is means provided for sequen¬ tially performing to emulate back-propagation learning on a multi-layer neural network, comprised of an N equal to eleven neuron structure made up of four layers wherein the first layer contains two neurons with external inputs, the second layer contains one neuron, the third layer contains four neurons, and the fourth layer contains four neurons, for an input/output encoder problem, and where registers are used for storage units, wherein the structure and controls enable a process when MPY indicates a multiply instruction, a desti¬ nation of ADD TREE sends results to the attached communicating adder tree, the programmable processor controlling apparatus is termed the learning processor, and GPLM is used to refer to the N neuron structure where: a) GPLM is initialized by scanning in the initial set of weight values with the weight register CEB bit set to a "1"; and the other weight values and all Y value registers are scanned in with a zero value; b) after initialization, GPLM is placed into execution mode and an input pattern applied, EX1 and EX2; c) neurons 1 , 2, ..., 11 issue MPYA R1 * R2 → ADD TREE where the ADD tree is specified for the summation operation; d) the first layer of neurons is executed on the GPLM structure creating the first layer neuron outputs and their derivatives; and the first layer neuron outputs are fed back into GPLM and the second layer of neurons is executed creating the second layer of neuron outputs and their derivatives; and e) the process continues until all layers have been executed and the network output and their derivatives are obtained; and f) after all 11 neuron values and their derivatives have been calculated and placed into a Y value and Y derivative array, GPLM is placed into the learning mode; and g) the learning processor checks the Y,s for convergence to the minimum specified error, where if reached, the learning process can be stopped for pattern p, but if the convergence has not been reached, the learning for pattern p continues; and h) the learning processor calculates the δf for the output neurons for use in updating the weights between the output neurons and the neurons in the pre¬ vious layer; and i) the data path is changed, by neurons 1 , 2 11 issuing PATH R4, and the error signals are then reverse communicated to their respective multiplier input cells temporary registers; and j) the system apparatus is controlled to issue a MPY instruction to multiply the error signals times the appropriate weights; and the products are summed creating the error summations, ERf, to be used in the next layer back weight modification process; and k) neurons 8, 9, 10. and 11 issue MPY R6 * R3 → ADD TREE; and I) the error signals in layer L are calculated for use in the next layer pre¬ vious to L, if present; neuron 3 being placed in YINMODE via PATH CR1 , such that neuron 3 will then be issued a multiply command, and finally neuron 3 will be placed in YOUTMODE via PATH CR2 to be consistent with the other neurons in the GPLM structure; and m) neuron 3 issues MPY R6 * R3 → ADD TREE; and n) the error signal for layer 2 (E3) is calculated and reverse communicated in the structure; and o) the neurons' AW, ; are be calculated; and and then p) STEP 1 - neurons 1 , 2, ..., 11 issue MPY R5 * R3 → R4. and q) STEP 2 - neurons 1 , 2, ..., 11 issue MPY R4 * IMD → R4, where IMD con¬ tains the learning rate p; and r) STEP 3 - neurons 1 , 2, ..., 11 issue ADD R6 4 R4 → R6; with new weight values being calculated; and s) a new path command is sent in preparation for the next learning cycle. PATH R2 so that the new Y values are sent to the proper registers; and t) GPLM is placed in execution mode and the existing pattern p is applied again until the adjusted weights allow the output pattern to match the teaching pattern with a minimum specified error; and wherein after conver- gence to the minimum specific error is reached, a new pattern may be applied and the process repeated until all teaching patterns have been applied. 33. The apparatus of claim 16 wherein there is means provided for sequen¬ tially performing to emulate a Boltzmann like machine of an input/output encoder problem consisting of three layers of neurons.and where registers are used for storage units, wherein the structure and control for the system apparatus enables a process when MPY indicates a multiply instruction, a destination of ADD TREE sends results to the attached communicating adder tree, the programmable processor controlling apparatus is termed the learning processor, and GPLM is used to refer to the N neuron structure where the sequence includes a) begin a network update cycle by "clamping" the input and output units to one of the I/O encoder patterns; and b) randomly select a hidden unit neuron for updating, as input/output units are clamped; and c) determine the "On" State Probability, OSP, of the selected i th neuron; and d) the learning processor determines the selected neuron's activation value Y; and f) the newly updated Y value is reverse communicated in the network; g) continue with neuron selection and updating process until enough cycles have been run to obtain statistically significant neuron activity and the network reaches "equilibrium" through an annealing schedule, by varying a parameter T, where a learning processor records, for the connected neurons, a value indicating how often the connected units were "on" at the same time; and h) if there are more patterns to be run, select the next input/output encoder pattern and "clamp" it on the network and run the network as defined above beginning with step 2, and continue taking statistics over all patterns run on the network; and i) after running all the patterns, recording the statistic values which repre¬ sent the probability that a pair of connected neurons were "on" together, so that the learning processor keeps an array of the "clamped" statistics; and then j) the network is "undamped", all neuron values randomized with equal probability of being "on" or "off", and the network, following an annealing schedule, is allowed to reach "equilibrium": and k) statistics of pairs of "on" units are then recorded for as many annealings as were done in the "clamped" mode of operation, the learning processor keeping an array of the "undamped" statistics. I) using the obtained statistics the change in the weight AW n = p(p, j — p'„) is calculated by loading registers with the p u and — P', y and then adding the stored values, followed by a multply with p the learning rate stored as imme¬ diate data. m) the new weight is calculated by adding the A\N n to the old weight value and storing the result in place of the old weight. 34. The apparatus of claim 16 wherein there is means provided for sequen¬ tially performing matrix multiplications of two N by N matrices, one termed a W matrix and the other termed the Y matrix, where the multiplication creates a third N by N matrix, termed the z matrix.and registers are used for storage units, enabling a process when MPY indicates a multiply instruction, a desti¬ nation of ADD TREE sends results to the attached communicating adder tree, the programmable processor controlling apparatus is termed the learning processor, and GPLM is used to refer to the N neuron structure where the process steps include: a) load W matrix (scan in values assuming N W values per neuron) b) load first Y row by reverse communicating Y values c) MPYA R1 * R2 → ADD TREE (Where the ADD tree has been initialized for the summation process.) d) calculate first row of result z matrix - Multiply Y & W registers followed by summation tree e) store the N z values in learning processor f) reverse communicate second Y row g) when the new Y values have been received, calculate second row of the result z matrix - Multiply Y & W registers followed by summation tree h) store the N z values in learning processor, i) continue with . row calculations until j) reverse communicate N th Y row k) when the new Y values have been received, calculate N th row of result z matrix - Multiply Y & W registers followed by summation tree I) store final row of result z matrix in learning processor. 35. The apparatus of claim 16 wherein there is means provided for sequen¬ tially performing matrix addition of two N by N matrices, one termed a W matrix and the other termed the Y matrix, where the addition creates a third N by N matrix, termed the z matrix, stored internally to the synapse processors in the temporary storage units, where registers are used for storage units, where when GPLM is used to refer to the N neuron structure then assuming both Y and W matrices are loaded into GPLM structure, and there are N 2 unique Y and W (weight) registers in the structure, the system is enabled to perform the local addition on the Y and W registers which addition is done within the structure with the result sent to the synapse processing units' temporary registers which after completion of the addition the original Y and W matrices will remain intact in the structure and the temporary regis¬ ters will contain the addition result matrix which can be scanned out, individ¬ ually read out from the synapse processor cells, or used for further operations. 36. The apparatus of claim 16 wherein there is means provided for sequen¬ tially performing matrix Boolean operations on two N by N matrices, one termed a W matrix and the other termed the Y matrix, where the Boolean operation creates a third N by N matrix, termed the z matrix, stored internally to the synapse processors in the temporary storage units, where registers are used for storage units and where when GPLM is used to refer to the N neuron structure then assuming both Y and W matrices are loaded into GPLM structure, there are N 2 unique Y and W (weight) registers in the structure, and wherein a local Boolean operation on the Y and W registers is done within the structure with the result sent to the synapse processing units' temporary registers which after completion of the Boolean operation the original Y and W matrices will remain intact in the structure and the temporary registers will contain the Boolean operation result matrix which can be scanned out, indi¬ vidually read out from the synapse processor cells, or used for further oper¬ ations.

Inventors: DELGADO-FRIAS JOSE GUADALUPE, PECHANEK GERALD GEORGE, VASSILIADIS STAMATIS, DELGADO-FRIAS, JOSE, GUADALUPE, PECHANEK, GERALD, GEORGE, VASSILIADIS, STAMATIS
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1991
Main classification: G06F15
IPC codes: G06F15, G06G7, G06N1, G06N3