US5469443A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for testing random access memory
Assignee: Fujitsu Ltd
•
Filing: 1993-10-01
•
Granted: 1995-11-21
•
Expires: 2013-10-01
Abstract
Abstract A memory is tested by subjecting the memory to three phases of testing. In the first phase, a first address in the memory is initialized by writing an initial set of data to the address. Then data is read from the address just written to and this data is modified to produce a set of modified data. The modified data is then written to another address in the memory. The steps of reading, modifying, and writing modified data back to the memory are repeated until all addresses in the memory have been written to. Thereafter, the data values stored in the memory are compared to a reference list of data values to determine whether the memory contains a defect. In phase two, the steps of phase one are repeated except that the first address in the memory is initialized by writing a set of data which is the complement of the initial set of data used in phase one. Phase two, in effect, complements the contents of each address in the memory to ensure that each cell in the memory is written with both a 0 and a 1. At the end of phase two, the data values stored in the memory are again compared to a list of reference data values to determine whether the memory contains a fault. In phase three, an address in the memory is first selected. Data is then read from the selected address and modified to produce a set of modified data. The modified data is written back to the selected address. The steps of reading, modifying, and writing modified data back to the selected address are repeated a selected number of times. Thereafter, another address in the memory is selected and the process described above is repeated. After all of the addresses in the memory have been selected, the data values stored in the memory are once again compared to a reference list of data values. Using the three-phase test described above, all stuck-at, address uniqueness, address coupling, and bit coupling (within a storage location) faults in the memory are provoked and detected.
Inventors
- 👤 Nirmal Saxena
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 16:50
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/04; G11C29/08; G11C29/10
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
115 words
For a memory having a plurality of storage locations, each storage location having a unique address, a method for testing said memory for defects, comprising the steps of: (a) writing an initial set of data to a particular address in said memory; (b) reading a set of stored data from the address just written to; (c) modifying the stored data to produce a set of modified data; (d) writing the modified data to another address in said memory; (e) repeating steps (b) through (d) until all addresses in said memory have been written to; and (f) comparing data values stored in said memory with reference data values to determine whether said memory contains any defects.
Claim 2
Dependent Claim
115 words
For a memory having a plurality of storage locations, each storage location having a unique address, a method for testing said memory for defects, comprising the steps of: (a) writing an initial set of data to a particular address in said memory; (b) reading a set of stored data from the address just written to; (c) modifying the stored data to produce a set of modified data; (d) writing the modified data to another address in said memory; (e) repeating steps (b) through (d) until all addresses in said memory have been written to; and (f) comparing data values stored in said memory with reference data values to determine whether said memory contains any defects.
Claim 3
Dependent Claim
72 words
The method of claim 1, wherein the step of modifying the stored data comprises the step of: processing the stored data through a data modifier to produce a set of modified data, said data modifier having a property that, if the stored dater does not contain an error, said data modifier will produce a set of modified data which is distinct from any set of modified data previously written into said memory.
Claim 4
Dependent Claim
111 words
The method of claim 2, further comprising the steps of: (g) writing a complementary set of data, which represents the complement of said initial set of data, to said particular address in said memory; (h) reading a set of saved data from the address just written to; (i) modifying the saved data to produce a set of altered data; (j) writing the altered data to another address in said memory; (k) repeating steps (h) through (j) until all addresses in said memory have been written to; and (l) comparing data values stored in said memory with a second set of reference data values to determine whether said memory contains any defects.
Claim 5
Dependent Claim
73 words
The method of claim 3, wherein the step of modifying the saved data comprises the step of: processing the saved data through said data modifier to produce a set of altered data, said data modifier having a further property that, if the saved data does not contain an error, said data modifier will produce a set of altered data which is distinct from any set of altered data previously written into said memory.
Claim 6
Dependent Claim
215 words
For a memory having a plurality of storage locations, each storage location having a unique address, an apparatus for testing said memory for defects, comprising: a data modifier having a modifier input coupled to a data output of the memory, and a modifier output coupled to a data input of the memory, said data modifier receiving stored data from the data output of said memory, and processing said stored data to produce a set of modified data at said modifier output; a controller for controlling operation of said memory, said controller causing an initial set of data to be written to a particular address in said memory, said controller further causing said memory to output a set of stored data from the address just written to, and to store the modified data received from said modifier output into another address, said controller continuing to cause said memory to output a set of stored data from the address just written to, and to store the modified data received from said modifier output into another address, until all addresses in said memory have been written to; and a comparator coupled to the data output of the memory for comparing data values stored in said memory with reference data values to determine whether said memory contains any defects.
Claim 7
Dependent Claim
215 words
For a memory having a plurality of storage locations, each storage location having a unique address, an apparatus for testing said memory for defects, comprising: a data modifier having a modifier input coupled to a data output of the memory, and a modifier output coupled to a data input of the memory, said data modifier receiving stored data from the data output of said memory, and processing said stored data to produce a set of modified data at said modifier output; a controller for controlling operation of said memory, said controller causing an initial set of data to be written to a particular address in said memory, said controller further causing said memory to output a set of stored data from the address just written to, and to store the modified data received from said modifier output into another address, said controller continuing to cause said memory to output a set of stored data from the address just written to, and to store the modified data received from said modifier output into another address, until all addresses in said memory have been written to; and a comparator coupled to the data output of the memory for comparing data values stored in said memory with reference data values to determine whether said memory contains any defects.
Claim 8
Dependent Claim
51 words
The apparatus of claim 5, wherein said data modifier has a property that, if the stored data received at said modifier input does not contain an error, said data modifier will produce a set of modified data which is distinct from any set of modified data previously written into said memory.
Claim 9
Dependent Claim
111 words
The apparatus of claim 6, wherein said controller further causes a complementary set of data, representing the complement of said initial set of data, to be written into said particular address, said controller further causing said memory to output a set of stored data from the address just written to, and to store the modified data received from said modifier output into another address, said controller continuing to cause said memory to output a set of stored data from the address just written to, and to store the modified data received from said modifier output into another address, until all addresses in said memory have been written to a second time.
Claim 10
Dependent Claim
46 words
The apparatus of claim 7, wherein said comparator, after all locations in said memory have been written to at least two times, further compares data values stored in said memory with a second set of reference data values to determine whether said memory contains any defects.
Claim 11
Dependent Claim
68 words
The apparatus of claim 8, wherein said data modifier has the following additional property: given said initial set of data as input, said data modifier generates a first sequence of data values; given said complementary set of data as input, said data modifier generates a second sequence of data values; and the data values in said second sequence are complementary to the data values in said first sequence.
Claim 12
Dependent Claim
68 words
The apparatus of claim 6, wherein said data modifier receives eighteen bits of data, denoted as D[18:1], at said modifier input, and provides eighteen bits of modified data, denoted as MD[18:1], at said modifier output, and wherein said data modifier derives said modified data MD[18:1] as follows: MD[i]=D[i-] for all i, except; MD[8]=D[7] D[18] MCTL; where denotes an exclusive-OR (XOR) operation and MCTL denotes a complementary control signal.
Claim 13
Dependent Claim
76 words
The apparatus of claim 6, wherein said data modifier receives forty-four bits of data, denoted as D[44:1], at said modifier input, and provides forty-four bits of modified data, denoted as MD[44:1], at said modifier output, and wherein said data modifier derives said modified data MD[44:1 ]as follows: MD[i]=D[i-1] for all i, except; MD[28]=D27] D[44] MCTL; MD[27]=D[26] D[44] MCTL; MD[2]=D D[1] D[44]D MCTL; MD[1]=MD[44]; where denotes an exclusive-OR (XOR) operation and MCTL denotes a complementary control signal.
Claim 14
Dependent Claim
75 words
The apparatus of claim 6, wherein said data modifier receives fifty-six bits of data, denoted as D[56:1], at said modifier input, and provides fifty-six bits of modified data, denoted as MD[56:1], at said modifier output, and wherein said data modifier derives said modified data MD[56:1], as follows: MD[i]=D[i-1] for all i, except; MD[23]=D[22] D[56] MCTL; MD[22]=D[21] D[56] MCTL; MD[2]=D[1] D[56] MCTL; MD[1]=MD[56]; where denotes an exclusive-OR (XOR) operation and MCTL denotes a complementary control signal.
Claim 15
Dependent Claim
75 words
The apparatus of claim 6, wherein said data modifier receives sixty-four bits of data, denoted as D[64:1], at said modifier input, and provides sixty-four bits of modified data, denoted as MD[64:1], at said modifier output, and wherein said data modifier derives said modified data MD[64:1] as follows: MD[i]=D[i-1] for all i, except; MD[5]=D[4] D[64] MCTL; MD[4]=D[3] D[64] MCTL; MD[2]=D[1] D[64] MCTL; MD[1]=MD[64]; where denotes an exclusive-OR (XOR) operation and MCTL denotes a complementary control signal.
Claim 16
Dependent Claim
75 words
The apparatus of claim 6, wherein said data modifier receives seventy-two bits of data, denoted as D[72:1], at said modifier input, and provides seventy-two bits of modified data, denoted as MD[72:1], at said modifier output, and wherein said data modifier derives said modified data MD[72:1] as follows: MD[i]=D[i-1] for all i, except; MD[54]=D[53] D[72] MCTL; MD[48]=D[47] D[72] MCTL; MD[7]=D[6] D[72] MCTL; MD[1]=MD[72]; where denotes an exclusive-OR (XOR) operation and MCTL denotes a complementary control signal.
Claim 17
Dependent Claim
340 words
For a memory having a plurality of storage locations, each storage location having a unique address, a method for testing said memory for defects, comprising the steps of: (a) writing an initial set of data to a particular address in said memory; (b) reading a set of stored data from the address just written to; (c) processing the stored data through a data modifier to produce a set of modified data, said data modifier having a property that, if the stored data does not contain an error, said data modifier will produce a set of modified data which is distinct from any set of modified data previously stored into said memory; (d) writing said modified data into another address in said memory; (e) repeating steps (b) through (d) until all addresses in said memory have been written to, thereby allowing said data modifier to generate a sequence of modified data values; (f) comparing data values stored in said memory with reference data values to determine whether said memory contains any defects; (g) writing a complementary set of data, representing the complement of said initial set of data, to said particular address in said memory; (h) reading a set of saved data from the address just written to; (i) processing the saved data through said data modifier to produce a set of altered data; (j) writing the altered data to another address in said memory; (k) repeating steps (h) through (j) until all addresses in said memory have been written to a second time, thereby allowing said data modifier to generate a sequence of altered data values; and (l) comparing data values stored in said memory with a second set of reference data values to determine whether said memory contains any defects; wherein said data modifier has the additional property that, if the stored data and the saved data do not contain any errors, then the altered data values in said sequence of altered data values will be complementary to the modified data values in said sequence of modified data values.
Claim 18
Dependent Claim
340 words
For a memory having a plurality of storage locations, each storage location having a unique address, a method for testing said memory for defects, comprising the steps of: (a) writing an initial set of data to a particular address in said memory; (b) reading a set of stored data from the address just written to; (c) processing the stored data through a data modifier to produce a set of modified data, said data modifier having a property that, if the stored data does not contain an error, said data modifier will produce a set of modified data which is distinct from any set of modified data previously stored into said memory; (d) writing said modified data into another address in said memory; (e) repeating steps (b) through (d) until all addresses in said memory have been written to, thereby allowing said data modifier to generate a sequence of modified data values; (f) comparing data values stored in said memory with reference data values to determine whether said memory contains any defects; (g) writing a complementary set of data, representing the complement of said initial set of data, to said particular address in said memory; (h) reading a set of saved data from the address just written to; (i) processing the saved data through said data modifier to produce a set of altered data; (j) writing the altered data to another address in said memory; (k) repeating steps (h) through (j) until all addresses in said memory have been written to a second time, thereby allowing said data modifier to generate a sequence of altered data values; and (l) comparing data values stored in said memory with a second set of reference data values to determine whether said memory contains any defects; wherein said data modifier has the additional property that, if the stored data and the saved data do not contain any errors, then the altered data values in said sequence of altered data values will be complementary to the modified data values in said sequence of modified data values.
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) | 1998-11-20 | 1999-05-22 | 1999-11-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-11-20 | 2003-05-22 | 2003-11-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-11-20 | 2007-05-22 | 2007-11-21 | $7700.00 | Window Closed / Lapsed |