Patent US5544168A successfully refreshed from Google Patents.
Patent US3141905A successfully refreshed from Google Patents.
Patent US2951365A successfully refreshed from Google Patents.
Patent US4860236A successfully refreshed from Google Patents.
US4860236A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cellular automaton for generating random data
Assignee: University of Manitoba
•
Filing: 1987-10-26
•
Granted: 1989-08-22
•
Expires: 2007-10-26
Abstract
Abstract A cellular automaton which generates pseudorandom data comprises a series of cells arranged such that each cell receives signals from electrically adjacent first and second cells. Each cell comprises a D-type flip-flop for storing a data bit, and logic circuitry which couples the flip-flop of the cell to those of associated first and second adjacent cells. The logic circuitry responds to the current state of the data bits stored by a particular cell and its associated first and second electrically adjacent cells by changing the value of the data bit stored by the particular cell according to the following relationship: a(t+1)=.sub.first (t) XOR[a(t) OR a.sub.second (t)] where, a(t) represents the current state of the data bit stored by the particular cell, a(t+1) represents the next state of the data bit stored by the particular cell, a first (t) represents the current state of the data bit stored by the first electrically adjacent cell, and a second (t) represents the current state of the data bit stored by the second electrically adjacent cell.
Inventors
- 👤 Robert McLeod
- 👤 Howard Card
- 👤 Peter Hortensius
- 👤 Werner Pries
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 01:47
CPC Classifications
H; H03; H03K; H03K3/00; H03K3/84; G; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/31813; G06; G06F; G06F7/00; G06F7/58; G06F7/582
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
217 words
A cellular automaton which generates pseudorandom data, comprising: a series of cells arranged such that each cell receives signals from first and second electrically adjacent cells; each particular cell in the series of cells having (a) a storage unit for electrically storing a data bit having two distinct states, the storage unit having an output terminal where the current state of the data bit is electrically detectable; and, (b) logic circuitry coupling the storage unit of the particular cell to the storage unit of the first electrically adjacent cell and to the storage unit of the second electrically adjacent cell, the logic circuitry responding to the current state of the data bit stored by the particular cell and the data bits stored by the first and second electrically adjacent cells by changing the value of the data bit stored by the particular cell according to the following relationship a(t+1)=a.sub.first (t)XOR[a(t)ORa.sub.second (t)] where, a(t) represents the current state of the data bit stored by the particular cell, a(t+1) represents the next state of the data bit stored by the particular cell, a first (t) represents the current state of the data bit stored by the first electrically adjacent cell, and a second (t) represents the current state of the data bit stored by the second electrically adjacent cell.
Claim 2
Dependent Claim
217 words
A cellular automaton which generates pseudorandom data, comprising: a series of cells arranged such that each cell receives signals from first and second electrically adjacent cells; each particular cell in the series of cells having (a) a storage unit for electrically storing a data bit having two distinct states, the storage unit having an output terminal where the current state of the data bit is electrically detectable; and, (b) logic circuitry coupling the storage unit of the particular cell to the storage unit of the first electrically adjacent cell and to the storage unit of the second electrically adjacent cell, the logic circuitry responding to the current state of the data bit stored by the particular cell and the data bits stored by the first and second electrically adjacent cells by changing the value of the data bit stored by the particular cell according to the following relationship a(t+1)=a.sub.first (t)XOR[a(t)ORa.sub.second (t)] where, a(t) represents the current state of the data bit stored by the particular cell, a(t+1) represents the next state of the data bit stored by the particular cell, a first (t) represents the current state of the data bit stored by the first electrically adjacent cell, and a second (t) represents the current state of the data bit stored by the second electrically adjacent cell.
Claim 3
Dependent Claim
65 words
A cellular automaton as claimed in claim 1 in which the storage unit of each of the series of cells comprises an input terminal for receiving a input signal having two distinct states, the storage unit changing the state of the stored data bit to conform to the current state of the input signal when a predetermined clock signal is applied to the storage unit.
Claim 4
Dependent Claim
71 words
A cellular automaton as claimed in claim 2 in which the logic circuity of each particular cell receives the output signal produced by the storage unit of the particular cell and the output signals produced by the storage units of the first and second electrically adjacent cells and applies to the input terminal of the storage unit of the particular cell a signal having the value a first (t)XOR[a(t)ORa second (t)].
Claim 5
Dependent Claim
118 words
A cellular automaton as claimed in claim 3 which is selectively switchable between a mode of operation in which the automaton produces the pseudorandom data and a mode of operation in which the automaton functions as a shift register, each of the series of cells comprising: controllable signal gating means for receiving at least the signal generated by the logic circuity of the particular cell and the output signal produced by the storage unit of the first electrically adjacent cell and for selectively applying to the input terminal of the storage unit of the particular cell the signal generated by the logic circuitry of the particular cell or the output signal generated by the first electrically adjacent cell.
Claim 6
Dependent Claim
132 words
A cellular automaton as claimed in claim 3 which is selectively switchable between a mode of operation in while the automaton produces the pseudorandom data and a mode of operation in which the automaton functions as a signal signature analyzer for a binary signal, each of the cells comprising: a data input terminal for receiving individual bits of the binary signal; exclusive OR means for generating a signal corresponding to the exclusive OR of the received data bits and the signal generated by the logic circuitry of the cell; and, controllable signal gating means for selectively applying to the input terminal of the storage unit of the cell the signal generated by the logic circuitry of the cell or the exclusive OR signal generated by the exclusive OR means of the cell.
Claim 7
Dependent Claim
125 words
A cellular automaton as claimed in claim 3 which is selectively switchable between a mode of operation in which the automaton produces the pseudorandom data and a mode of operation in which the automaton functions as a digital latch for storing a multiplicity of data bits, each of the cells comprising: a data input terminal for receiving one of the data bits; controllable signal gating means coupled to the data input terminal of the cell, to the logic circuitry of the cell and to the storage unit of the cell for selectively applying to the input terminal of the storage unit of the cell a signal corresponding to the one of the data bits and the signal generated by the logic circuitry of the cell.
Claim 8
Dependent Claim
220 words
A cellular automaton which generates pseudorandom data, comprising: a series of cells in a ring arrangement such that each cell receives signals from first and second electrically adjacent cells; each particular cell in the series of cells having (a) a storage unit for electrically storing a data bit having two distinct states, the storage unit having an output terminal where the current state of the data bit is electrically detectable; and, (b) logic circuitry coupling the storage unit of the particular cell to the storage unit of the first electrically adjacent cell and to the storage unit of the second electrically adjacent cell, the logic circuitry responding to the current state of the data bit stored by the particular cell and the data bits stored by the first and second electrically adjacent cells by changing the value of the data bit stored by the particular cell according to the following relationship a(t+1)=a.sub.first (t)XOR[a(t)ORa.sub.second (t)] where, a(t) represents the current state of the data bit stored by the particular cell, a(t+1) represents the next state of the data bit stored by the particular cell, a first (t) represents the current state of the data bit stored by the first electrically adjacent cell, and a second (t) represents the current state of the data bit stored by the second electrically adjacent cell.
Claim 9
Dependent Claim
220 words
A cellular automaton which generates pseudorandom data, comprising: a series of cells in a ring arrangement such that each cell receives signals from first and second electrically adjacent cells; each particular cell in the series of cells having (a) a storage unit for electrically storing a data bit having two distinct states, the storage unit having an output terminal where the current state of the data bit is electrically detectable; and, (b) logic circuitry coupling the storage unit of the particular cell to the storage unit of the first electrically adjacent cell and to the storage unit of the second electrically adjacent cell, the logic circuitry responding to the current state of the data bit stored by the particular cell and the data bits stored by the first and second electrically adjacent cells by changing the value of the data bit stored by the particular cell according to the following relationship a(t+1)=a.sub.first (t)XOR[a(t)ORa.sub.second (t)] where, a(t) represents the current state of the data bit stored by the particular cell, a(t+1) represents the next state of the data bit stored by the particular cell, a first (t) represents the current state of the data bit stored by the first electrically adjacent cell, and a second (t) represents the current state of the data bit stored by the second electrically adjacent cell.
Claim 10
Dependent Claim
172 words
An automaton cell cooperating with identical cells to produce a pseudorandom data generating automaton, comprising: a storage unit for electrically storing a data bit having two distinct states, the storage unit having an output terminal where the current state of the data bit is electrically detectable; and, logic circuitry for coupling the storage unit of the automaton cell to the storage unit of a first electrically adjacent identical cell and to the storage unit of a second electrically adjacent identical cell, the logic circuitry changing the value of the data bit stored by the automaton cell according to the following relationship a(t+1)=a.sub.first (t)XOR[a(t)ORa.sub.second (t)] where, a(t) represents the current state of the data bit stored by the automaton cell, a(t+1) represents the next state of the data bit stored by the automaton cell, a first (t) represents the current state of the data bit stored by the first electrically adjacent identical cell, and a second (t) represents the current state of the data bit stored by the second electrically adjacent identical cell.
Claim 11
Dependent Claim
172 words
An automaton cell cooperating with identical cells to produce a pseudorandom data generating automaton, comprising: a storage unit for electrically storing a data bit having two distinct states, the storage unit having an output terminal where the current state of the data bit is electrically detectable; and, logic circuitry for coupling the storage unit of the automaton cell to the storage unit of a first electrically adjacent identical cell and to the storage unit of a second electrically adjacent identical cell, the logic circuitry changing the value of the data bit stored by the automaton cell according to the following relationship a(t+1)=a.sub.first (t)XOR[a(t)ORa.sub.second (t)] where, a(t) represents the current state of the data bit stored by the automaton cell, a(t+1) represents the next state of the data bit stored by the automaton cell, a first (t) represents the current state of the data bit stored by the first electrically adjacent identical cell, and a second (t) represents the current state of the data bit stored by the second electrically adjacent identical 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) | 1992-08-21 | 1993-02-20 | 1993-08-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-08-21 | 1997-02-20 | 1997-08-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-08-21 | 2001-02-20 | 2001-08-22 | $7700.00 | Window Closed / Lapsed |