Patent US2301724A successfully refreshed from Google Patents.
Patent US4108359A successfully refreshed from Google Patents.
US4108359A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for verifying the execution of a sequence of coded instructions
Assignee: United States Department of the Army
•
Filing: 1977-03-30
•
Granted: 1978-08-22
•
Expires: 1997-03-30
Abstract
Abstract Apparatus for detecting errors in the execution of a sequence of coded inuctions. The apparatus includes a feed-back shift register to generate a digital sequence which is combined with the sequence of instructions to be verified to compute a unique sequence checkword. This computed sequence checkword is compared with a stored, predetermined reference sequence checkword. If any errors have occurred in the execution of the sequence of instructions, the computed and the stored sequence checkwords will disagree, resulting in an output which may be used to halt the process or otherwise cause an alarm. It is an advantage of the apparatus, that it may be easily implemented with a minimum number of logic elements to produce a sequence monitoring device that has an extremely high probability of detecting errors.
Inventors
- 👤 Richard C. Proto
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 17:11
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/28; G06F11/22; G06F11/25; G06F11/26; G06F11/27
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
128 words
An apparatus for verifying the execution of an input sequence of coded instruction in the form of i-bit binary words, where i is the number of bits in each binary word, comprising: a sequence check register including an n-stage feedback shift register for generating a binary sequence, where the number of stages, n, of said feedback shift register is greater than i + 1, and means for combining the input sequence of binary words with said binary sequence to compute an n-bit sequence checkword; means for storing a predetermined n-bit reference sequence checkword; and means connected to said sequence check register and said storage means for comparing bit-by-bit said computed sequence checkword with said stored reference checkword and for producing an error signal when the compared checkwords differ.
Claim 2
Independent Claim
128 words
An apparatus for verifying the execution of an input sequence of coded instruction in the form of i-bit binary words, where i is the number of bits in each binary word, comprising: a sequence check register including an n-stage feedback shift register for generating a binary sequence, where the number of stages, n, of said feedback shift register is greater than i + 1, and means for combining the input sequence of binary words with said binary sequence to compute an n-bit sequence checkword; means for storing a predetermined n-bit reference sequence checkword; and means connected to said sequence check register and said storage means for comparing bit-by-bit said computed sequence checkword with said stored reference checkword and for producing an error signal when the compared checkwords differ.
Claim 3
Dependent Claim
28 words
The apparatus of claim 1, further including means for stepping said shift register at least once for each word of said sequence input to said sequence check register.
Claim 4
Dependent Claim
46 words
The apparatus of claim 2 wherein said combining means includes means for modifying the contents of i stages of said shift register in accordance with the bits of each word of said input sequence, prior to shifting said contents to the next succeeding shift register stage.
Claim 5
Dependent Claim
36 words
The apparatus of claim 3 wherein said modifying means comprises MOD 2 adders connected between the output of each of the first i stages of said shift register and the input to the next succeeding stage.
Claim 6
Dependent Claim
47 words
The apparatus of claim 1 wherein said computed checkword is represented by the contents of each of the n stages of said shift register after said shift register is shifted at least N steps, where N is equal to the number of words in said input sequence.
Claim 7
Dependent Claim
44 words
The apparatus of claim 5 wherein said comparing means includes a counter which increases its count by one for each word of said sequence input to said sequence check register and which enables said comparison when said counter reaches a count equal to N.
Claim 8
Dependent Claim
23 words
The apparatus of claim 6 which further includes means for resetting said shift register and said counter prior to inputting said input sequence.
Claim 9
Dependent Claim
31 words
The apparatus of claim 7 wherein said storage means and said counter means are programmable, thereby permitting said apparatus to monitor the execution of different sequences in accordance with said programming.
Claim 10
Dependent Claim
51 words
The apparatus of claim 1 wherein said combining means further comprises means for computing a sequence checkword such that the probability of said computed checkword matching said reference checkword, when said sequence of instructions contains an error, is 1/2 n , where n is the number of bits in each checkword.
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) | 1981-08-21 | 1982-02-20 | 1982-08-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-08-21 | 1986-02-20 | 1986-08-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-08-21 | 1990-02-20 | 1990-08-22 | $7700.00 | Window Closed / Lapsed |