US5113399A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory test methodology
Assignee: Conexant Systems LLC
•
Filing: 1990-04-17
•
Granted: 1992-05-12
•
Expires: 2010-04-17
Abstract
Abstract A MEMORY TEST METHODOLOGY is disclosed. The memory is checkerboarded and divided into blocks, the cells of which are scrambled by a EEPROM. The memory is the assaulted. After each assault, one block (time-test) is tested in alternation with each of the other blocks (space-test) by reading each cell of the clock, comparing it with the checkerboard, and writing the opposite of the checkerboard to the cell. When this process has been completed for all blocks, it is repeated, this time writing the checkerboard to each cell. Failures are noted on a fast capture RAM. This cycle is repeated several times. The data is displayed, and the memory is assaulted again. It is re-checkerboarded immediately before the assault. Errors in the time test block are displayed separately from those in the space-test blocks, and both displays are repeated in the same format after each assault.
Inventors
- 👤 Ralf D. Woods
- 👤 Michael P. Slack
- 👤 Kenneth M. Gerst
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 20:24
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/56; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/319; G01R31/31903; G01R31/31905; G01R31/31917; G01R31/31924
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
216 words
A method for testing a memory, comprising: (a) checkerboarding the memory; (b) assaulting the memory; (c) selecting a cell in a time-test block; (d) reading the bit in a scrambled cell corresponding to said cell; (e) comparing the bit as read with a respective reference bit, and noting any error: (f) writing the opposite of the reference bit to the scrambled cell; (g) repeating steps (c) through (f) until every cell in the time-test block has been subjected to such steps; (h) selecting a cell in a space-test block; (i) reading the bit in a scrambled cell corresponding to said cell; (j) comparing the bit as read with a respective reference bit, and noting any error; (k) writing the opposite of the reference bit to the scrambled cell; (l) repeating steps (c) through (f) until every cell in the space-test block has been subjected to such steps; (m) re-subjecting the cells of the time-test block to steps (c) through (g); (n) selecting a next space-test block; (o) subjecting the cells of said next space-test block to steps (h) through (l); (p) repeating steps (m) through (o) until every space-test block has been subjected to such steps; (q) repeating steps (c) through (p) a plurality of times; (r) repeating steps (a) through (q) a plurality of times.
Claim 2
Independent Claim
216 words
A method for testing a memory, comprising: (a) checkerboarding the memory; (b) assaulting the memory; (c) selecting a cell in a time-test block; (d) reading the bit in a scrambled cell corresponding to said cell; (e) comparing the bit as read with a respective reference bit, and noting any error: (f) writing the opposite of the reference bit to the scrambled cell; (g) repeating steps (c) through (f) until every cell in the time-test block has been subjected to such steps; (h) selecting a cell in a space-test block; (i) reading the bit in a scrambled cell corresponding to said cell; (j) comparing the bit as read with a respective reference bit, and noting any error; (k) writing the opposite of the reference bit to the scrambled cell; (l) repeating steps (c) through (f) until every cell in the space-test block has been subjected to such steps; (m) re-subjecting the cells of the time-test block to steps (c) through (g); (n) selecting a next space-test block; (o) subjecting the cells of said next space-test block to steps (h) through (l); (p) repeating steps (m) through (o) until every space-test block has been subjected to such steps; (q) repeating steps (c) through (p) a plurality of times; (r) repeating steps (a) through (q) a plurality of times.
Claim 3
Dependent Claim
58 words
The method of claim 1, further comprising the step of displaying a token for each failure of a cell in the time-test block, repeated failures of the same cell being displayed by tokens on a same row or column, and concurrent or approximately concurrent failures of different cells being displayed by tokens on a same column or row.
Claim 4
Dependent Claim
22 words
The method of claim 2, further comprising the step of repeatedly displaying, in the same format, the failures induced by repeated assaults.
Claim 5
Dependent Claim
42 words
The method of claim 1, further comprising the step of displaying a token for each failure of a cell, each cell failure being displayed on a row and column which represents a row and column location of the cell in the memory.
Claim 6
Dependent Claim
22 words
The method of claim 4, further comprising the step of repeatedly displaying, in the same format, the failures induced by repeated assaults.
Claim 7
Dependent Claim
94 words
The method of claim 1, further comprising the steps of: (a) displaying a token for each failure of a cell in the time-test block, repeated failures of the same cell being displayed by tokens on a same row or column, and concurrent or approximately concurrent failures of different cells being displayed by tokens on a same column or row; and (b) simultaneously displaying a token for each failure of a cell, each cell failure being displayed on a row and column which represents a row and column location of the cell in the memory.
Claim 8
Dependent Claim
22 words
The method of claim 6, further comprising the step of repeatedly displaying, in the same format, the failures induced by repeated assaults.
Claim 9
Dependent Claim
252 words
Means for testing a memory, comprising: (a) means for checkerboarding the memory; (b) means for assaulting the memory; (c) means for selecting a cell in a time-test block; (d) means for reading the bit in a scrambled cell corresponding to said cell; (e) means for comparing the bit as read with a respective reference bit, and for noting any error; (f) means for writing the opposite of the reference bit to the scrambled cell; (g) means for repeating steps (c) through (f) until every cell in the time-test block has been subjected to such steps; (h) means for selecting a cell in a space-test block, (i) means for reading the bit in a scrambled cell corresponding to said cell; (j) means for comparing the bit as read with a respective reference bit, and noting any error; (k) means for writing the opposite of the reference bit to the scrambled cell; (l) means for repeating steps (c) through (f) until every cell in the space-test block has been subjected to such steps: (m) means for re-subjecting the cells of the time-test block to steps (c) through (g), (n) means for selecting a next space-test block; (o) means for subjecting the cells of said next space-test block to steps (h) through (l), (p) means for repeating steps (m) through (o) until every space-test block has been subjected to such steps; (q) means for repeating steps (c) through (p) a plurality of times; (r) means for repeating steps (a) through (q) a plurality of times.
Claim 10
Dependent Claim
252 words
Means for testing a memory, comprising: (a) means for checkerboarding the memory; (b) means for assaulting the memory; (c) means for selecting a cell in a time-test block; (d) means for reading the bit in a scrambled cell corresponding to said cell; (e) means for comparing the bit as read with a respective reference bit, and for noting any error; (f) means for writing the opposite of the reference bit to the scrambled cell; (g) means for repeating steps (c) through (f) until every cell in the time-test block has been subjected to such steps; (h) means for selecting a cell in a space-test block, (i) means for reading the bit in a scrambled cell corresponding to said cell; (j) means for comparing the bit as read with a respective reference bit, and noting any error; (k) means for writing the opposite of the reference bit to the scrambled cell; (l) means for repeating steps (c) through (f) until every cell in the space-test block has been subjected to such steps: (m) means for re-subjecting the cells of the time-test block to steps (c) through (g), (n) means for selecting a next space-test block; (o) means for subjecting the cells of said next space-test block to steps (h) through (l), (p) means for repeating steps (m) through (o) until every space-test block has been subjected to such steps; (q) means for repeating steps (c) through (p) a plurality of times; (r) means for repeating steps (a) through (q) a plurality of times.
Claim 11
Dependent Claim
57 words
The means of claim 8, further comprising means for displaying a token for each failure of a cell in the time-test block, repeated failures of the same cell being displayed by tokens on a same row or column, and concurrent or approximately concurrent failures of different cells being displayed by tokens on a same column or row.
Claim 12
Dependent Claim
21 words
The means of claim 9, further comprising means for repeatedly displaying, in the same format, the failures induced by repeated assaults.
Claim 13
Dependent Claim
41 words
The means of claim 8, further comprising means for displaying a token for each failure of a cell, each cell failure being displayed on a row and column which represents a row and column location of the cell in the memory.
Claim 14
Dependent Claim
21 words
The means of claim 11, further comprising means for repeatedly displaying, in the same format, the failures induced by repeated assaults.
Claim 15
Dependent Claim
95 words
The means of claim 8, further comprising: (a) means for displaying a token for each failure of a cell in the time-test block, repeated failures of the same cell being displayed by tokens on a same row or column, and concurrent or approximately concurrent failures of different cells being displayed by tokens on a same column or row; and (b) means for simultaneously displaying a token for each failure of a cell, each cell failure being displayed on a row and column which represents a row and column location of the cell in the memory.
Claim 16
Dependent Claim
21 words
The means of claim 13, further comprising means for repeatedly displaying, in the same format, the failures induced by repeated assaults.
References Cited (Backward Citations)
US3579199A
Cited
US3719929A
Cited
US4654849A
Cited
US4654849B1
Cited
US4788684A
Cited
US4819212A
Cited
US4841525A
Cited
US4951254A
Cited
US4958345A
Cited
US4965799A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-05-12 | 1995-11-11 | 1996-05-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-05-12 | 1999-11-11 | 2000-05-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-05-12 | 2003-11-11 | 2004-05-12 | $7700.00 | Window Closed / Lapsed |