Patent USRE33461E successfully refreshed from Google Patents.
USRE33461E
Expired / Lapsed
US
⏱️ 0.0 years remaining
Generation and diagnostic verification of complex timing cycles
Assignee: Lockheed Martin Corp
•
Filing: 1989-05-18
•
Granted: 1990-11-27
•
Expires: 2009-05-18
Abstract
Abstract A timing generator and verifier is provided in which a PROM stores the timing constants that are employed by the generator. An address counter, which is driven by a clock timer, cycles through an associated portion of the PROM to provide a sequence of output signals which represent timing for a particular mode. If a different mode is selected, the address counter selects a different sequence of output bits. During Normal mode the address counter operates on a cyclic basis driven by a fixed frequency free running master clock. In Verify mode the address counter is stepped by the Host computer. The outputs of the PROM are coupled through a buffer and logic section, where the outputs may be modified before being coupled to an adder which accumulates a checksum based on the outputs of all of the bits for a particular selected timing. The checksum provided by the adder is compared in a comparator with a stored checksum that indicates whether the correct operation of the complex timing cycle for the selected mode has been verified.
Inventors
- 👤 Katherine A. Splett
- 👤 Steven H. Karban
- 👤 Gerald L. Brown
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 16:19
CPC Classifications
G; G06; G06F; G06F1/00; G06F1/04; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1004
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
179 words
A method of using a device comprising memory means, memory address selection means, summing means, checksum storage means and comparator means to generate and verify complex timing cycles comprising the steps of: storing the timing bits required to generate a plurality of complex timing cycles which comprise a system timing cycle in said memory means, coupling a repetitive sequence of said timing bits .[.from.]. .Iadd.selected by .Iaddend.said memory address selection means .[.to.]. .Iadd.from .Iaddend.said memory means .Iadd.to said summing means.Iaddend., adding the digital logical state values of all of said timing bits of said memory means over a complete timing cycle in said summing means, retrieving a sum from said checksum storage means that represents a bit sum that should be obtained by said summing means if all of said timing bits of said complex timing cycles are produced without error, during a system timing cycle, and comparing the sum retrieved from said checksum storage means and the value obtained by said summing means in said comparative means to determine if said complex timing cycles have been properly generated.
Claim 2
Independent Claim
179 words
A method of using a device comprising memory means, memory address selection means, summing means, checksum storage means and comparator means to generate and verify complex timing cycles comprising the steps of: storing the timing bits required to generate a plurality of complex timing cycles which comprise a system timing cycle in said memory means, coupling a repetitive sequence of said timing bits .[.from.]. .Iadd.selected by .Iaddend.said memory address selection means .[.to.]. .Iadd.from .Iaddend.said memory means .Iadd.to said summing means.Iaddend., adding the digital logical state values of all of said timing bits of said memory means over a complete timing cycle in said summing means, retrieving a sum from said checksum storage means that represents a bit sum that should be obtained by said summing means if all of said timing bits of said complex timing cycles are produced without error, during a system timing cycle, and comparing the sum retrieved from said checksum storage means and the value obtained by said summing means in said comparative means to determine if said complex timing cycles have been properly generated.
Claim 3
Dependent Claim
47 words
A method of using a device as claimed in claim 1 further comprising buffer logic circuit means coupled to said memory means comprising the step of modifying and converting N timing bits received from said memory means to M timing bits, wherein M is greater than N.
Claim 4
Dependent Claim
56 words
A method of using a device as claimed in claim 2 wherein said address selection means comprises a clock means and an address counter coupled to said memory means and to receive signals from said clock means, comprising the step of selecting bits of said memory means in a sequential repetitive order via said address counter.
Claim 5
Dependent Claim
65 words
The method of using a device as claimed in claim 3 wherein said memory means is a programmable read-only memory and said device further comprises a control means and a clock, comprising the steps of operating the clock in a continuous manner when said control means is in a Normal mode and in a stepped manner when said control means is in a Verify mode.
Claim 6
Dependent Claim
60 words
The method of using a device as claimed in claim 4 comprising control means coupled to said memory means, comprising, the steps of selecting a different portion of said memory means for each selected sequence of a plurality of possible selected sequences of said timing bits and obtaining the appropriate sum for said selected sequence from the checksum storage means.
Claim 7
Dependent Claim
56 words
The method of using a device as claimed in claim 5 comprising, the step of inhibiting the passage of error and status flags into said system via said control means to prevent said flags from altering stored data in said memory means or from adversely affecting said device when said device is in said Verify mode.
Claim 8
Dependent Claim
56 words
A method of using a device as claimed in claim 1 wherein said address selection means comprises a clock means and an address counter coupled to said memory means and to receive signals from said clock means, comprising the step of selecting bits of said memory means in a sequential repetitive order via said address counter.
Claim 9
Dependent Claim
65 words
The method of suing a device as claimed in claim 1 wherein said memory means is a programmable read-only memory and said device further comprises a control means and a clock, comprising the steps of operating the clock in a continuous manner when said control means is in a Normal mode and in a stepped manner when said control means is in a Verify mode.
Claim 10
Dependent Claim
60 words
The method of using a device as claimed in claim 1 comprising control means coupled to said memory means, comprising, the steps of selecting a different portion of said memory means for each selected sequence of a plurality of possible selected sequences of said timing bits and obtaining the appropriate sum for said selected sequence from said checksum storage means.
Claim 11
Dependent Claim
56 words
The method of using a device as claimed in claim 8 comprising, the step of inhibiting the passage of error and status flags into said system via said control means to prevent said flags from altering stored data in said memory means or from adversely affecting said device when said device is in said Verify mode.
References Cited (Backward Citations)
US3838264A
Cited
US3806717A
Cited
US3899665A
Cited
US4084262A
Cited
US4326290A
Cited
US4319355A
Cited
US4385385A
Cited
US4531213A
Cited
US4528665A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-11-26 | 1994-05-28 | 1994-11-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-11-26 | 1998-05-28 | 1998-11-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-11-26 | 2002-05-28 | 2002-11-27 | $7700.00 | Window Closed / Lapsed |