US4715034A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of and system for fast functional testing of random access memories
Assignee: Fluke Corp
•
Filing: 1985-03-04
•
Granted: 1987-12-22
•
Expires: 2005-03-04
Abstract
Abstract Random bits are written successively into the cells of a random access memory (RAM) system, then complemented, through a first sequence of cell addresses distributed substantially uniformly throughout all the cells of the memory. Through an opposite address sequence, the contents of the cells are read and then complemented. Finally, through the initial sequence of cell addresses, the contents of the cells are again read. Differences between read and expected cell contents identify memory cell faults. The random bits preferably are generated by a softward implemented, reversible pseudorandom sequence generator, and the uniform address sequence is generated by an address hasher programmed with an address function that exercises all address lines essentially equally.
Inventors
- 👤 David M. Jacobson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 16:02
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/04; G11C29/08; G11C29/10; G11C29/12; G11C29/36
Claims Analysis
Total Claims: 31
Claim 1
Independent Claim
107 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of writing a random sequence of bits successively into the cells through a first sequence of cell addresses; through a second sequence of cell addresses reading and then complementing the contents of the cell; through a third sequence of cell addresses opposite the second sequence reading the contents of the cells; and comparing contents read from the cells with expected contents of the cells addressed in the second and third address sequences, respectively, to detect differences, and in response, identifying memory faults.
Claim 2
Independent Claim
107 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of writing a random sequence of bits successively into the cells through a first sequence of cell addresses; through a second sequence of cell addresses reading and then complementing the contents of the cell; through a third sequence of cell addresses opposite the second sequence reading the contents of the cells; and comparing contents read from the cells with expected contents of the cells addressed in the second and third address sequences, respectively, to detect differences, and in response, identifying memory faults.
Claim 3
Dependent Claim
21 words
The method of claim 1, including the step of addressing said memory cells using a uniformly spread sequence of cell addresses.
Claim 4
Dependent Claim
42 words
The method of claim 1, including generating reversible pseudorandom bit sequences, wherein said step of writing includes writing using a forward pseudorandom bit sequence, and the step of comparing includes comparing contents read from said cells with a reverse pseudorandom bit sequence.
Claim 5
Independent Claim
118 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of writing a random sequence of bits, then their complements, successively into the cells through a first sequence of cell addresses; through a second sequence of cell addresses opposite the first sequence reading the contents of the cells and then complementing the contents; through a third sequence of cell addresses opposite the first sequence, reading the contents of the cells; and comparing the contents read from said cells with expected contents of the cells addressed in the second and third address sequences, respectively, to detect differences, and in response, identifying any memory faults.
Claim 6
Independent Claim
118 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of writing a random sequence of bits, then their complements, successively into the cells through a first sequence of cell addresses; through a second sequence of cell addresses opposite the first sequence reading the contents of the cells and then complementing the contents; through a third sequence of cell addresses opposite the first sequence, reading the contents of the cells; and comparing the contents read from said cells with expected contents of the cells addressed in the second and third address sequences, respectively, to detect differences, and in response, identifying any memory faults.
Claim 7
Dependent Claim
21 words
The method of claim 4, including the step of addressing said memory cells using a uniformly spread sequence of cell addresses.
Claim 8
Dependent Claim
42 words
The method of claim 4, including generating reversible pseudorandom bit sequences, wherein said step of writing includes writing using a forward pseudorandom bit sequence, and the step of comparing includes comparing contents read from said cells with a reverse pseudorandom bit sequence.
Claim 9
Independent Claim
128 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of (a) writing a random sequence of bits successively into the cells, then complementing the bits, through a first sequence of cell addresses; (b) through a second sequence of cell addresses opposite the first sequence reading the contents of the cells, then complementing the contents; (c) through the first sequence of cell addresses writing said random bits successively into the cells and then reading said cells; (d) comparing contents read from the cells in steps (b) and (c) with random bits expected to be read from those cells in the second and first address sequences, respectively, and, in response, identifying any memory faults.
Claim 10
Independent Claim
128 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of (a) writing a random sequence of bits successively into the cells, then complementing the bits, through a first sequence of cell addresses; (b) through a second sequence of cell addresses opposite the first sequence reading the contents of the cells, then complementing the contents; (c) through the first sequence of cell addresses writing said random bits successively into the cells and then reading said cells; (d) comparing contents read from the cells in steps (b) and (c) with random bits expected to be read from those cells in the second and first address sequences, respectively, and, in response, identifying any memory faults.
Claim 11
Dependent Claim
21 words
The method of claim 7, including the step of addressing said memory cells using a uniformly spread sequence of cell addresses.
Claim 12
Dependent Claim
42 words
The method of claim 7, including generating reversible pseudorandom bit sequences, wherein said step of writing includes writing using a forward pseudorandom bit sequence, and the step of comparing includes comparing contents read from said cells with a reverse pseudorandom bit sequence.
Claim 13
Independent Claim
111 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of generating a random sequence of bits, writing the random sequence of bits successively into the cells through a first sequence of cell addresses substantially uniformly spread using "golden ratio" spreading of addresses of said cells, reading contents of the cells through a second sequence of cell addresses different from the first address sequence but containing all the addresses of the first address sequence, comparing the read contents with expected contents of the cells in the second address sequence and, in response, identifying any memory faults.
Claim 14
Independent Claim
111 words
A method of fault testing a random access memory system having a plurality of memory cells, each cell being nominally uniquely addressable, comprising the steps of generating a random sequence of bits, writing the random sequence of bits successively into the cells through a first sequence of cell addresses substantially uniformly spread using "golden ratio" spreading of addresses of said cells, reading contents of the cells through a second sequence of cell addresses different from the first address sequence but containing all the addresses of the first address sequence, comparing the read contents with expected contents of the cells in the second address sequence and, in response, identifying any memory faults.
Claim 15
Dependent Claim
16 words
The method of claim 10, wherein said sequence of random bits comprises a pseudorandom bit sequence.
Claim 16
Dependent Claim
27 words
The method of claim 11, wherein said pseudorandom bit sequence is reversible and said expected contents of said cells are derived from the reverse pseudorandom bit sequence.
Claim 17
Dependent Claim
26 words
The method of claim 11, including the step of controlling said sequence of pseudorandom bits using a "seed", and repeating said method using a different seed.
Claim 18
Dependent Claim
138 words
Apparatus for fault testing a random access memory system having a plurality of memory cells, each being nominally uniquely addressable, comprising: reversible pseudorandom bit generation means for generating a reversible pseudorandom bit sequence; means for addressing the cells of said memory through selectively first and second address sequences; means for writing said psuedorandom bit sequence into said memory through said first address sequence; means for reading the contents of said memory through said second address sequence while controlling said pseudorandom bit generation means to generate said pseudorandom bit sequence in reverse, and for comparing said contents read with expected contents of cells in said second address sequence obtained from said pseudorandom bit sequence in reverse to detect any differences; means responsive to differences detected by said comparing means for identifying memory faults; and means for indicating said faults.
Claim 19
Dependent Claim
138 words
Apparatus for fault testing a random access memory system having a plurality of memory cells, each being nominally uniquely addressable, comprising: reversible pseudorandom bit generation means for generating a reversible pseudorandom bit sequence; means for addressing the cells of said memory through selectively first and second address sequences; means for writing said psuedorandom bit sequence into said memory through said first address sequence; means for reading the contents of said memory through said second address sequence while controlling said pseudorandom bit generation means to generate said pseudorandom bit sequence in reverse, and for comparing said contents read with expected contents of cells in said second address sequence obtained from said pseudorandom bit sequence in reverse to detect any differences; means responsive to differences detected by said comparing means for identifying memory faults; and means for indicating said faults.
Claim 20
Dependent Claim
13 words
The apparatus of claim 14, wherein said indicating means includes a visual display.
Claim 21
Dependent Claim
14 words
The apparatus of claim 14, wherein said generating means comprises a pseudorandom bit generator.
Claim 22
Dependent Claim
20 words
The apparatus of claim 14, wherein said addressing means includes means for generating a substantially uniform sequence of cell addresses.
Claim 23
Dependent Claim
144 words
Apparatus for fault testing a random access memory system having an array of memory cells, comprising: means for generating a random sequence of bits; means for addressing cells of said array with selectively first and second address sequences; processor means for (1) writing said random sequence of bits successively into the cells and then complementing the bits through said first address sequence; (2) through the second sequence of cell addresses reading the contents of said cells and comparing said contents with expected contents of the cells in said second address sequence to detect differences, then complementing the contents; (3) through said first sequence of addresses reading contents of said cells and comparing said contents with expected contents of the cells in said first address sequence to detect differences; and (4) in response to said differences identifying memory faults; and means for indicating said faults.
Claim 24
Dependent Claim
144 words
Apparatus for fault testing a random access memory system having an array of memory cells, comprising: means for generating a random sequence of bits; means for addressing cells of said array with selectively first and second address sequences; processor means for (1) writing said random sequence of bits successively into the cells and then complementing the bits through said first address sequence; (2) through the second sequence of cell addresses reading the contents of said cells and comparing said contents with expected contents of the cells in said second address sequence to detect differences, then complementing the contents; (3) through said first sequence of addresses reading contents of said cells and comparing said contents with expected contents of the cells in said first address sequence to detect differences; and (4) in response to said differences identifying memory faults; and means for indicating said faults.
Claim 25
Dependent Claim
13 words
The apparatus of claim 18 wherein said indicating means includes a visual display.
Claim 26
Dependent Claim
14 words
The apparatus of claim 18, wherein said generating means comprises a pseudorandom bit generator.
Claim 27
Dependent Claim
20 words
The apparatus of claim 18, wherein said addressing means includes means for generating a substantially uniform sequence of cell addresses.
Claim 28
Dependent Claim
43 words
The apparatus of claim 18, wherein said generating means comprises means for generating reversible pseudorandom bit sequences, and said processor means includes means for deriving said expected contents of said cells from a reverse pseudorandom sequence of bits generated by said generating means.
Claim 29
Dependent Claim
93 words
Apparatus for fault testing a random access memory system having a plurality of memory cells, each cell nominally being uniquely addressable, comprising: means for generating a pseudorandom bit sequence; means for generating selectively first and second substantially uniform sequences of cell addresses; means for writing said random bit sequence into said cells through said first address sequence; means for reading the contents of said cells through said second address sequence and for comparing said contents read with said pseudorandom bit sequence; and means responsive to said comparing means for indicating any memory faults.
Claim 30
Dependent Claim
93 words
Apparatus for fault testing a random access memory system having a plurality of memory cells, each cell nominally being uniquely addressable, comprising: means for generating a pseudorandom bit sequence; means for generating selectively first and second substantially uniform sequences of cell addresses; means for writing said random bit sequence into said cells through said first address sequence; means for reading the contents of said cells through said second address sequence and for comparing said contents read with said pseudorandom bit sequence; and means responsive to said comparing means for indicating any memory faults.
Claim 31
Dependent Claim
16 words
The apparatus of claim 23, including means for controlling a "seed" of said pseudorandom bit sequence.
References Cited (Backward Citations)
US3579199A
Cited
US3719929A
Cited
GB1363786A
Cited
US3924181A
Cited
US4061908A
Cited
GB2001178A
Cited
GB2028517A
Cited
US4195770A
Cited
GB2047413A
Cited
US4414665A
Cited
US4380068A
Cited
US4342084A
Cited
US4429389A
Cited
US4442519A
Cited
EP0108255A1
Cited
EP0108256A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-12-21 | 1991-06-22 | 1991-12-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-12-21 | 1995-06-22 | 1995-12-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-12-21 | 1999-06-22 | 1999-12-22 | $7700.00 | Window Closed / Lapsed |