US4751656A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for choosing replacement lines in a two dimensionally redundant array
Assignee: International Business Machines Corp
•
Filing: 1986-03-10
•
Granted: 1988-06-14
•
Expires: 2006-03-10
Abstract
Abstract A method of assigning replacement rows and colums in a two dimensionally redundant array in which if the number of failures along a row exceeds the number of remaining redundant columns, then replacing that row with one of the redundant rows. The process is repeated in the opposite direction with the number of remaining redundant rows and columns being properly decremented. The process of reversing directions continues until the above condition is no longer satisfied.
Inventors
- 👤 Dennis R. Conti
- 👤 David R. Dewar
- 👤 Robert Fonseca
- 👤 Robert R. Wood
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 20:56
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/72
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
436 words
A method for assigning redundant lines in a two dimensional array having at least one redundant line in a first direction and at least one redundant line in a second direction perpendicular to said first direction and having a first plurality of original lines in said first direction and a second plurality of original lines in said second direction, the intersections of said original lines in said first and second directions defining elements, comprising the steps of: (a) determing which of said elements are failures; (b) scanning along a selected original line sequentially selected from said original lines in said first direction to determine the number of failures in said selected line; (c) determining if the number of failures in said selected line exceeds the total number of remaining redundant lines in said second direction; if the number of said failures in any said first selected line exceeds the total number of remaining redundant lines in said second direction, then (d) replacing each said exceeding selected line with a redundant line in said first direction, wherein said replacing corrects all of said failures in said replaced line, (e) decrementing the total numberof remaining redundant lines in said first direction, and (f) repeating steps (b) through (e) with an interchange of said first and second directions before step (b); and if steps (b) through (f) do not correct all said failures, then executing following steps (g) through (j): (g) masking all remaining failures in a selected set of a selected number of original lines in a selected one of said two directions and decrementing the number of remaining redundant lines in said selected direction by said selected number, said selected number being initially set to one; (h) determining if all failures not masked in step (g) can be corrected by the remaining redundant lines in said first and second directions by a method comprising the step of comparing the number of failures in an original line in a direction other than said selected direction with the number of remaining redundant lines in said selected direction; (i) if in step (h), it has been determined that all said non-masked failures cannot be corrected, then repeating steps (g) and (h) for another selected set of said selected number of said original lines in said selected direction; and (j) if in steps (g) through (i), it has been determined that all said non-masked failures cannot be fixed, then repeating steps (g) through (i) for said selected number being increased by one until said selected number is greater than the number of remaining original lines in said selected direction containing failures.
Claim 2
Independent Claim
436 words
A method for assigning redundant lines in a two dimensional array having at least one redundant line in a first direction and at least one redundant line in a second direction perpendicular to said first direction and having a first plurality of original lines in said first direction and a second plurality of original lines in said second direction, the intersections of said original lines in said first and second directions defining elements, comprising the steps of: (a) determing which of said elements are failures; (b) scanning along a selected original line sequentially selected from said original lines in said first direction to determine the number of failures in said selected line; (c) determining if the number of failures in said selected line exceeds the total number of remaining redundant lines in said second direction; if the number of said failures in any said first selected line exceeds the total number of remaining redundant lines in said second direction, then (d) replacing each said exceeding selected line with a redundant line in said first direction, wherein said replacing corrects all of said failures in said replaced line, (e) decrementing the total numberof remaining redundant lines in said first direction, and (f) repeating steps (b) through (e) with an interchange of said first and second directions before step (b); and if steps (b) through (f) do not correct all said failures, then executing following steps (g) through (j): (g) masking all remaining failures in a selected set of a selected number of original lines in a selected one of said two directions and decrementing the number of remaining redundant lines in said selected direction by said selected number, said selected number being initially set to one; (h) determining if all failures not masked in step (g) can be corrected by the remaining redundant lines in said first and second directions by a method comprising the step of comparing the number of failures in an original line in a direction other than said selected direction with the number of remaining redundant lines in said selected direction; (i) if in step (h), it has been determined that all said non-masked failures cannot be corrected, then repeating steps (g) and (h) for another selected set of said selected number of said original lines in said selected direction; and (j) if in steps (g) through (i), it has been determined that all said non-masked failures cannot be fixed, then repeating steps (g) through (i) for said selected number being increased by one until said selected number is greater than the number of remaining original lines in said selected direction containing failures.
Claim 3
Dependent Claim
35 words
A method as recited in claim 1, further comprising the step of: comparing a total number of failures with the maximum number of failures fixable by said redundant lines in said first and second directions.
Claim 4
Dependent Claim
78 words
A method as recited in claim 1, wherein following the operation of step (f) the number of original lines in said first direction containing failures and not replaced in step (d) is compared with the product of the number of remaining redundant lines in said first direction times the sum of one plus the number of the remaining redundant lines in said second direction to determine if there are an excessive number of failures remaining to be corrected.
Claim 5
Dependent Claim
19 words
A method as recited in claim 1, further comprising the steps performed following the operation of step (f) of:
Claim 6
Dependent Claim
51 words
A method as recited in claim 1, wherein in step (g) if the remaining number of redundant lines in one direction is less than the remaining number of redundant lines in another direction, then said selected direction is said one direction in which said less remaining number of redundant lines extend.
References Cited (Backward Citations)
US4460999A
Cited
US4460997A
Cited
US4422161A
Cited
US4459685A
Cited
US4656610A
Cited
US4627053A
Cited
US4628509A
Cited
US4586178A
Cited
US4639915A
Cited
US4648075A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-06-14 | 1991-12-14 | 1992-06-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-06-14 | 1995-12-14 | 1996-06-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-06-14 | 1999-12-14 | 2000-06-14 | $7700.00 | Window Closed / Lapsed |