Patent US2363424A successfully refreshed from Google Patents.
Patent US4061906A successfully refreshed from Google Patents.
US4061906A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer for numeric calculation of a plurality of functionally interrelated data units
Assignee: Individual
•
Filing: 1976-04-26
•
Granted: 1977-12-06
•
Expires: 1996-04-26
Abstract
Abstract A computer for numeric calculation of a plurality of functionally interrelated data units, each data unit corresponding to a point of a grid. The computer includes a cyclic memory having at least as many storage cells as the grid has grid points. Each storage cell includes a first memory location for storing a corresponding grid point data unit and a second memory location for storing a code associated with the grid point data unit stored in the first memory location. The code contains information for controlling and processing the grid point data unit stored in the first memory location. A new grid point data unit is calculated for the grid point corresponding to a preselected storage cell by a computing circuit which uses mathematical operations involving data units associated with grid points adjacent the grid point corresponding to the preselected storage cell.
Inventors
- 👤 Wolfgang Grebe
- 👤 Siegfried Buhlmann
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 15:45
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/11; G06F17/13
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
309 words
In a computer for numeric calculation of a plurality of functionally interrelated data units, each data unit corresponding to a point of a grid, the grid being arranged in rows and columns and covering a domain of solutions, using mathematical operations involving data units associated with grid points adjacent a preselected grid point and including a cyclic memory having at least as many storage cells as the grid has grid points, each storage cell storing a corresponding grid point data unit; means for storing information in at least one of the storage cells; shifting means for cyclically shifting cell-by-cell the information contained in the storage cells; a plurality of computing means, each computing means capable of being connected to more than one storage cell; and means for retrieving information from the cyclic memory when a calculation has been carried out, the improvement wherein: each storage cell includes a first memory location for storing the corresponding grid point data unit and a second memory location for storing a code associated with the grid point data unit stored in the first memory location, the code containing information for controlling and processing the grid point data unit stored in the first memory location; and wherein each computing means is connected to a respective preselected storage cell and the storage cells storing smultaneously, at a predetermined time of each complete shift cycle, the grid point data units of grid points adjacent, in row and column direction of the grid, the grid point corresponding to said respective preselected storage cell at the predetermined time, each computing means being controlled by the code stored in the second memory location of said respective preselected storage cell for calculating a new grid point data unit for the grid point corresponding to said respective preselected storage cell using the grid point data units of the adjacent grid points.
Claim 2
Dependent Claim
309 words
In a computer for numeric calculation of a plurality of functionally interrelated data units, each data unit corresponding to a point of a grid, the grid being arranged in rows and columns and covering a domain of solutions, using mathematical operations involving data units associated with grid points adjacent a preselected grid point and including a cyclic memory having at least as many storage cells as the grid has grid points, each storage cell storing a corresponding grid point data unit; means for storing information in at least one of the storage cells; shifting means for cyclically shifting cell-by-cell the information contained in the storage cells; a plurality of computing means, each computing means capable of being connected to more than one storage cell; and means for retrieving information from the cyclic memory when a calculation has been carried out, the improvement wherein: each storage cell includes a first memory location for storing the corresponding grid point data unit and a second memory location for storing a code associated with the grid point data unit stored in the first memory location, the code containing information for controlling and processing the grid point data unit stored in the first memory location; and wherein each computing means is connected to a respective preselected storage cell and the storage cells storing smultaneously, at a predetermined time of each complete shift cycle, the grid point data units of grid points adjacent, in row and column direction of the grid, the grid point corresponding to said respective preselected storage cell at the predetermined time, each computing means being controlled by the code stored in the second memory location of said respective preselected storage cell for calculating a new grid point data unit for the grid point corresponding to said respective preselected storage cell using the grid point data units of the adjacent grid points.
Claim 3
Dependent Claim
110 words
A computer according to claim 1, wherein each code includes at least one labeling bit place for boundary value information specifying whether or not the grid point data unit is associated with a grid point located inside the domain of solutions; and wherein each computing means includes means controlled by the boundary value information for replacing in the first memory location of said respective preselected storage cell the grid point data unit stored in said respective preselected storage cell with the new grid point data unit only when the boundary value information indicates that the grid point corresponding to said respective preselected storage cell lies within the domain of solutions.
Claim 4
Dependent Claim
198 words
A computer according to claim 1, wherein each computing means includes a plurality of multipliers, one multiplier for each grid point data unit used to calculate the new grid point data unit, each multiplier having a data input for a respective grid point data unit, a coefficient input and a product output for generating a product output signal, each data input being connected to the first memory location of a respective storage cell which, at the time of calculation of the new grid point data unit, contains a grid point data unit used to calculate the new grid point data unit; a decoding unit, including a code input for receiving the code stored in the second memory location of one of said respective preselected storage cells and a plurality of coefficient outputs, each coefficient output being connected to a respective coefficient input of the multipliers, the decoding unit generating at the coefficient outputs, when the code is received by the decoding unit, coefficient signals corresponding to the information contained in the code; and circuit means connected to the outputs of the multipliers for forming a new grid point data unit from the product output signals of the multipliers.
Claim 5
Dependent Claim
203 words
A computer according to claim 3, further comprising a plurality of auxiliary shift registers, each auxiliary shift register having an input connected to the first memory location of one of the preselected storage cells and including at least as many storage cells as the number of storage cells of the cyclic memory between said one of the preselected storage cells and the following preselected storage cell in the direction of shift so that every storage cell of each auxiliary shift register corresponds to a storage cell of the cyclic memory; a pair of switch means associated with each auxiliary shift register, each switch means having a first input connected to a storage cell of its respective auxiliary shift register corresponding to a grid point adjacent the grid point corresponding to said one of the preselected storage cells, a second input connected to the storage cell of the cyclic memory corresponding to the storage cell of the auxiliary shift register connected to the first input, and an output connected to the data input of one of the multipliers of the computing means for said one of the preselected storage cells; and a source for a switching signal associated with each pair of switch means.
Claim 6
Dependent Claim
24 words
A computer according to claim 4, wherein each decoding unit generates the switching signal by decoding the code received at its respective code input.
Claim 7
Dependent Claim
40 words
A computer according to claim 1, wherein each computing means is connected to the storage cells for the two grid points most nearly adjacent, in each row and column direction, the grid point corresponding to said respective preselected storage cell.
Claim 8
Dependent Claim
34 words
A computer according to claim 1, wherein each computing means is connected to the storage cells for the grid points adjacent, in diagonal direction, the grid point corresponding to said respective preselected storage cell.
Claim 9
Dependent Claim
21 words
A computer according to claim 1, wherein each computing means is connected to a corresponding storage cell in two additional computers.
Claim 10
Dependent Claim
28 words
A computer according to claim 1, further comprising a dynamic memory, at least one of the storage cells of the cyclic memory being included in the dynamic memory.
Claim 11
Dependent Claim
28 words
A computer according to claim 1, further comprising a static memory, at least one of the storage cells of the cyclic memory being included in the static memory.
Claim 12
Dependent Claim
73 words
A computer according to claim 1, wherein the cyclic memory has an equivalent storage cell dimension for each dimension of a problem to be solved by the mathematical operations; and wherein the computing means for each preselected storage cell per dimension is connected to at least two storage cells for grid points which are adjacent, in the direction of dimension of the problem, the grid point corresponding to said respective preselected storage cell.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1980-12-05 | 1981-06-06 | 1981-12-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-12-05 | 1985-06-06 | 1985-12-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-12-05 | 1989-06-06 | 1989-12-06 | $7700.00 | Window Closed / Lapsed |