← Back to Patent Explorer
US5222067A Expired / Lapsed US ⏱️ 0.0 years remaining

Detection of pattern-sensitive faults in RAM by use of M-sequencers

Assignee: Terenix Co Ltd
•
Filing: 1990-03-08
•
Granted: 1993-06-22
•
Expires: 2010-03-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The detection method for Pattern Sensitive Faults by use of M-sequencies includes the steps of clearing the entire memory arrays, reading the memory arrays, and checking if the memory cells are cleared, filling the properly selected group with two or three kinds of M-sequencies whose phases are different from each other, reading and checking the memory of the neighboring cells for the correct content, and repeating the above steps by shifting the element of each M-sequence and by changing the position of the above groups of memory cells.

Inventors

  • 👤 Kashiwagi Hiroshi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 12:03
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/04; G11C29/08; G11C29/10

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 221 words
A detection method for pattern sensitive faults by use of maximum length sequences comprising the steps of: clearing a memory array; reading the memory array; checking if all memory cells of the memory array are cleared; filling a first row of the memory array with M o (=a o , a 1 , . . . ) of a fifth order maximum length sequence, a second array row with a maximum length sequence M L (=a L ,a L+1 , . . . ), a third array row with maximum length sequence (=a 2L ,a 2L+1 , . . . ), all remaining array rows n with maximum length sequences M nL (=a nL , a nL+1 , . . . ), where L and n are integers, determining a theoretical delay L between the rows in order for all patterns from 0000 to 1111 to appear in neighboring cells, the neighboring cells being defined as four neighboring cells around a base cell; reading and checking the content of each cell for the correct content such that the above steps constitute one phase; shifting the input sequences M o , M L , M 2L , . . . M nL one bit to the left in the memory array and repeating the above steps until all phase steps are completed.
Claim 2
Dependent Claim 221 words
A detection method for pattern sensitive faults by use of maximum length sequences comprising the steps of: clearing a memory array; reading the memory array; checking if all memory cells of the memory array are cleared; filling a first row of the memory array with M o (=a o , a 1 , . . . ) of a fifth order maximum length sequence, a second array row with a maximum length sequence M L (=a L ,a L+1 , . . . ), a third array row with maximum length sequence (=a 2L ,a 2L+1 , . . . ), all remaining array rows n with maximum length sequences M nL (=a nL , a nL+1 , . . . ), where L and n are integers, determining a theoretical delay L between the rows in order for all patterns from 0000 to 1111 to appear in neighboring cells, the neighboring cells being defined as four neighboring cells around a base cell; reading and checking the content of each cell for the correct content such that the above steps constitute one phase; shifting the input sequences M o , M L , M 2L , . . . M nL one bit to the left in the memory array and repeating the above steps until all phase steps are completed.
Claim 3
Dependent Claim 192 words
A detection method for pattern sensitive faults by use of maximum length sequences, comprising the steps of: clearing a memory array; reading the memory array; checking if all memory cells of the memory array are cleared; tiling the memory cells into a group A and a group B in order for adjacent neighboring cells to be in groups A and B, writing "1" into the B cells; reading the B cells for "1", writing a fourth order maximum length sequence M o , M L , M 2L , . . . MnL where L and N are integers into the A cells of each row with appropriate lag between consecutive rows in order for all patterns from 0000 to 1111 to appear in neighboring cells; reading and checking the B cells to determine if the B cells are "1" such that the above steps constitute one phase; shifting the row sequence one bit to the left and repeating the above steps until all phases are completed; writing "0" into the B cells and repeating the above steps and changing the roles of groups A and B and repeating the above steps.
Claim 4
Dependent Claim 192 words
A detection method for pattern sensitive faults by use of maximum length sequences, comprising the steps of: clearing a memory array; reading the memory array; checking if all memory cells of the memory array are cleared; tiling the memory cells into a group A and a group B in order for adjacent neighboring cells to be in groups A and B, writing "1" into the B cells; reading the B cells for "1", writing a fourth order maximum length sequence M o , M L , M 2L , . . . MnL where L and N are integers into the A cells of each row with appropriate lag between consecutive rows in order for all patterns from 0000 to 1111 to appear in neighboring cells; reading and checking the B cells to determine if the B cells are "1" such that the above steps constitute one phase; shifting the row sequence one bit to the left and repeating the above steps until all phases are completed; writing "0" into the B cells and repeating the above steps and changing the roles of groups A and B and repeating the above steps.
Claim 5
Dependent Claim 195 words
A detection method for pattern sensitive faults by use of maximum length sequences, comprising the steps of: clearing a memory array; reading the memory array; checking if all memory cells of the memory array are cleared; tiling memory cells into a group A and a group B; writing "1" into the B cells of even and odd rows; writing a fourth order maximum length sequence M E into the A cells of even rows and a fourth order maximum length sequence M o into the A cells of the odd rows, wherein a lag between the sequence M E and M o is theoretically chosen beforehand in order for all patterns from 0000 to 1111 to appear in four neighboring cells around a base cell; reading the B cells and checking the B cells for "1" such that the above steps relate to one pattern; shifting the sequences M E and M o one bit to the left and repeating the above steps until all patterns are completed; writing "0" into the B cells and repeating the above steps; and changing the roles of the group A and B cells and repeating the above steps.
Claim 6
Dependent Claim 195 words
A detection method for pattern sensitive faults by use of maximum length sequences, comprising the steps of: clearing a memory array; reading the memory array; checking if all memory cells of the memory array are cleared; tiling memory cells into a group A and a group B; writing "1" into the B cells of even and odd rows; writing a fourth order maximum length sequence M E into the A cells of even rows and a fourth order maximum length sequence M o into the A cells of the odd rows, wherein a lag between the sequence M E and M o is theoretically chosen beforehand in order for all patterns from 0000 to 1111 to appear in four neighboring cells around a base cell; reading the B cells and checking the B cells for "1" such that the above steps relate to one pattern; shifting the sequences M E and M o one bit to the left and repeating the above steps until all patterns are completed; writing "0" into the B cells and repeating the above steps; and changing the roles of the group A and B cells and repeating the above steps.

References Cited (Backward Citations)

US4369511A Cited
US4757503A Cited
US4715034A Cited
US4730318A Cited
US4885748A Cited
US4852096A Cited
US4873705A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-06-21 1996-12-21 1997-06-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-06-21 2000-12-21 2001-06-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-06-21 2004-12-21 2005-06-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag