US4068305A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Associative processors
Assignee: Plessey Handel und Investments AG
•
Filing: 1976-05-12
•
Granted: 1978-01-10
•
Expires: 1996-05-12
Abstract
Abstract A fully parallel, distributed logic associative processor, comprising a content-addressable memory having computational logic associated with each memory cell. The cells are arranged in a rectangular array, and logical operations may be performed between adjacent cells, or between the data being input to the machine, and the contents of a chosen word, or chosen words.
Inventors
- 👤 Ronald Michael Cutler
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 16:40
CPC Classifications
H; H03; H03K; H03K19/00; H03K19/02; H03K19/173; H03K19/177; G; G11; G11C; G11C15/00; G11C15/04; H03K19/17704
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
257 words
An associative processor comprising in combination an associative store and a program store, the associative store including, an array of associative memory cells arranged in equal multi-bit memory words each cell having input, output and match paths, a plurality of response circuits one for each memory word in said array and connected to the match path of all the cells in a memory word, a multi-bit input register, for use in the content addressing operations, each bit of which is connected to the input path of the corresponding bit of all the memory words, and a multi-bit output register, for use in reading information from the store, and each bit of the output register is connected to the output path of the corresponding bit of all the memory words, the improvement comprising a command signal highway connecting the program store to all the response circuits, said highway being arranged to carry logic manipulative operation control signals, and the associative memory cells each include logic manipulative means for conditioning the cell to assume a state indicative of, i. the logic AND of an input data bit with the data bit stored in the memory cells, ii. the logic OR of an input data bit with the data bit stored in the memory cell, or iii. the inverse of the state of the data bit stored in the memory, the actual operation performed being defined by the command signals passed to the cells of a word by the activation of a response circuit following an associative store match operation.
Claim 2
Dependent Claim
257 words
An associative processor comprising in combination an associative store and a program store, the associative store including, an array of associative memory cells arranged in equal multi-bit memory words each cell having input, output and match paths, a plurality of response circuits one for each memory word in said array and connected to the match path of all the cells in a memory word, a multi-bit input register, for use in the content addressing operations, each bit of which is connected to the input path of the corresponding bit of all the memory words, and a multi-bit output register, for use in reading information from the store, and each bit of the output register is connected to the output path of the corresponding bit of all the memory words, the improvement comprising a command signal highway connecting the program store to all the response circuits, said highway being arranged to carry logic manipulative operation control signals, and the associative memory cells each include logic manipulative means for conditioning the cell to assume a state indicative of, i. the logic AND of an input data bit with the data bit stored in the memory cells, ii. the logic OR of an input data bit with the data bit stored in the memory cell, or iii. the inverse of the state of the data bit stored in the memory, the actual operation performed being defined by the command signals passed to the cells of a word by the activation of a response circuit following an associative store match operation.
Claim 3
Dependent Claim
71 words
An associative processor according to claim 1 wherein the output path from each cell is connected to (i) the input path of the corresponding memory cell in contiguous words and (ii) the input path of contiguous bit memory cells of the same word and each memory cell includes input path gating means for selecting the appropriate path to provide the input data bit to be used in a logic manipulative operation.
Claim 4
Dependent Claim
43 words
An associative processor as claimed in claim 2 in which the command signal highway comprises an input/shift select wire, firs and second cell function control wires, an invert wire, up, down, right and left shift control wires and a cell clock pulse wire.
Claim 5
Dependent Claim
119 words
An associative processor as claimed in claim 3 in which the first and second cell function control wires when set to a first state cause, upon the occurrence of a clock pulse, the cell conditions to be set to the states defined by the input register, when the first control wire is set to the first state and the second control wire is set to a second state the cell performs an OR operation involving the cell state and the selected input path condition whereas when the first control wire is set to the second state and the second control wire is set to the first state the cell performs an AND operation involving the selected input path condition.
Claim 6
Dependent Claim
50 words
An associative processor as claimed in claim 4 in which the program store is used to store a sequence of command signals and the sequence is arranged to be active upon a selected memory word to cause the cells of the word to perform a sequence of logic manipulative operations.
Claim 7
Dependent Claim
27 words
An associative processor as claimed in claim 5 wherein each cell includes a clocked JK toggle having a pair of AND gates OR connected onto each input.
References Cited (Backward Citations)
US3106698A
Cited
US3308436A
Cited
US3364472A
Cited
US3936806A
Cited
US3815095A
Cited
US3970993A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-01-09 | 1981-07-11 | 1982-01-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-01-09 | 1985-07-11 | 1986-01-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-01-09 | 1989-07-11 | 1990-01-10 | $7700.00 | Window Closed / Lapsed |