Method and apparatus for repairing memory device

US2018182467A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2018182467-A1
Application numberUS-201715699854-A
CountryUS
Kind codeA1
Filing dateSep 8, 2017
Priority dateDec 26, 2016
Publication dateJun 28, 2018
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method of repairing a memory device may include collecting fail information on fail cells in a multi-block memory, classifying the fail cells into first and second types, and repairing the fail cells in the multi-block memory using one or more of a global spare memory, a local spare memory, and a common spare memory, based on the fail information.

First claim

Opening claim text (preview).

What is claimed is: 1 . A method for repairing a memory device comprising: collecting fail information on fail cells in a multi-block memory, the multi-block memory including a plurality of block memories; classifying the fail cells into first and second types; and repairing the fail cells in the multi-block memory using one or more of a global spare memory, a local spare memory, and a common spare memory, based on the fail information, wherein the repairing of the fail cells of the multi-block memory comprises: preferentially assigning the global spare memory to a first fail cell having the first type in a first block memory and a second fail cell having the second type in a second block memory, when a row address or a column address of the first fail cell coincides with a corresponding address of the second fail cell having the second type in the second block memory; updating the fail information according to the assignment of the global spare memory; and assigning one or both of the local spare memory and the common spare memory to remaining fail cells based on the updated fail information, the remaining fail cells being fail cells to which the global spare memory has not been assigned. 2 . The method of claim 1 , wherein the collecting of the fail information comprises counting a number of fail cells in each of the block memories, and wherein classifying the fail cells into the first and second types comprises determining whether a row address or a column address of the fail cells coincides between the block memories or within a block memory. 3 . The method of claim 1 , wherein the assigning of the global spare memory comprises preferentially selecting the second fail cell in the second block memory over a third fail cell having the second type in a third block memory, the second block memory having a number of fail cells more than the third block memory, when the row address or the column address of the first fail cell in the first block memory coincides with a corresponding address of the third fail cell in the third block memory. 4 . The method of claim 1 , wherein the updating of the fail information comprises converting a third fail cell having the second type in a third block memory into the first type, when the row address or the column address of the first fail cell in the first block memory coincides with a corresponding address of the third fail cell in the third block memory and the third fail cell has different row and column addresses from other fail cells in the third block memory. 5 . The method of claim 1 , wherein the local spare memory is preferentially assigned to fail cells having the second type in a block memory corresponding to the local spare memory. 6 . The method of claim 1 , wherein the common spare memory is preferentially assigned to fail cells in a block memory having a largest number of the remaining fail cells. 7 . The method of claim 1 , wherein the common spare memory is a first common spare memory and the local spare memory is a first local spare memory, the method further comprising switching a second common spare memory disposed adjacent to a third block memory and a fourth block memory into a second local spare memory of the third block memory, when the fail information collection result indicates that the fourth block memory has no fail cell. 8 . The method of claim 1 , wherein classifying the fail cells into the first and second types comprises: comparing an address of a previously input fail cell to an address of a currently input fail cell; classifying the currently input fail cell into the first type when a row address and a column address of the currently input fail cell are different from a row address and a column address of the previously input fail cell; and classifying the currently input fail cell into the second type when the row address of the currently input fail cell coincides with the row address of the previously input fail cell or the column address of the currently input fail cell coincides with the column address of the previously input fail cell. 9 . An apparatus for repairing a memory device, comprising: a global repair module suitable for receiving a signal indicative of global spare memory information and outputting a signal indicative of a global repair solution; a local repair module suitable for receiving a signal indicative of local spare memory information and outputting a signal indicative of a local repair solution; a common repair module suitable for receiving a signal indicative of common spare memory information and outputting a signal indicative of a common repair solution; a final repair module suitable for combining one or more of the global repair solution, the local repair solution, and the common repair solution and outputting a final repair solution; a controller suitable for collecting fail information on fail cells in a multi-block memory, classifying the fail cells into first and second types, controlling the global repair module to preferentially assign a global spare memory to a first fail cell having the first type in a first block memory and a second fail cell having the second type in a second block memory when a row address or a column address of the first fail cell coincides with a corresponding address of the second fail cell having the second type in the second block memory, and controlling the local repair module, the common repair module, and the final repair module to assign one or both of a local spare memory and a common spare memory to remaining fail cells based on a updated fail information, the remaining fail cells being fail cells to which the global spare memory has not been assigned; and a fail update module suitable for updating the fail information on the first and second types of the fail cells in the multi-block memory according to the assignment of the global spare memory. 10 . The apparatus of claim 9 , wherein when the row address or the column address of the first fail cell in the first block memory coincides with a corresponding address of a third fail cell in a third block memory, the controller preferentially selects the second fail cell in the second block memory over the third fail cell in the third block memory, the second block memory having a number of fail cells more than the third block memory. 11 . The apparatus of claim 9 , wherein when the row address or the column address of the first fail cell in the first block memory coincides with a corresponding address of a third fail cell having the second type in a third block memory to which no global spare memory has been assigned and the third fail cell has different row and column addresses from other fail cells in the third block memory, the controller controls the fail update module to convert the second type of the third fail cell into the first type. 12 . The apparatus of claim 9 , wherein the controller controls the local repair module to preferentially assign the local spare memory to fail cells having the second type in a block memory corresponding to the local spare memory. 13 . The apparatus of claim 9 , wherein the controller controls the common repair module to preferentially assign the common spare memory to fail cells in a block memory having a largest number of the remaining fail cells. 14 . The apparatus of claim 9 , wherein the common spare memory is a first common spare memory and the local spare memory is a first local spare memory, and wherein the controller switches a second common spare memory disposed adjacent to a third block memory and a fourth block memory into a second local spare memory of the third blo

Assignees

Inventors

Classifications

  • with substitution of defective spares · CPC title

  • Internal storage of test result, quality data, chip identification, repair information · CPC title

  • G11C29/44Primary

    Indication or identification of errors, e.g. for repair · CPC title

  • with optimized replacement algorithms · CPC title

  • for self repair · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2018182467A1 cover?
A method of repairing a memory device may include collecting fail information on fail cells in a multi-block memory, classifying the fail cells into first and second types, and repairing the fail cells in the multi-block memory using one or more of a global spare memory, a local spare memory, and a common spare memory, based on the fail information.
Who is the assignee on this patent?
Sk Hynix Inc, Univ Yonsei Iacf
What technology area does this patent fall under?
Primary CPC classification G11C29/44. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Jun 28 2018 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).