US4061908A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of and device for testing a digital memory
Assignee: Digital Equipment Corp
•
Filing: 1975-12-23
•
Granted: 1977-12-06
•
Expires: 1995-12-23
Abstract
Abstract The invention provides a compact test sequence for testing integrated memories. First, all storage positions are filled with the bit "0". Subsequently, in a given order of the addresses, the "0" bit written for each address is read; immmediately thereafter a "1" bit is written in those bit positions. The positions are again tested by reading the "1" bits. When the last address of the predetermined order is reached, the "1" is read in the same order for each address. Subsequently a "0" is written, which is finally tested by reading again. When the last address is reached, all addresses are read in the reverse order, and a "1" is written, which is tested again. When the first address is reached, all addresses are read, filled with a "0" and tested. This process may be repeated as many times as there are bits in the address. The significance of the address bits are modified to form the predetermined order, for example, by cyclic rotation. For example, in the first cycle the order may be the normal order of successive addresses, while in the second cycle first all "even" and then all "odd" addresses are treated.
Inventors
- 👤 Jan Hendrik DE Jonge
- 👤 Adrianus Josephus Smulders
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 04:40
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/04; G11C29/08; G11C29/12; G11C29/18; G11C29/02; G11C29/10; G11C29/56
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
183 words
A method of testing memories, in which a predetermined first number of discrete, random addressable, storage positions for binary information is provided with each storage position having a specific address, said first number being at least substantially equal to 2 N and the addresses containing N binary information elements of successive significance in accordance with a first order, comprising the steps of filling the storage positions first with a first information, subsequently reading the storage positions during a first cycle in accordance with a first address sequence for the purpose of testing in that the address is each time changed by one unit, subsequently filling the addressed storage positions with changed information with respect to the read-out, reading the storage positions again for the purpose of testing in accordance with the reverse of the first address sequence, and filling again said storage positions with changed information with respect to the latter read-out, repeating said first cycle during a second cycle, the storage positions being assigned a different sequence in that the order of significance of the said N binary information element is modified.
Claim 2
Independent Claim
183 words
A method of testing memories, in which a predetermined first number of discrete, random addressable, storage positions for binary information is provided with each storage position having a specific address, said first number being at least substantially equal to 2 N and the addresses containing N binary information elements of successive significance in accordance with a first order, comprising the steps of filling the storage positions first with a first information, subsequently reading the storage positions during a first cycle in accordance with a first address sequence for the purpose of testing in that the address is each time changed by one unit, subsequently filling the addressed storage positions with changed information with respect to the read-out, reading the storage positions again for the purpose of testing in accordance with the reverse of the first address sequence, and filling again said storage positions with changed information with respect to the latter read-out, repeating said first cycle during a second cycle, the storage positions being assigned a different sequence in that the order of significance of the said N binary information element is modified.
Claim 3
Dependent Claim
29 words
A method as claimed in claim 1, further comprising the step, after each write operation, the information written is immediately read without address modification for the purpose of testing
Claim 4
Dependent Claim
22 words
A method as claimed in claim 1 wherein the order of significance of the said N binary information elements is cyclically rotated.
Claim 5
Dependent Claim
42 words
A method as claimed in claimed in claim 3, further comprising the step of repeating said second cycle N-2 times, in each of the N cycles thus executed another one of the said N binary information elements being assigned the lowest significance.
Claim 6
Dependent Claim
49 words
A method as claimed in claim 1 further comprisingt the step of repeating each read-write-read sequence to be executed without address modification within a cycle as many times for each address as there are storage elements in the storage positions, each time a different storage element thus being tested.
Claim 7
Dependent Claim
44 words
A method as claimed in claim 5, wherein each time the storage elements of the same order within the storage positions are successively subjected to the said read-write-read sequence, with the exclusion of storage elements of a different rank within the said storage positions.
Claim 8
Dependent Claim
23 words
A method as claimed in claim 1, wherein prior to said first cycle, all discrete storage positions are filled with the same information.
Claim 9
Dependent Claim
59 words
A method as claimed in claim 1, wherein each of said cycles comprises four subcycles, in each subcycle the storage elements to be tested are read in accordance with an address sequence then prevailing or in accordance with the opposite sequence inverse thereto thereof, respectively, the storage elements subsequently being filled with information modified with respect to the read-out.
Claim 10
Independent Claim
50 words
A device for testing digital memories comprising a read enable device, a write enable device, and an information testing device, and an address counter which supplies, under the control of a last position of a just completed counting cycle, exclusively inverted address signals for a predetermined number of subsequent cycles.
Claim 11
Independent Claim
50 words
A device for testing digital memories comprising a read enable device, a write enable device, and an information testing device, and an address counter which supplies, under the control of a last position of a just completed counting cycle, exclusively inverted address signals for a predetermined number of subsequent cycles.
Claim 12
Dependent Claim
36 words
A device as claimed in claim 9 further comprising a clock pulse generator, and a significance determining device, for selectively controlling a single binary counting position of said address counter as being the least significant position.
Claim 13
Dependent Claim
33 words
A device as claimed in claim 9 further comprising a dynamic output address inverter for supplying an inverted output address signal before and after a write enable signal during a predetermined time interval.
References Cited (Backward Citations)
US3869603A
Cited
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 |