US4638481A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for generating sequence of multibit words
Assignee: DIAGNOSYS Ltd
•
Filing: 1984-10-26
•
Granted: 1987-01-20
•
Expires: 2004-10-26
Abstract
Abstract In automatic test equipment the logical levels on certain of the test pins are set to 0 and 1 by corresponding flip-flops included in respective I/O logic circuits. The states of the flip-flops (as well as other factors) are controlled by commands read out of a control RAM which is of sufficient width to provide a 4-bit command on lines for each logic circuit. The available commands include NOP commands and change commands which toggle the states of the corresponding flip-flops. A relatively small number of addresses of the control RAM have change commands entered in correspondence with selected ones of the pins. By repeatedly reading out the commands in these addresses in a non-cyclic sequence it is possible to generate a succession of different states of the flip-flops in the logic, which succession is much longer than the number of addresses of the control RAM which are utilized. Apparatus for establishing the correct addressing sequence is described.
Inventors
- 👤 Michael P. Crane
- 👤 David J. Marsh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 06:39
CPC Classifications
G; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/31712; G01R31/31713; G01R31/3181; G01R31/319; G01R31/31917; G01R31/31919; G01R31/31921
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
142 words
A machine method of generating a sequence of m-bit multibit words selected from a set N of the words, wherein m is an integer, N is a substantially larger integer not exceeding 2 m and the words are formed in succession in a plurality m of bistable devices, the method comprising the steps of: (a) storing a set n of change words each of which consists of a corresponding selection of change commands, where n is a plural integer substantially smaller than n, (b) addressing a sequence of the stored change words where said sequence is larger than n and at least some of said change words appear repeatedly in said sequence, and (c) applying each addressed change word to effect changes of state of selected ones of the bistable devices in accordance with the change commands included in such change word.
Claim 2
Dependent Claim
142 words
A machine method of generating a sequence of m-bit multibit words selected from a set N of the words, wherein m is an integer, N is a substantially larger integer not exceeding 2 m and the words are formed in succession in a plurality m of bistable devices, the method comprising the steps of: (a) storing a set n of change words each of which consists of a corresponding selection of change commands, where n is a plural integer substantially smaller than n, (b) addressing a sequence of the stored change words where said sequence is larger than n and at least some of said change words appear repeatedly in said sequence, and (c) applying each addressed change word to effect changes of state of selected ones of the bistable devices in accordance with the change commands included in such change word.
Claim 3
Dependent Claim
52 words
A method according to claim 1, wherein the read-out addresses of the stored change words are provided by the steps of: (d) continuously clocking a counter, (e) decoding predetermined states of the continuously clocked counter, and (f) generating each of the n change word addresses in response to a corresponding predetermined state.
Claim 4
Dependent Claim
57 words
A method according to claim 2, wherein the counter is a binary counter and the predetermined states are: D0=1, D0·D1=1, D0·D1·D2=1, and so on, where D0 and D0 are the non-inverted and inverted outputs of the least significant counter stage, D1 and D1 are the non-inverted and inverted outputs of the next counter stage, and so on.
Claim 5
Dependent Claim
58 words
A method according to claim 2, wherein the counter is a binary counter and the predetermined states are: D0=0, D0 D1=0, D0·D1·D2=0, and so on, where D0 and D0 are the non-inverted and inverted outputs of the least significant counter stage, D1 and D1 are the non-inverted and inverted outputs of the next counter stage, and so on.
Claim 6
Dependent Claim
47 words
A method according to claim 1, wherein the change words are stored in a group of addresses of a control memory in automatic test equipment as commands located, at each address, in cells of the memory pertaining to a selection of test pins of the said equipment.
Claim 7
Dependent Claim
96 words
Apparatus for generating a sequence of m-bit multibit words, comprising a plurality m of bistable devices, a memory storing a set of change words, each of which consists of a corresponding selection of one or more change commands, means for reading out the change words in a succession in which at least some of the words are read out a plurality of times, and means for applying the change words to the bistable devices so that each said selection of change commands causes the or each device of the corresponding selection of devices to change state.
Claim 8
Dependent Claim
96 words
Apparatus for generating a sequence of m-bit multibit words, comprising a plurality m of bistable devices, a memory storing a set of change words, each of which consists of a corresponding selection of one or more change commands, means for reading out the change words in a succession in which at least some of the words are read out a plurality of times, and means for applying the change words to the bistable devices so that each said selection of change commands causes the or each device of the corresponding selection of devices to change state.
Claim 9
Dependent Claim
52 words
Apparatus according to claim 6, wherein the means for reading out the change words comprise a counter, means for supplying clock pulses to the counter, means for decoding a plurality of predetermined states of the counter, and means for addressing the change words in corresponding with respective ones of the predetermined states.
Claim 10
Dependent Claim
69 words
Apparatus according to claim 7, wherein the counter is a binary counter and the predetermined states are D0=B, D0·D1=B, D0·D1·D2=B, and so on, where D0 and D0 are the non-inverted and inverted outputs of the least significant counter stage, D1 and D1 are the non-inverted and inverted outputs of the next counter stage, and so on, and B is a predetermined one of the binary values 0 and 1.
Claim 11
Dependent Claim
43 words
Automatic test equipment comprising apparatus according to claim 6, and wherein the bistable devices are a selection of such devices employed in the equipment to determine the logical level on corresponding test pins, and the memory is a control memory of the equipment.
References Cited (Backward Citations)
US4045736A
Cited
US3873818A
Cited
US4433414A
Cited
US4538268A
Cited
US4493079A
Cited
US4555663A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-01-19 | 1990-07-21 | 1991-01-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-01-19 | 1994-07-21 | 1995-01-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-01-19 | 1998-07-21 | 1999-01-20 | $7700.00 | Window Closed / Lapsed |