Patent US5325464A successfully refreshed from Google Patents.
US5325464A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Pyramid learning architecture neurocomputer
Assignee: International Business Machines Corp
•
Filing: 1993-06-18
•
Granted: 1994-06-28
•
Expires: 2013-06-18
Abstract
Abstract The Pyramid Learning Architecture Neurocomputer (PLAN) is a scalable stacked pyramid arrangement of processor arrays. There are six processing levels in PLAN consisting of the pyramid base, Level 6, containing N 2 SYnapse Processors (SYPs), Level 5 containing multiple folded Communicating Adder Tree structures (SCATs), Level 4 made up of N completely connected Neuron Execution Processors (NEPs), Level 3 made up of multiple Programmable Communicating Alu Tree (PCATs) structures, similar to Level 5 SCATs but with programmable function capabilities in each tree node, Level 2 containing the Neuron Instruction Processor (NIP), and Level 1 comprising the Host and user interface. The simplest processors are in the base level with each layer of processors increasing in computational power up to a general purpose host computer acting as the user interface. PLAN is scalable in direct neural network emulation and in virtual processing capability. Consequently, depending upon performance and cost trade-offs, the number of physical neurons N to be implemented is chosen. A neural network model is mapped onto Level 3 PCATs, Level 4 NEPs, Level 5 SCATs, and Level 6 SYPs. The Neuron Instruction Processor, Level 2, controls the neural network model through the Level 3 programmable interconnection interface. In addition, the NIP level controls the high speed and high capacity PLAN I/O interface necessary for large N massively parallel systems. This discussion describes the PLAN processors attached to a Host computer and the overall control of the pyramid which constitutes the neurocomputer system.
Inventors
- 👤 Gerald G. Pechanek
- 👤 Stamatis Vassiliadis
- 👤 Jose G. Delgado-Frias
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 18:38
CPC Classifications
G; G06; G06N; G06N3/00; G06N3/02; G06N3/10; G06N3/06; G06N3/063
Claims Analysis
Total Claims: 35
Claim 1
Independent Claim
141 words
A computer system apparatus having a scalable hierarchical processing architecture for the emulation of neural networks, having V neurons, where V represents the number of virtual neurons, in an N neuron structure, where N represents the number of physical neurons, and where N and V are integers greater than zero with V greater than or equal to N, comprising: a Level 1 processor including a host processor, a Level 2 processor including a Neuron Instruction Processor (NIP), N Level 4 processors including Neuron Execution Processors (NEPs), a Level 3 programmable function and connection processor interface between the NIP and the N NEPs, N 2 level 6 processors including SYnapse Processors (SYPs), and N Level 5 processors including Synapse Communicating Adder Trees (SCATs) for providing an interface between the N NEPs and the N 2 SYPs, whereby each NEP controls N SYP's.
Claim 2
Dependent Claim
141 words
A computer system apparatus having a scalable hierarchical processing architecture for the emulation of neural networks, having V neurons, where V represents the number of virtual neurons, in an N neuron structure, where N represents the number of physical neurons, and where N and V are integers greater than zero with V greater than or equal to N, comprising: a Level 1 processor including a host processor, a Level 2 processor including a Neuron Instruction Processor (NIP), N Level 4 processors including Neuron Execution Processors (NEPs), a Level 3 programmable function and connection processor interface between the NIP and the N NEPs, N 2 level 6 processors including SYnapse Processors (SYPs), and N Level 5 processors including Synapse Communicating Adder Trees (SCATs) for providing an interface between the N NEPs and the N 2 SYPs, whereby each NEP controls N SYP's.
Claim 3
Dependent Claim
40 words
The apparatus according to claim 1 wherein the N neuron structure further comprises memory storage means for storing connection weights and neuron values ("Y") for V neurons, the storage means separate from but directly accessible by the NEPs and SYPs.
Claim 4
Dependent Claim
64 words
The apparatus according to claim 1 wherein the NIP comprises a microcoded controller that executes instructions received from the host processor, formats and issues tagged instructions and data to the Level 3 interface, the Level 4 processors, the Level 5 processors, and the Level 6 processors, where the tagged instructions indicate a destination processing level, and receives processed data from the Level 3 interface.
Claim 5
Dependent Claim
48 words
The apparatus according to claim 3 wherein the NIP further comprises a bit for each NEP and a bit for groups of NEPs that indicate whether a corresponding NEP or group of NEPs is operational, able to receive instructions and data, and execute instructions, or is not operational.
Claim 6
Dependent Claim
30 words
The apparatus according to claim 4 wherein the NIP further comprises an interface to the groups of NEPs for transferring the bits to grouped NEPs under an NIP microcode control.
Claim 7
Dependent Claim
79 words
The apparatus according to claim 3 wherein the tagged instructions and data comprises a broadcast bit (B), Level destination address bits, and level specific tag bits, wherein if B is active processors at the destination specified by the Level destination address bits receive information and if B is inactive the processors at the destination specified by the Level destination address bits check the level specific tag bits to determine if the information is to be received at that processor.
Claim 8
Dependent Claim
69 words
The apparatus according to claim 3 wherein the tagged instructions to the Level 3 interface are in a bit-serial format including a broadcast bit, Level 3 destination address bits, stage identification tag bits, an error handling bit or bits, an instruction identifier bit set to an active state to indicate an instruction is being sent, a node command field specifying the instruction, and an error handling bit or bits.
Claim 9
Dependent Claim
72 words
The apparatus according to claim 3 wherein the tagged data to the Level 4 processors are in a bit-serial format including a broadcast bit, Level 4 destination address bits, NEP number tag bits, an error handing bit or bits, an instruction identifier bit set to an inactive state to indicate data is being sent, a group bit, a Conditional Execution Bit (CEB), a data field, and an error handling bit or bits.
Claim 10
Dependent Claim
104 words
The apparatus according to claim 1 wherein the Level 3 programmable function and connection processor interface between the NIP and the N NEPs comprises multiple Programmable Communicating Alu Trees (PCATs) wherein each PCAT communicates to, and provides programmable functions on data received from, a group of NEPs, and PCAT internal nodes includes a programmable ALU and a node bypass path which, under a NIP generated mode control mechanism, together allow a programmed function execution of data output from Level 4 NEPs, in a function execution mode, and the transfer of instructions or data to the PCAT nodes and the NEPs in a communications mode.
Claim 11
Dependent Claim
43 words
The apparatus according to claim 9 further comprising means for performing a tag matching operation to determine whether to receive and process the instructions or data received at the PCAT node or to transmit the instructions or data to a next PCAT node.
Claim 12
Dependent Claim
61 words
The apparatus according to claim 1 wherein the Level 3 PCAT programmable function and connection processor interface between the NIP and the N NEPs is comprised of an instruction set architecture responding to ARITHMETIC and LOGICAL instructions, and wherein within a stage of a Programmable Communicating Alu Tree nodes execute a function in a constant amount of time and in synchronism.
Claim 13
Dependent Claim
23 words
The apparatus according to claim 1 wherein each of the N Level 4 NEPs have a SCAT interface to N Level 6 SYPs.
Claim 14
Dependent Claim
35 words
The apparatus according to claim 1 wherein each of the N level 4 NEPs comprises an interface to an external memory for reading external input values and teacher values, and reading and writing neuron values.
Claim 15
Dependent Claim
97 words
A computer apparatus having a hierarchical architecture for emulating neural networks, the apparatus comprising: a level 1 processor including a host processor, a level 2 processor including a neuron instruction processor; N level 4 processors including neuron execution processors, where N represents the number of physical neurons and is an integer greater than zero; a level 3 processor interface between the level 2 and level 4 processors; N 2 level 6 processors including synapse processors; and N level 5 processors including synapse communicating adder trees for providing an interface between the level 4 and level 6 processors.
Claim 16
Dependent Claim
97 words
A computer apparatus having a hierarchical architecture for emulating neural networks, the apparatus comprising: a level 1 processor including a host processor, a level 2 processor including a neuron instruction processor; N level 4 processors including neuron execution processors, where N represents the number of physical neurons and is an integer greater than zero; a level 3 processor interface between the level 2 and level 4 processors; N 2 level 6 processors including synapse processors; and N level 5 processors including synapse communicating adder trees for providing an interface between the level 4 and level 6 processors.
Claim 17
Dependent Claim
62 words
The apparatus according to claim 14, further comprising an N neuron structure partitioned into groups of synapse processing units, each synapse processing unit including means for receiving and storing instructions and data, means for executing instructions, means for group instruction execution, means for communicating to communicating adder trees, and means for interfacing with external storage to communicate weights and neuron output values.
Claim 18
Dependent Claim
73 words
The apparatus according to claim 15, wherein the N neuron structure further includes: neuron activation units; means for interconnecting the groups of synapse processing units into an N neuron structure for supporting an emulation of V neurons, where V represents the number of virtual neurons and is an integer greater than N; means for communicating instructions, data, and neuron activation unit outputs back to the synapse processing units through the communicating adder trees.
Claim 19
Dependent Claim
30 words
The apparatus according to claim 14, further comprising means for parallel and synchronized execution of a fixed function operation upon level 6 processor data by the N level 5 processors.
Claim 20
Dependent Claim
41 words
The apparatus according to claim 14, further comprising means for a user interface with the level 1 processor for providing neural network specifications, and a compiler for producing assembler code from a user input for interfacing with the level 2 processor.
Claim 21
Dependent Claim
68 words
The apparatus according to claim 14, wherein the level 2 processor further includes a microcoded controller for issuing tagged instructions and data to the level 4 processors, the tagged instructions and data including data for identifying the level 4 processor to receive the instructions and data, and for identifying if the instructions and data will be resent by the level 4 processor to a selected level 6 processor.
Claim 22
Dependent Claim
37 words
The apparatus according to claim 19, wherein the level 2 processor further includes means for coordinating disk access and the level 1 processor's access to storage used by the level 2, level 4, and level 6 processors.
Claim 23
Dependent Claim
76 words
The apparatus according to claim 14, wherein the level 3 processor interface comprises orthogonal programmable communicating ALU trees including means for providing programmable functions on data received from a group of level 4 processors, execution means for executing the functions on the received level 4 processor data, communication means for transfer of instructions or data to the level 4 processors, and a level 2 processor control means for activating the execution means or the communication means.
Claim 24
Dependent Claim
36 words
The apparatus according to claim 14, wherein the level 3 processor interface comprises a folded array of programmable communicating ALU trees for complete connectivity among the communicating ALU trees' output points via the level 4 processors.
Claim 25
Dependent Claim
40 words
The apparatus according to claim 14, wherein the level 3 processor interface comprises programmable communicating ALU trees including means for deciding whether or not a programmed node function is to be executed at a programmable communicating ALU tree's leaf node.
Claim 26
Dependent Claim
20 words
The apparatus according to claim 14, wherein the level 5 processors further provide complete connectivity among the level 4 processors.
Claim 27
Dependent Claim
34 words
The apparatus according to claim 14, wherein the level 4 processors interface with external memory for reading and writing data such as input values, neuron output values, and programmable values in a trace array.
Claim 28
Dependent Claim
68 words
The apparatus according to claim 25, wherein the level 4 processors interface with external memory via a direct addressing mode using an immediate data field of an instruction as an external memory address, an internal addressing mode using an internal counter and level 4 processor instructions, or a register offset mode using a level 4 processor register and an instruction's immediate data field as an offset addressing means.
Claim 29
Dependent Claim
32 words
The apparatus according to claim 14, wherein the level 4 processors further include means for receiving all level 4 and level 6 destined instructions and data issued by the level 2 processor.
Claim 30
Dependent Claim
55 words
The apparatus according to claim 27, wherein a decoded level 6 instruction or data is forwarded to the level 6 processors through the level 5 processors, and wherein a new level 4 or level 6 instruction is not executed pending a completion response received by the level 4 processors sent via the level 5 processors.
Claim 31
Dependent Claim
48 words
The apparatus according to claim 14, wherein each of the level 4 processors comprise a neuron execution instruction set, including means for selecting any required registers, memory, data, or bits as source operands, for providing results to at least one destination, and for setting any operation completion flags.
Claim 32
Dependent Claim
34 words
The apparatus according to claim 14, wherein the level 2 processors include means for specifying a number of times a level 4 processor executes an instruction or group of instructions upon successively received operands.
Claim 33
Dependent Claim
27 words
The apparatus according to claim 14, further comprising level 4 processor means for indicating to one of the level 2 processors a successful, unsuccessful, or erroneous operation.
Claim 34
Dependent Claim
142 words
A computer system apparatus having a multi-level processing structure for emulating neural networks, the multi-level structure comprising: a plurality of processing levels, a first one of the processing levels including at least one host processor, a second one of the processing levels including at least one neuron instruction processor, a third one of the processing levels including at least one neuron execution processor, a forth one of the processing levels including at least two synapse processors, and each of the plurality of levels including means for executing instructions; means for communicating instructions and data between adjacent processing levels including: means for said at least one neuron instruction processor to interface with said at least one neuron execution processor; and interface means between said at least one neuron execution processor and said at least two synapse processors including a synapse communicating adder tree.
Claim 35
Dependent Claim
142 words
A computer system apparatus having a multi-level processing structure for emulating neural networks, the multi-level structure comprising: a plurality of processing levels, a first one of the processing levels including at least one host processor, a second one of the processing levels including at least one neuron instruction processor, a third one of the processing levels including at least one neuron execution processor, a forth one of the processing levels including at least two synapse processors, and each of the plurality of levels including means for executing instructions; means for communicating instructions and data between adjacent processing levels including: means for said at least one neuron instruction processor to interface with said at least one neuron execution processor; and interface means between said at least one neuron execution processor and said at least two synapse processors including a synapse communicating adder tree.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-27 | 1997-12-27 | 1998-06-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-27 | 2001-12-27 | 2002-06-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-27 | 2005-12-27 | 2006-06-28 | $7700.00 | Window Closed / Lapsed |