Patent US5954435A successfully refreshed from Google Patents.
US5954435A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory apparatus and data processor using the same
Assignee: Renesas Electronics Corp
•
Filing: 1996-12-13
•
Granted: 1999-09-21
•
Expires: 2016-12-13
Abstract
Abstract A memory apparatus and a data processor using the same comprises, a memory mechanism, having a signal input terminal into which a predetermined signal is inputted, a memory unit consisting of first, second and third memories, a fourth memory and a control unit which replaces the first or second memory with the third memory by switching electrical connections between the memories of the memory unit according to information written into the fourth memory, and furthermore, an operation unit which diagnoses failures in the memory mechanism in case the predetermined signal is inputted from the signal input terminal, in case the failure is diagnosed in the first memory allows the control unit to replace the first memory with the third memory by writing a first value into the fourth memory, and in case the failure is diagnosed in the second memory allows the control unit to replace the second memory with the third memory by writing a second value into the fourth memory. Since the failure in the memory array unit can be relieved, manufacturing yields of the memory apparatus and the data processor including the same are improved.
Inventors
- 👤 Toyohiko Yoshida
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 07:29
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/04; G11C29/08; G11C29/12; G11C29/18; G11C29/24; G11C29/70
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
220 words
In a data processing system including a memory unit having a plurality of memory cells arranged in a plurality of rows and a plurality of columns, a spare row of memory cells, a spare column of memory cells, a row decoder for accessing said plurality of memory cells by row, and a plurality of access control bits coupled to said row decoder, each for controlling access to a corresponding one of said plurality of rows, a method for automatically testing and repairing said memory unit comprising the steps of: (a) testing said memory unit to determine whether said memory unit includes at least one defective memory cell; (b) repairing said memory unit when said memory unit includes said at least one defective memory cell, wherein said step of repairing produces a modified memory unit and includes the steps of: (1) calculating a number of defective cells for each of said plurality of columns in said memory unit containing said at least one defective memory cell; (2) comparing the number of defective cells in one column with the number of defective cells in the other columns; (3) selecting the column in which the number of defective cells is more than that in another column as a column for replacement; and (4) substituting said spare column for said selected column for replacement.
Claim 2
Dependent Claim
220 words
In a data processing system including a memory unit having a plurality of memory cells arranged in a plurality of rows and a plurality of columns, a spare row of memory cells, a spare column of memory cells, a row decoder for accessing said plurality of memory cells by row, and a plurality of access control bits coupled to said row decoder, each for controlling access to a corresponding one of said plurality of rows, a method for automatically testing and repairing said memory unit comprising the steps of: (a) testing said memory unit to determine whether said memory unit includes at least one defective memory cell; (b) repairing said memory unit when said memory unit includes said at least one defective memory cell, wherein said step of repairing produces a modified memory unit and includes the steps of: (1) calculating a number of defective cells for each of said plurality of columns in said memory unit containing said at least one defective memory cell; (2) comparing the number of defective cells in one column with the number of defective cells in the other columns; (3) selecting the column in which the number of defective cells is more than that in another column as a column for replacement; and (4) substituting said spare column for said selected column for replacement.
Claim 3
Dependent Claim
150 words
The method of claim 1, further comprising the steps of: (c) testing, in an order, each of said plurality of rows of said modified memory unit to determine whether said modified memory unit includes said at least one defective memory cell; (d) repairing said modified memory unit when said modified memory unit includes said at least one defective memory cell, said step of repairing said modified memory unit including the steps of: (1) deasserting a corresponding one of said plurality of access control bits for each one of said plurality of rows that contains said at least one defective memory cell; (2) calculating a number of defective cells of each of said plurality of rows of said modified memory unit containing a defective memory cell; (3) selecting a row for replacement in said modified memory unit according to a criteria; (4) substituting said spare row for said row for replacement.
Claim 4
Dependent Claim
26 words
The method of claim 2, wherein said row for replacement is a last row in said order that contains said at least one defective memory cell.
Claim 5
Dependent Claim
100 words
The method of claim 1, wherein said step of testing said memory unit comprises: i) writing a predetermined value in each memory cell of said memory unit; ii) reading one of said plurality of rows of said memory unit to produce an output; and iii) comparing each bit of said output to said predetermined value to determine whether said one of said plurality of rows includes said at least one defective memory cell; iv) repeating steps ii) and iii) for each of said plurality of rows until all of said plurality of rows of said memory unit have been tested.
Claim 6
Dependent Claim
68 words
The method of claim 4, wherein said step of calculating said number of defective cells comprises the steps of: 1) recording, for each of said plurality of rows of said memory unit, a column number corresponding to said at least one defective memory cell in said one of said plurality of rows of said memory unit; and 2) counting each incidence of said column number being so recorded.
Claim 7
Dependent Claim
41 words
The method of claim 1, wherein said step of substituting said spare column for said column for replacement includes the steps of: de-coupling a data line coupled to said column for replacement; and coupling said data line to said spare column.
Claim 8
Dependent Claim
213 words
In a data processing system including a memory unit having a plurality of memory cells arranged in a plurality of rows and a plurality of columns, a spare row of memory cells, a spare column of memory cells, a row decoder for accessing said plurality of memory cells by row, and a plurality of access control bits coupled to said row decoder, each for controlling access to a corresponding one of said plurality of rows, a method for automatically testing and repairing said memory unit comprising the steps of: (a) testing said memory unit to determine whether said memory unit includes at least one defective memory cell; (b) repairing said memory unit when said memory unit includes said at least one defective memory cell, wherein said step of repairing produces a modified memory unit and includes the steps of: (1) calculating a number of defective cells for each of said plurality of columns in said memory unit containing said at least one defective memory cell; (2) selecting a column for replacement in said memory unit according to said number of defective cells, wherein said column for replacement is a column in said memory unit having a greatest number of defective cells; and (3) substituting said spare column for said selected column for replacement.
Claim 9
Dependent Claim
213 words
In a data processing system including a memory unit having a plurality of memory cells arranged in a plurality of rows and a plurality of columns, a spare row of memory cells, a spare column of memory cells, a row decoder for accessing said plurality of memory cells by row, and a plurality of access control bits coupled to said row decoder, each for controlling access to a corresponding one of said plurality of rows, a method for automatically testing and repairing said memory unit comprising the steps of: (a) testing said memory unit to determine whether said memory unit includes at least one defective memory cell; (b) repairing said memory unit when said memory unit includes said at least one defective memory cell, wherein said step of repairing produces a modified memory unit and includes the steps of: (1) calculating a number of defective cells for each of said plurality of columns in said memory unit containing said at least one defective memory cell; (2) selecting a column for replacement in said memory unit according to said number of defective cells, wherein said column for replacement is a column in said memory unit having a greatest number of defective cells; and (3) substituting said spare column for said selected column for replacement.
Claim 10
Dependent Claim
149 words
The method of claim 7, further comprising the steps of: (c) testing, in an order, each of said plurality of rows of said modified memory unit to determine whether said modified memory unit includes at least one defective memory cell; (d) repairing said modified memory unit when said modified memory unit includes said at least one defective memory cell, said step of repairing said modified memory unit including the steps of: (1) deasserting a corresponding one of said plurality of access control bits for each one of said plurality of rows that contains said at least one defective memory cell; (2) calculating a number of defective cells for each of said plurality of rows of said modified memory unit containing a defective memory cell; (3) selecting a row for replacement in said modified memory unit according to a criteria; (4) substituting said spare row for said row for replacement.
Claim 11
Dependent Claim
25 words
The method of claim 8, wherein said row for replacement is a last row in said order that contains said at least one memory cell.
Claim 12
Dependent Claim
100 words
The method of claim 7, wherein said step of testing said memory unit comprises: i) writing a predetermined value in each memory cell of said memory unit; ii) reading one of said plurality of rows of said memory unit to produce an output; and iii) comparing each bit of said output to said predetermined value to determine whether said one of said plurality of rows includes said at least one defective memory cell; iv) repeating steps ii) and iii) for each of said plurality of rows until all of said plurality of rows of said memory unit have been tested.
Claim 13
Dependent Claim
68 words
The method of claim 10, wherein said step of calculating said number of defective cells comprises the steps of: 1) recording, for each of said plurality of rows of said memory unit, a column number corresponding to said at least one defective memory cell in said one of said plurality of rows of said memory unit; and 2) counting each incidence of said column number being so recorded.
Claim 14
Dependent Claim
43 words
The method of claim 7, wherein said step of substituting said spare column for said selected column for replacement includes the steps of: de-coupling a data line coupled to said selected column for replacement; and coupling said data line to said spare column.
References Cited (Backward Citations)
US4414665A
Cited
US4736373A
Cited
JPS59127286A
Cited
US4584681A
Cited
US4639915A
Cited
US4648075A
Cited
US4733394A
Cited
US4827452A
Cited
JPS6238599A
Cited
US4757474A
Cited
JPS62250599A
Cited
JPH01177656A
Cited
US5157664A
Cited
JPH03160698A
Cited
JPH03160697A
Cited
JPH03160696A
Cited
JPH03162798A
Cited
US5206831A
Cited
US5231604A
Cited
US5278839A
Cited
US5293386A
Cited
US5146429A
Cited
US5267242A
Cited
US5353253A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-09-20 | 2003-03-22 | 2003-09-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-09-20 | 2007-03-22 | 2007-09-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-09-20 | 2011-03-22 | 2011-09-21 | $7700.00 | Window Closed / Lapsed |