US20070162786A1 - Repair of memory hard failures during normal operation, using ecc and a hard fail identifier circuit - Google Patents

Repair of memory hard failures during normal operation, using ecc and a hard fail identifier circuit Download PDF

Info

Publication number
US20070162786A1
US20070162786A1 US11/275,464 US27546406A US2007162786A1 US 20070162786 A1 US20070162786 A1 US 20070162786A1 US 27546406 A US27546406 A US 27546406A US 2007162786 A1 US2007162786 A1 US 2007162786A1
Authority
US
United States
Prior art keywords
circuit
location
repair
bit
fail
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US11/275,464
Other versions
US7386771B2 (en
Inventor
Stephen Shuma
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US11/275,464 priority Critical patent/US7386771B2/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SHUMA, STEPHEN GERARD
Publication of US20070162786A1 publication Critical patent/US20070162786A1/en
Priority to US12/105,338 priority patent/US7689881B2/en
Application granted granted Critical
Publication of US7386771B2 publication Critical patent/US7386771B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1008Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices

Definitions

  • the present invention relates to memory hard failure repair, and more specifically, to hard failure repair during normal operation using an ECC (Error Correction Code) circuit and a hard fail identifier circuit.
  • ECC Error Correction Code
  • Prior art exists which covers detection and repair of hard failures in a memory device during the manufacturing process (i.e., at time zero).
  • Prior art also exists which covers detection and correction of soft errors in a memory device during normal operation (e.g., Error Correction Code).
  • Prior art also exists which covers memory error detection and address disable or device replacement during normal operation. There is a need for a subsystem (and a method for operating the same) in which hard failures are detected and repaired during normal operation of a memory device.
  • the present invention provides a memory sub-system, comprising (a) a main memory; (b) an ECC (Error Correction Code) circuit electrically coupled to the main memory; and (c) a hard fail identifier circuit electrically coupled to the ECC circuit, wherein the ECC circuit is capable of detecting a first bit fail at a first bit location at a first location address of the main memory, wherein the ECC circuit is further capable of sending an error flag signal to notify the hard fail identifier circuit about the first bit fail, wherein the ECC circuit is further capable of sending the first location address of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of sending the first bit location of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of repairing data from the first location address and sending the repaired data to the hard fail identifier circuit, wherein the hard fail identifier circuit is capable of, in response to the error flag signal being sent, determining and tracking the number of times of failure occurring at the first
  • the present invention provides a memory sub-system operation method, comprising providing a memory sub-system which includes (a) a main memory, (b) an ECC (Error Correction Code) circuit electrically coupled to the main memory, and (c) a hard fail identifier circuit electrically coupled to the ECC circuit; in response to a first bit fail at a first bit location and at a first location address of the main memory occurring, using the ECC circuit to send an error flag signal to the hard fail identifier circuit; in response to the first bit fail occurring, using the ECC circuit to further send the first location address of the first bit fail to the hard fail identifier circuit; in response to the first bit fail occurring, using the ECC circuit to further send the first bit location of the first bit fail to the hard fail identifier circuit; in response to the first bit fail occurring, using the ECC circuit to further send the first bit location of the first bit fail to the hard fail identifier circuit; in response to the first bit fail occurring, using the ECC circuit to further repair data from the first location address and send the repaired
  • the present invention provides a memory sub-system, comprising (a) a main memory; (b) an ECC (Error Correction Code) circuit electrically coupled to the main memory; (c) a hard fail identifier circuit electrically coupled to the ECC circuit; (d) a repair circuit electrically coupled to the hard fail identifier circuit; (e) a redundant memory electrically coupled to the main memory and the repair circuit; and (f) a threshold setting circuit electrically coupled to the hard fail identifier circuit, wherein the ECC circuit is capable of detecting a first bit fail at a first bit location at a first location address of the main memory, wherein the ECC circuit is further capable of sending an error flag signal to notify the hard fail identifier circuit about the first bit fail, wherein the ECC circuit is further capable of sending the first location address of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of sending the first bit location of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of sending
  • the present invention provides a novel memory sub-system (and a method for operating the same) in which hard failures in a memory device are detected and repaired during the normal operation of the memory device.
  • FIG. 1 illustrates a block diagram of a memory sub-system, in accordance with embodiments of the present invention.
  • FIG. 2 shows one embodiment of the hard fail identifier circuit of the memory sub-system of FIG. 1 , in accordance with embodiments of the present invention.
  • FIG. 3 shows a flowchart that illustrates a method for operating the memory sub-system of FIG. 1 , in accordance with embodiments of the present invention.
  • FIG. 4 illustrates another memory sub-system as one embodiment of the memory sub-system of FIG. 1 , in accordance with embodiments of the present invention.
  • FIG. 1 illustrates a block diagram of a memory sub-system 100 , in accordance with embodiments of the present invention.
  • the memory sub-system 100 comprises a main memory 110 , an ECC (Error Correction Code) circuit 112 , a redundant memory 114 , a hard fail identifier circuit 120 , a repair circuit 130 , and a threshold setting circuit 140 .
  • the hard fail identifier circuit 120 receives an error flag signal 112 a , a word address signal 112 b , a bit location signal 112 c , and a repaired data signal 112 d from the ECC circuit 112 .
  • the hard fail identifier circuit 120 also receives a threshold count signal 140 a from the threshold setting circuit 140 .
  • the repair circuit 130 receives a threshold reached signal 120 b , a word address signal 120 c , and a repaired data signal 120 a from the hard fail identifier circuit 120 .
  • the repair circuit 130 sends a repaired data signal 130 a and a write repaired data signal 130 b to the redundant memory 114 .
  • the repair circuit 130 sends a no repair location available signal 130 c to indicate that there are no more redundant memory locations in the redundant memory 114 that can be used to replace a defective main memory location in the main memory 110 .
  • FIG. 2 shows one embodiment of the hard fail identifier circuit 120 of FIG. 1 , in accordance with embodiments of the present invention.
  • the hard fail identifier circuit 120 comprises a compare circuit 124 , a control circuit 122 , an entry allocation circuit 128 , and a failure stack 126 .
  • the compare circuit 124 receives the error flag signal 112 a , the word address signal 112 b , and the bit location signal 112 c from the ECC circuit 112 of FIG. 1 . In one embodiment, the compare circuit 124 also receives an all address entry signal 126 d and an all bit location entry signal 126 e from the failure stack 126 . Illustratively, the compare circuit 124 also sends a hit signal 124 b and an entry location signal 124 a to the control circuit 122 . In one embodiment, the compare circuit 124 also sends a miss signal 124 c to the entry allocation circuit 128 .
  • control circuit 122 receives the hit signal 124 b and the entry location signal 124 a from the compare circuit 124 . In one embodiment, the control circuit 122 also receives the repaired data signal 112 d and the threshold count signal 140 a from the ECC circuit 112 and the threshold setting circuit 140 , respectively, of FIG. 1 . In one embodiment, the control circuit 122 receives a fail count signal 126 b from the failure stack 126 . Illustratively, the control circuit 122 also receives a word address signal 126 a from the failure stack 126 and forwards the word address signal 126 a to the repair circuit 130 of FIG. 1 as the word address signal 120 c .
  • control circuit 122 sends an increment fail count signal 122 a , a remove entry signal 122 b , an update age signal 122 c , and an entry location signal 122 d to the failure stack 126 .
  • control circuit 122 also sends the threshold reached signal 120 b and the repaired data signal 120 a to the repair circuit 130 of FIG.
  • the entry allocation circuit 128 receives the miss signal 124 c from the compare circuit 124 . In one embodiment, the entry allocation circuit 128 also receives an all use bit entry signal 126 c , an all fail count entry signal 126 f , and an all age entry signal 126 g from the failure stack 126 . Illustratively, the entry allocation circuit 128 also sends an entry location signal 128 a to the failure stack 126 . It should be noted that the word address signal 112 b , the bit location signal 112 c (from the ECC circuit 112 of FIG. 1 ) and the entry location signal 128 a (from the entry allocation circuit 128 ) can be collectively refer to as a set update signal 128 b.
  • the failure stack 126 comprises multiple entries (like entries 226 a , 226 b , and 226 c ). Although the failure stack 126 has many entries, only the three entries 226 a , 226 b , and 226 c of the failure stack 126 are shown in FIG. 2 .
  • the entry 226 a comprises a use bit 226 a 1 , an address field 226 a 2 , a bit location field 226 a 3 , a fail count field 226 a 4 , and an age field 226 a 5 .
  • the use bit 226 a 1 indicates whether the entry 226 a is available or unavailable; the address field 226 a 2 stores address of the fail wordline; and the bit location field 226 a 3 indicates the location of a bit fail in the fail wordline.
  • the fail count field 226 a 4 indicates the number of failure occurrences at an address and at a bit location of the wordline.
  • the age field 226 a 5 indicates the time period during which the bit fail entry has been stored or the fail count 226 a 4 incremented in the entry 226 a of the failure stack 126 .
  • the entry 226 b comprises a use bit 226 b 1 , an address field 226 b 2 , a bit location field 226 b 3 , a fail count field 226 b 4 , and an age field 226 b 5 .
  • the use bit 226 b 1 , the address field 226 b 2 , the bit location field 226 b 3 , the fail count field 226 b 4 , and the age field 226 b 5 has the same function as the use bit 226 a 1 , the address field 226 a 2 , the bit location field 226 a 3 , the fail count field 226 a 4 , and the age field 226 a 5 , respectively.
  • the other entries of the failure stack 126 comprise components similar to those of the entry 226 a.
  • FIG. 3 shows a flowchart that illustrates a method 300 for operating the memory sub-system 100 of FIG. 1 , in accordance with embodiments of the present invention.
  • the method 300 starts with a step 305 in which the main memory 110 is in normal operation.
  • the ECC circuit 112 of FIG. 1 detects whether a bit fail occurs in the main memory 110 during the normal operation of the main memory 110 .
  • the ECC circuit 112 detects a first bit fail at a first bit location of a first word address in the main memory 110 .
  • a step 315 is performed in which the ECC circuit 112 notifies the first bit fail to the hard fail identifier circuit 120 .
  • the ECC circuit 112 sends the error flag signal 112 a to notify the hard fail identifier circuit 120 about the first bit fail.
  • the ECC circuit 112 also sends the first word address of the first bit fail to the hard fail identifier circuit 120 as the word address signal 112 b .
  • the ECC circuit 112 also sends the first bit location of the first bit fail to the hard fail identifier circuit 120 as the bit location signal 112 c .
  • the ECC circuit 112 also repairs the data from the first word address, and then sends the repaired data to the hard fail identifier circuit 120 as the repaired data signal 112 d.
  • the compare circuit 124 determines whether the first bit fail is in the failure stack 126 . More specifically, in one embodiment, by comparing the all address entry signal 126 d and the word address signal 112 b , and, if an address match is found, by comparing the matching bit location field out of the all bit location entry signal 126 e and the bit location signal 112 c , the compare circuit 124 can determine whether the first bit fail is already in the failure stack 126 . Assume that the failure stack 126 is currently empty. In other words, the first bit fail is not already in the failure stack 126 . As a result, a step 330 b is performed in which the first bit fail is stored in an entry of the failure stack 126 selected by the entry allocation circuit 128 .
  • the compare circuit 124 in response to the compare circuit 124 of FIG. 2 determining that the first bit fail is not already in the failure stack 126 , the compare circuit 124 sends the miss signal 124 c to notify the entry allocation circuit 128 that the first bit fail is not in the failure stack 126 .
  • the entry allocation circuit 128 examines the all use bit entry signal 126 c and determines that all entries of the failure stack 126 are available (because the failure stack 126 is empty, and therefore all use bits of all entries are 0). In response, the entry allocation circuit 128 selects an entry in the failure stack 126 via the entry location signal 128 a .
  • the first bit fail is stored in that selected entry. Assume that the entry 226 a is selected for storing the first bit fail. As a result, the use bit 226 a 1 of the entry 226 a is set to 1 to indicate the entry 226 a becomes unavailable. Also, the address field 226 a 2 stores the first word address 112 b ; the bit location field 226 a 3 stores the first bit fail location 112 c ; and the fail count field 226 a 4 is set to 1.
  • step 370 the age fields of all unavailable entries (i.e., entries whose use bits are 1) in the failure stack 126 are updated. More specifically, the age fields of all unavailable entries are edited to show which entry was updated most recent, which was updated next most recent, etc. As a result, the age field 226 a 5 of the entry 226 a edited to indicate that entry 226 a was most recently updated.
  • steps 310 , 315 , 320 , 330 b , and 370 are performed simultaneously with the normal operation of the main memory 110 (step 305 ).
  • the ECC circuit 112 of FIG. 1 detects the first bit fail and notifies to the hard fail identifier circuit 120 of FIG. 1 .
  • the hard fail identifier circuit 120 of FIG. 1 stores the first bit fail into the entry 226 a of the failure stack 126 .
  • the ECC circuit 112 of FIG. 1 detects a second bit fail at a second bit location of a second word address in the main memory 110 .
  • the ECC circuit 112 notifies the hard fail identifier circuit 120 about the second bit fail in a manner similar to the manner in which the ECC circuit 112 notifies the hard fail identifier circuit 120 about the first bit fail.
  • the hard fail identifier circuit 120 of FIG. 1 stores the second bit fail into an available entry of the failure stack 126 .
  • the entry 226 b is selected to store the second bit fail.
  • the hard fail identifier circuit 120 stores the second bit fail the entry 226 b in a manner similar to the manner in which the hard fail identifier circuit 120 stores the first bit fail in the entry 226 a.
  • the ECC circuit 112 of FIG. 1 detects a third bit fail at a third bit location of a third word address in the main memory 110 .
  • the ECC circuit 112 notifies the hard fail identifier circuit 120 about the third bit fail in a manner similar to the manner in which the ECC circuit 112 notifies the hard fail identifier circuit 120 about the first and the second bit fails.
  • the third word address is the same as the first word address
  • the third bit location is the same as the first bit location.
  • the third bit fail is already in the failure stack 126 . More specifically, the third bit fail is already stored in the entry 226 a . As a result, the step 330 a is performed.
  • the fail count field of the entry 226 a is increased by 1 to become 2 to indicate that two failures have occurred at the first bit location of the first word address. More specifically, in response to the compare circuit 124 determining that the third bit fail is already in the failure stack 126 , the compare circuit 124 sends the hit signal 124 b to notify the control circuit 122 . In one embodiment, the compare circuit 124 also provides the control circuit 122 with the entry location of the first and the third bit fail (i.e., the entry 226 a ) via the entry location signal 124 a .
  • control circuit 122 sends the increment fail count signal 122 a and entry location signal 122 d (from the signal 124 a ) to cause the failure stack 126 to increment the value of the fail count field 226 a 4 of the entry 226 a by 1.
  • the value of the fail count field 226 a 4 of the entry 226 a becomes 2 indicating that two failures have occurred at the first word address and at the first bit location.
  • the control circuit 122 determines whether the fail count field 226 a 4 of the first bit fail is equal to a predetermined threshold value that was provided previously by the threshold setting circuit 140 of FIG. 1 via the threshold count signal 140 a . More specifically, the control circuit 122 compares the value of the fail count field 226 a 4 that comes via the fail count signal 126 b with the predetermined threshold value that comes via the threshold count signal 140 a . Assume that the predetermined threshold value is 3. As a result, the value of the fail count field 226 a 4 of the entry 226 a , which is 2, is less than the predetermined threshold value which is 3, and therefore the step 370 is performed.
  • the age fields of all unavailable entries in the failure stack 126 are edited to show which entry was updated most recent, which was updated next most recent, etc.
  • the age field 226 a 5 of the entry 226 a and the age field 226 b 5 of the entry 226 b are edited to indicate that entry 226 a was most recently updated, and entry 226 b was next most recently updated.
  • steps 310 , 315 , 320 , 330 a , 340 a and 370 are performed simultaneously with the normal operation of the main memory 110 (step 305 ).
  • the repair circuit 130 determines whether there is an available redundant memory location in the redundant memory 114 . In response to the repair circuit 130 determining that there is an available redundant memory location in the redundant memory 114 , the repair circuit 130 selects the available redundant location of the redundant memory 114 and re-routes the defective main memory 110 first word address to the selected redundant memory 114 location address. It should be noted that a main memory 110 location that causes failure a number of times equal to the predetermined threshold value is considered defective and needs to be replaced by an available redundant location of the redundant memory 114 . Next, the repair circuit 130 sends the repaired data signal 130 a and a write repaired data signal 130 b to the redundant memory 114 .
  • the control circuit 122 also forwards the repaired data from the first word address (the repaired data signal 112 d ) from the ECC circuit 112 of FIG. 1 to the repair circuit 130 (via the repaired data signal 120 a ).
  • the repair circuit 130 determines that there is the available redundant memory location in the redundant memory 114 and selects the available location of the redundant memory 114 to replace a defective main memory location of the main memory 110 at the first word address.
  • the repair circuit 130 re-directs the address to point to the selected location of the redundant memory 114 ( FIG. 1 ).
  • the repair circuit 130 sends the repaired data signal 130 a and a write repaired data signal 130 b to the redundant memory 114 . This causes the repaired data 130 a to be written into the selected location in the redundant memory 114 and enables normal operation to continue.
  • the repair of the defective main memory location of the main memory 110 at the first word address can be a hard repair of a soft repair.
  • a hard repair can be defined as a repair that remains in effect even if the power to the memory sub-system is cut off.
  • a soft repair can be defined as a repair that disappears if the power to the memory sub-system is cut off.
  • the first bit fail is removed from the failure stack 126 . More specifically, in one embodiment, the control circuit 122 sends the remove entry signal 122 b and entry location signal 122 d (from the signal 124 a ) to notify the failure stack 126 that the first bit fail needs to be removed from the entry 226 a . In response to the remove entry signal 122 b being sent, the failure stack 126 resets the use bit 226 a 1 of the entry 226 a to 0 to indicate that the entry 226 a is again available.
  • steps 310 , 315 , 320 , 330 a , 340 a , 350 a , 360 a and 370 are performed simultaneously with the normal operation of the main memory 110 (step 305 ).
  • the entry allocation circuit 128 finds that there is no available entry in the failure stack 126 to store the second bit fail. More specifically, the entry allocation circuit 128 examines the all use bit entry signal 126 c and determines that there is no available entry in the failure stack 126 to store the second bit fail. If so, in one embodiment, the entry allocation circuit 128 can select an unavailable entry of the failure stack 126 to store the second bit fail. In one embodiment, the entry allocation circuit 128 can select an unavailable entry whose fail count field stores the lowest value.
  • the entry allocation circuit 128 determines the unavailable entry whose fail count field is the lowest value by comparing the values of fail count fields of all entries in the failure stack 126 .
  • the values of fail count fields of all entries in the failure stack 126 come from the all fail count entry signal 126 f . If there is more than one unavailable entry whose fail count fields store the minimum fail count value, then the entry allocation circuit 128 can select the unavailable entry whose age field indicates it was updated the longest time ago. In other words, the entry allocation circuit 128 examines the unavailable entries whose fail count fields are the lowest value to determine the unavailable entry whose age field is the oldest by comparing the values of age fields of those entries.
  • the values of age fields of all entries in the failure stack 126 come from the all age entry signal 126 g .
  • the entry allocation circuit 128 can select the unavailable entry whose age field is oldest by comparing the values of age fields for all entries in the failure stack 126 .
  • the entry allocation circuit 128 selects an entry in the failure stack 126 to store the second bit fail via the entry location signal 128 a.
  • FIG. 4 illustrates a memory sub-system 400 as one embodiment of the memory sub-system 100 of FIG. 1 , in accordance with embodiments of the present invention. More specifically, an eFUSE repair circuit 130 ′ is used as the repair circuit 130 of FIG. 1 .
  • the memory sub-system 400 includes a FARR (Fuse Address Repair Register) circuit 116 electrically coupled to the redundant memory 114 and the eFUSE repair circuit 130 ′.
  • the eFUSE repair circuit 130 ′ also receives a fuse blow voltage 130 d ′ that is used to blow fuses in the eFUSE circuit 130 ′.
  • the eFUSE repair circuit 130 ′ selects a redundant memory location of the redundant memory 114 to replace the defective main memory location. More specifically, the eFUSE repair circuit 130 ′ applies the fuse blow voltage 130 d ′ to the eFUSE. The resulting fuse arrangement is used by the FARR 116 such that whenever the word address of the bit fail appears on the address bus of the main memory 110 , the replacing redundant memory 114 location is accessed instead of the defective main memory location of the main memory 110 .
  • the fails occur in wordlines.
  • this invention also applies to fails in columns.
  • the sub-system is connected to a single main memory.
  • this invention could be extended to sharing between memories.
  • the ECC circuit is capable of detecting/correcting only one fail at a time and the memory subsystem 100 is capable of repairing only one fail at a time.
  • this invention could be extended to detecting and repairing multiple bit fails at a time.
  • the memory sub-system 100 keeps track of all failures in the failure stack 126 of FIG. 2 .
  • the main memory location at that word address is considered a defective main memory location (i.e., a hard fail), and therefore is replaced by an available redundant memory location of the redundant memory 114 .
  • the repair circuit 130 sends the no repair location available signal 130 c to indicate this condition to the system (not shown).

Abstract

A memory sub-system and a method for operating the same. The memory sub-system includes (a) a main memory, (b) an ECC circuit, (c) a hard fail identifier circuit, (d) a repair circuit, (e) a redundant memory, and (f) a threshold setting circuit. The ECC circuit is capable of (i) detecting a first bit fail, (ii) sending an error flag signal to the hard fail identifier circuit, (iii) sending a first location address, a first bit location of the first bit fail, and a repaired data from the first location address to the hard fail identifier circuit. The hard fail identifier circuit is capable of (i) determining the number of times of failure occurring at the first bit fail, (ii) determining whether the number of times of failure is equal to a predetermined threshold value, and (iii) if so, sending a threshold reached signal.

Description

    BACKGROUND OF THE INVENTION
  • 1. Technical Field
  • The present invention relates to memory hard failure repair, and more specifically, to hard failure repair during normal operation using an ECC (Error Correction Code) circuit and a hard fail identifier circuit.
  • 2. Related Art
  • Prior art exists which covers detection and repair of hard failures in a memory device during the manufacturing process (i.e., at time zero). Prior art also exists which covers detection and correction of soft errors in a memory device during normal operation (e.g., Error Correction Code). Prior art also exists which covers memory error detection and address disable or device replacement during normal operation. There is a need for a subsystem (and a method for operating the same) in which hard failures are detected and repaired during normal operation of a memory device.
  • SUMMARY OF THE INVENTION
  • The present invention provides a memory sub-system, comprising (a) a main memory; (b) an ECC (Error Correction Code) circuit electrically coupled to the main memory; and (c) a hard fail identifier circuit electrically coupled to the ECC circuit, wherein the ECC circuit is capable of detecting a first bit fail at a first bit location at a first location address of the main memory, wherein the ECC circuit is further capable of sending an error flag signal to notify the hard fail identifier circuit about the first bit fail, wherein the ECC circuit is further capable of sending the first location address of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of sending the first bit location of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of repairing data from the first location address and sending the repaired data to the hard fail identifier circuit, wherein the hard fail identifier circuit is capable of, in response to the error flag signal being sent, determining and tracking the number of times of failure occurring at the first location address and the first bit location, wherein the hard fail identifier circuit is further capable of determining whether the number of times of failure at the first location address and the first bit location is equal to a predetermined threshold value, and wherein the hard fail identifier circuit is further capable of, in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value, sending a threshold reached signal to indicate that the first bit fail is a hard fail.
  • The present invention provides a memory sub-system operation method, comprising providing a memory sub-system which includes (a) a main memory, (b) an ECC (Error Correction Code) circuit electrically coupled to the main memory, and (c) a hard fail identifier circuit electrically coupled to the ECC circuit; in response to a first bit fail at a first bit location and at a first location address of the main memory occurring, using the ECC circuit to send an error flag signal to the hard fail identifier circuit; in response to the first bit fail occurring, using the ECC circuit to further send the first location address of the first bit fail to the hard fail identifier circuit; in response to the first bit fail occurring, using the ECC circuit to further send the first bit location of the first bit fail to the hard fail identifier circuit; in response to the first bit fail occurring, using the ECC circuit to further repair data from the first location address and send the repaired data to the hard fail identifier circuit; in response to the error flag signal being sent, using the hard fail identifier circuit to determine and track the number of times of failure at the first location address and the first bit location; using the hard fail identifier circuit to further determine whether the number of times of failure is equal to a predetermined threshold value; and using the hard fail identifier circuit to further send a threshold reached signal in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value.
  • The present invention provides a memory sub-system, comprising (a) a main memory; (b) an ECC (Error Correction Code) circuit electrically coupled to the main memory; (c) a hard fail identifier circuit electrically coupled to the ECC circuit; (d) a repair circuit electrically coupled to the hard fail identifier circuit; (e) a redundant memory electrically coupled to the main memory and the repair circuit; and (f) a threshold setting circuit electrically coupled to the hard fail identifier circuit, wherein the ECC circuit is capable of detecting a first bit fail at a first bit location at a first location address of the main memory, wherein the ECC circuit is further capable of sending an error flag signal to notify the hard fail identifier circuit about the first bit fail, wherein the ECC circuit is further capable of sending the first location address of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of sending the first bit location of the first bit fail to the hard fail identifier circuit, wherein the ECC circuit is further capable of repairing data from the first location address and sending the repaired data to the hard fail identifier circuit, wherein the hard fail identifier circuit is capable of, in response to the error flag signal being sent, determining and tracking the number of times of failure occurring at the first location address and the first bit location, wherein the hard fail identifier circuit is further capable of determining whether the number of times of failure at the first location address and the first bit location is equal to a predetermined threshold value, wherein the hard fail identifier circuit is further capable of, in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value, sending a threshold reached signal to indicate that the first bit fail is a hard fail, wherein the repair circuit is capable of, in response to the threshold reached signal being sent, determining whether there is an available redundant memory location in the redundant memory, wherein the repair circuit is further capable of, in response to the repair circuit determining that there is an available redundant memory location in the redundant memory, selecting the available redundant memory location of the redundant memory to replace a defective main memory location of the main memory at the first location address, such that whenever the first location address of the first bit fail appears on an address bus of the main memory, the selected redundant memory location is accessed instead of the defective main memory location of the main memory, and wherein the threshold setting circuit is capable of providing the predetermined threshold value to the hard fail identifier circuit.
  • The present invention provides a novel memory sub-system (and a method for operating the same) in which hard failures in a memory device are detected and repaired during the normal operation of the memory device.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 illustrates a block diagram of a memory sub-system, in accordance with embodiments of the present invention.
  • FIG. 2 shows one embodiment of the hard fail identifier circuit of the memory sub-system of FIG. 1, in accordance with embodiments of the present invention.
  • FIG. 3 shows a flowchart that illustrates a method for operating the memory sub-system of FIG. 1, in accordance with embodiments of the present invention.
  • FIG. 4 illustrates another memory sub-system as one embodiment of the memory sub-system of FIG. 1, in accordance with embodiments of the present invention.
  • DETAILED DESCRIPTION OF THE INVENTION
  • FIG. 1 illustrates a block diagram of a memory sub-system 100, in accordance with embodiments of the present invention. Illustratively, the memory sub-system 100 comprises a main memory 110, an ECC (Error Correction Code) circuit 112, a redundant memory 114, a hard fail identifier circuit 120, a repair circuit 130, and a threshold setting circuit 140. In one embodiment, the hard fail identifier circuit 120 receives an error flag signal 112 a, a word address signal 112 b, a bit location signal 112 c, and a repaired data signal 112 d from the ECC circuit 112. In one embodiment, the hard fail identifier circuit 120 also receives a threshold count signal 140 a from the threshold setting circuit 140. Illustratively, the repair circuit 130 receives a threshold reached signal 120 b, a word address signal 120 c, and a repaired data signal 120 a from the hard fail identifier circuit 120. In one embodiment, the repair circuit 130 sends a repaired data signal 130 a and a write repaired data signal 130 b to the redundant memory 114. In one embodiment, the repair circuit 130 sends a no repair location available signal 130 c to indicate that there are no more redundant memory locations in the redundant memory 114 that can be used to replace a defective main memory location in the main memory 110.
  • FIG. 2 shows one embodiment of the hard fail identifier circuit 120 of FIG. 1, in accordance with embodiments of the present invention. Illustratively, the hard fail identifier circuit 120 comprises a compare circuit 124, a control circuit 122, an entry allocation circuit 128, and a failure stack 126.
  • In one embodiment, the compare circuit 124 receives the error flag signal 112 a, the word address signal 112 b, and the bit location signal 112 c from the ECC circuit 112 of FIG. 1. In one embodiment, the compare circuit 124 also receives an all address entry signal 126 d and an all bit location entry signal 126 e from the failure stack 126. Illustratively, the compare circuit 124 also sends a hit signal 124 b and an entry location signal 124 a to the control circuit 122. In one embodiment, the compare circuit 124 also sends a miss signal 124 c to the entry allocation circuit 128.
  • In one embodiment, the control circuit 122 receives the hit signal 124 b and the entry location signal 124 a from the compare circuit 124. In one embodiment, the control circuit 122 also receives the repaired data signal 112 d and the threshold count signal 140 a from the ECC circuit 112 and the threshold setting circuit 140, respectively, of FIG. 1. In one embodiment, the control circuit 122 receives a fail count signal 126 b from the failure stack 126. Illustratively, the control circuit 122 also receives a word address signal 126 a from the failure stack 126 and forwards the word address signal 126 a to the repair circuit 130 of FIG. 1 as the word address signal 120 c. In one embodiment, the control circuit 122 sends an increment fail count signal 122 a, a remove entry signal 122 b, an update age signal 122 c, and an entry location signal 122 d to the failure stack 126. For illustration, the control circuit 122 also sends the threshold reached signal 120 b and the repaired data signal 120 a to the repair circuit 130 of FIG.
  • In one embodiment, the entry allocation circuit 128 receives the miss signal 124 cfrom the compare circuit 124. In one embodiment, the entry allocation circuit 128 also receives an all use bit entry signal 126 c, an all fail count entry signal 126 f, and an all age entry signal 126 g from the failure stack 126. Illustratively, the entry allocation circuit 128 also sends an entry location signal 128 a to the failure stack 126. It should be noted that the word address signal 112 b, the bit location signal 112 c (from the ECC circuit 112 of FIG. 1) and the entry location signal 128 a (from the entry allocation circuit 128) can be collectively refer to as a set update signal 128 b.
  • In one embodiment, the failure stack 126 comprises multiple entries (like entries 226 a, 226 b, and 226 c). Although the failure stack 126 has many entries, only the three entries 226 a, 226 b, and 226 c of the failure stack 126 are shown in FIG. 2. In one embodiment, the entry 226 a comprises a use bit 226 a 1, an address field 226 a 2, a bit location field 226 a 3, a fail count field 226 a 4, and an age field 226 a 5. Illustratively, the use bit 226 a 1 indicates whether the entry 226 a is available or unavailable; the address field 226 a 2 stores address of the fail wordline; and the bit location field 226 a 3 indicates the location of a bit fail in the fail wordline. In one embodiment, the fail count field 226 a 4 indicates the number of failure occurrences at an address and at a bit location of the wordline. In one embodiment, the age field 226 a 5 indicates the time period during which the bit fail entry has been stored or the fail count 226 a 4 incremented in the entry 226 a of the failure stack 126.
  • Similarly, in one embodiment, the entry 226 b comprises a use bit 226 b 1, an address field 226 b 2, a bit location field 226 b 3, a fail count field 226 b 4, and an age field 226 b 5. Illustratively, the use bit 226 b 1, the address field 226 b 2, the bit location field 226 b 3, the fail count field 226 b 4, and the age field 226 b 5 has the same function as the use bit 226 a 1, the address field 226 a 2, the bit location field 226 a 3, the fail count field 226 a 4, and the age field 226 a 5, respectively.
  • In one embodiment, similarly, the other entries of the failure stack 126 comprise components similar to those of the entry 226 a.
  • FIG. 3 shows a flowchart that illustrates a method 300 for operating the memory sub-system 100 of FIG. 1, in accordance with embodiments of the present invention.
  • In one embodiment, with reference to FIGS. 1, 2, and 3, the method 300 starts with a step 305 in which the main memory 110 is in normal operation.
  • In one embodiment, in step 310, the ECC circuit 112 of FIG. 1 detects whether a bit fail occurs in the main memory 110 during the normal operation of the main memory 110. As an example, during the normal operation of the memory subsystem 100, assume that the ECC circuit 112 detects a first bit fail at a first bit location of a first word address in the main memory 110. Then a step 315 is performed in which the ECC circuit 112 notifies the first bit fail to the hard fail identifier circuit 120. More specifically, in one embodiment, the ECC circuit 112 sends the error flag signal 112 a to notify the hard fail identifier circuit 120 about the first bit fail. In one embodiment, the ECC circuit 112 also sends the first word address of the first bit fail to the hard fail identifier circuit 120 as the word address signal 112 b. For illustration, the ECC circuit 112 also sends the first bit location of the first bit fail to the hard fail identifier circuit 120 as the bit location signal 112 c. In one embodiment, the ECC circuit 112 also repairs the data from the first word address, and then sends the repaired data to the hard fail identifier circuit 120 as the repaired data signal 112 d.
  • Next, in one embodiment, in a step 320, the compare circuit 124 (FIG. 2) determines whether the first bit fail is in the failure stack 126. More specifically, in one embodiment, by comparing the all address entry signal 126 d and the word address signal 112 b, and, if an address match is found, by comparing the matching bit location field out of the all bit location entry signal 126 e and the bit location signal 112 c, the compare circuit 124 can determine whether the first bit fail is already in the failure stack 126. Assume that the failure stack 126 is currently empty. In other words, the first bit fail is not already in the failure stack 126. As a result, a step 330 b is performed in which the first bit fail is stored in an entry of the failure stack 126 selected by the entry allocation circuit 128.
  • More specifically, in one embodiment, in response to the compare circuit 124 of FIG. 2 determining that the first bit fail is not already in the failure stack 126, the compare circuit 124 sends the miss signal 124 c to notify the entry allocation circuit 128 that the first bit fail is not in the failure stack 126. In response to the miss signal 124 c being sent by the compare circuit 124, the entry allocation circuit 128 examines the all use bit entry signal 126 c and determines that all entries of the failure stack 126 are available (because the failure stack 126 is empty, and therefore all use bits of all entries are 0). In response, the entry allocation circuit 128 selects an entry in the failure stack 126 via the entry location signal 128 a. In response, in one embodiment, the first bit fail is stored in that selected entry. Assume that the entry 226 a is selected for storing the first bit fail. As a result, the use bit 226 a 1 of the entry 226 a is set to 1 to indicate the entry 226 a becomes unavailable. Also, the address field 226 a 2 stores the first word address 112 b; the bit location field 226 a 3 stores the first bit fail location 112 c; and the fail count field 226 a 4 is set to 1.
  • Next, in one embodiment, in step 370, the age fields of all unavailable entries (i.e., entries whose use bits are 1) in the failure stack 126 are updated. More specifically, the age fields of all unavailable entries are edited to show which entry was updated most recent, which was updated next most recent, etc. As a result, the age field 226 a 5 of the entry 226 a edited to indicate that entry 226 a was most recently updated.
  • In one embodiment, it should be noted that the steps 310, 315, 320, 330 b, and 370 are performed simultaneously with the normal operation of the main memory 110 (step 305).
  • In summary, the ECC circuit 112 of FIG. 1 detects the first bit fail and notifies to the hard fail identifier circuit 120 of FIG. 1. In response, the hard fail identifier circuit 120 of FIG. 1 stores the first bit fail into the entry 226 a of the failure stack 126.
  • Assume at a later time that, in the step 310, the ECC circuit 112 of FIG. 1 detects a second bit fail at a second bit location of a second word address in the main memory 110. In response, in the step 315, the ECC circuit 112 notifies the hard fail identifier circuit 120 about the second bit fail in a manner similar to the manner in which the ECC circuit 112 notifies the hard fail identifier circuit 120 about the first bit fail.
  • Assume further that the second word address is different from the first word address, or the second bit location is different from the first bit location. This means that the second bit fail is not already in the failure stack 126. As a result, the hard fail identifier circuit 120 of FIG. 1 stores the second bit fail into an available entry of the failure stack 126. Assume that the entry 226 b is selected to store the second bit fail. In one embodiment, the hard fail identifier circuit 120 stores the second bit fail the entry 226 b in a manner similar to the manner in which the hard fail identifier circuit 120 stores the first bit fail in the entry 226 a.
  • Assume at a later time that, in the step 310, the ECC circuit 112 of FIG. 1 detects a third bit fail at a third bit location of a third word address in the main memory 110. In response, in the step 315, the ECC circuit 112 notifies the hard fail identifier circuit 120 about the third bit fail in a manner similar to the manner in which the ECC circuit 112 notifies the hard fail identifier circuit 120 about the first and the second bit fails.
  • Assume further that the third word address is the same as the first word address, and the third bit location is the same as the first bit location. This means that the third bit fail is already in the failure stack 126. More specifically, the third bit fail is already stored in the entry 226 a. As a result, the step 330 a is performed.
  • In one embodiment, in the step 330 a, the fail count field of the entry 226 a is increased by 1 to become 2 to indicate that two failures have occurred at the first bit location of the first word address. More specifically, in response to the compare circuit 124 determining that the third bit fail is already in the failure stack 126, the compare circuit 124 sends the hit signal 124 b to notify the control circuit 122. In one embodiment, the compare circuit 124 also provides the control circuit 122 with the entry location of the first and the third bit fail (i.e., the entry 226 a) via the entry location signal 124 a. In response, the control circuit 122 sends the increment fail count signal 122 a and entry location signal 122 d (from the signal 124 a) to cause the failure stack 126 to increment the value of the fail count field 226 a 4 of the entry 226 a by 1. As a result, the value of the fail count field 226 a 4 of the entry 226 a becomes 2 indicating that two failures have occurred at the first word address and at the first bit location.
  • Next, in one embodiment, in the step 340 a, the control circuit 122 determines whether the fail count field 226 a 4 of the first bit fail is equal to a predetermined threshold value that was provided previously by the threshold setting circuit 140 of FIG. 1 via the threshold count signal 140 a. More specifically, the control circuit 122 compares the value of the fail count field 226 a 4 that comes via the fail count signal 126 b with the predetermined threshold value that comes via the threshold count signal 140 a. Assume that the predetermined threshold value is 3. As a result, the value of the fail count field 226 a 4 of the entry 226 a, which is 2, is less than the predetermined threshold value which is 3, and therefore the step 370 is performed.
  • More specifically, in the step 370, the age fields of all unavailable entries in the failure stack 126 are edited to show which entry was updated most recent, which was updated next most recent, etc. In other word, the age field 226 a 5 of the entry 226 a and the age field 226 b 5 of the entry 226 b are edited to indicate that entry 226 a was most recently updated, and entry 226 b was next most recently updated.
  • In one embodiment, it should be noted that the steps 310, 315, 320, 330 a, 340 a and 370 are performed simultaneously with the normal operation of the main memory 110 (step 305).
  • Assume alternatively that the predetermined threshold value is 2 (instead of 3). As a result, the value of the fail count field 226 a 4 of the entry 226 a is equal to the predetermined threshold value, and therefore a step 350 a is performed.
  • In one embodiment, in the step 350 a, the repair circuit 130 determines whether there is an available redundant memory location in the redundant memory 114. In response to the repair circuit 130 determining that there is an available redundant memory location in the redundant memory 114, the repair circuit 130 selects the available redundant location of the redundant memory 114 and re-routes the defective main memory 110 first word address to the selected redundant memory 114 location address. It should be noted that a main memory 110 location that causes failure a number of times equal to the predetermined threshold value is considered defective and needs to be replaced by an available redundant location of the redundant memory 114. Next, the repair circuit 130 sends the repaired data signal 130 a and a write repaired data signal 130 b to the redundant memory 114. This causes the repaired data 130 a to be written into the selected location in the redundant memory 114. More specifically about the step 350 a, in one embodiment, in response to the control circuit 122 determining that the fail count field 226 a 4 of the first bit fail is equal to the predetermined threshold value of 2, the control circuit 122 sends the threshold reached signal 120 b to notify the repair circuit 130 that there is a defective main memory 110 location that needs to be replaced. It should be noted that the defective main memory 110 location is considered a hard failure. In one embodiment, the control circuit 122 also forwards the first word address (the word address signal 126 a) from the failure stack 126 to the repair circuit 130 (via the word address signal 120 c). In one embodiment, the control circuit 122 also forwards the repaired data from the first word address (the repaired data signal 112 d) from the ECC circuit 112 of FIG. 1 to the repair circuit 130 (via the repaired data signal 120 a). In response, the repair circuit 130 determines that there is the available redundant memory location in the redundant memory 114 and selects the available location of the redundant memory 114 to replace a defective main memory location of the main memory 110 at the first word address. As a result, for future normal operation, whenever the first word address appears on the address bus of the main memory 110, the repair circuit 130 re-directs the address to point to the selected location of the redundant memory 114 (FIG. 1). Next, the repair circuit 130 sends the repaired data signal 130 a and a write repaired data signal 130 b to the redundant memory 114. This causes the repaired data 130 a to be written into the selected location in the redundant memory 114 and enables normal operation to continue.
  • It should be noted that the repair of the defective main memory location of the main memory 110 at the first word address can be a hard repair of a soft repair. A hard repair can be defined as a repair that remains in effect even if the power to the memory sub-system is cut off. A soft repair can be defined as a repair that disappears if the power to the memory sub-system is cut off.
  • Next, in one embodiment, in a step 360 a, the first bit fail is removed from the failure stack 126. More specifically, in one embodiment, the control circuit 122 sends the remove entry signal 122 b and entry location signal 122 d (from the signal 124 a) to notify the failure stack 126 that the first bit fail needs to be removed from the entry 226 a. In response to the remove entry signal 122 b being sent, the failure stack 126 resets the use bit 226 a 1 of the entry 226 a to 0 to indicate that the entry 226 a is again available.
  • Next, in one embodiment, in the step 370, the age fields of all unavailable entries (i.e., entries whose use bits are 1) in the failure stack 126 are updated. More specifically, the age fields of all unavailable entries are edited to show which entry was updated most recent, which was updated next most recent, etc. As a result, the age field 226 b 5 of the entry 226 b is edited to indicate entry 226 b was most recently updated.
  • In one embodiment, it should be noted that the steps 310, 315, 320, 330 a, 340 a, 350 a, 360 a and 370 are performed simultaneously with the normal operation of the main memory 110 (step 305).
  • In the embodiment described above, the third word address is the same as the first word address and the third bit location is the same as the first bit location. Alternatively, in the step 320, if the third word address is same as the first word address but the third bit location is different from the first bit location, then the step 330 b is performed. In other words, the third bit fail is not already in the failure stack 126 and needs to be stored in an available entry of the failure stack 126 in a similar manner as the first and second bit fails were stored in entries 126 a and 126 b.
  • In one embodiment, assume alternatively that when the compare circuit 124 of FIG. 2 sends the miss signal 124 c to notify the entry allocation circuit 128 that the second bit fail is not already in the failure stack 126, the entry allocation circuit 128 finds that there is no available entry in the failure stack 126 to store the second bit fail. More specifically, the entry allocation circuit 128 examines the all use bit entry signal 126 c and determines that there is no available entry in the failure stack 126 to store the second bit fail. If so, in one embodiment, the entry allocation circuit 128 can select an unavailable entry of the failure stack 126 to store the second bit fail. In one embodiment, the entry allocation circuit 128 can select an unavailable entry whose fail count field stores the lowest value. More specifically, the entry allocation circuit 128 determines the unavailable entry whose fail count field is the lowest value by comparing the values of fail count fields of all entries in the failure stack 126. In one embodiment, the values of fail count fields of all entries in the failure stack 126 come from the all fail count entry signal 126 f. If there is more than one unavailable entry whose fail count fields store the minimum fail count value, then the entry allocation circuit 128 can select the unavailable entry whose age field indicates it was updated the longest time ago. In other words, the entry allocation circuit 128 examines the unavailable entries whose fail count fields are the lowest value to determine the unavailable entry whose age field is the oldest by comparing the values of age fields of those entries. It should be noted that the values of age fields of all entries in the failure stack 126 come from the all age entry signal 126 g. In another embodiment, the entry allocation circuit 128 can select the unavailable entry whose age field is oldest by comparing the values of age fields for all entries in the failure stack 126. In summary, the entry allocation circuit 128 selects an entry in the failure stack 126 to store the second bit fail via the entry location signal 128 a.
  • FIG. 4 illustrates a memory sub-system 400 as one embodiment of the memory sub-system 100 of FIG. 1, in accordance with embodiments of the present invention. More specifically, an eFUSE repair circuit 130′ is used as the repair circuit 130 of FIG. 1. In one embodiment, the memory sub-system 400 includes a FARR (Fuse Address Repair Register) circuit 116 electrically coupled to the redundant memory 114 and the eFUSE repair circuit 130′. In one embodiment, the eFUSE repair circuit 130′ also receives a fuse blow voltage 130 d′ that is used to blow fuses in the eFUSE circuit 130′. In one embodiment, when there is a need to repair a defective main memory location of the main memory 110, the eFUSE repair circuit 130′ selects a redundant memory location of the redundant memory 114 to replace the defective main memory location. More specifically, the eFUSE repair circuit 130′ applies the fuse blow voltage 130 d′ to the eFUSE. The resulting fuse arrangement is used by the FARR 116 such that whenever the word address of the bit fail appears on the address bus of the main memory 110, the replacing redundant memory 114 location is accessed instead of the defective main memory location of the main memory 110.
  • In the embodiments described above, the fails occur in wordlines. Alternatively, this invention also applies to fails in columns.
  • In the embodiments described above, the sub-system is connected to a single main memory. Alternatively, this invention could be extended to sharing between memories.
  • In the embodiments described above, the ECC circuit is capable of detecting/correcting only one fail at a time and the memory subsystem 100 is capable of repairing only one fail at a time. Alternatively, this invention could be extended to detecting and repairing multiple bit fails at a time.
  • In summary, with reference to FIGS. 1, 2, and 3, the memory sub-system 100 (FIG. 1) keeps track of all failures in the failure stack 126 of FIG. 2. When the number of failures caused by a bit location at a word address reaches the predetermine threshold value, then the main memory location at that word address is considered a defective main memory location (i.e., a hard fail), and therefore is replaced by an available redundant memory location of the redundant memory 114. If there is no available redundant memory location in the redundant memory 114 for replacing the hard fail, then in one embodiment, the repair circuit 130 sends the no repair location available signal 130 c to indicate this condition to the system (not shown).
  • While particular embodiments of the present invention have been described herein for purposes of illustration, many modifications and changes will become apparent to those skilled in the art. Accordingly, the appended claims are intended to encompass all such modifications and changes as fall within the true spirit and scope of this invention.

Claims (20)

1. A memory sub-system, comprising:
(a) a main memory;
(b) an ECC (Error Correction Code) circuit electrically coupled to the main memory; and
(c) a hard fail identifier circuit electrically coupled to the ECC circuit,
wherein the ECC circuit is capable of detecting a first bit fail at a first bit location at a first location address of the main memory,
wherein the ECC circuit is further capable of sending an error flag signal to notify the hard fail identifier circuit about the first bit fail,
wherein the ECC circuit is further capable of sending the first location address of the first bit fail to the hard fail identifier circuit,
wherein the ECC circuit is further capable of sending the first bit location of the first bit fail to the hard fail identifier circuit,
wherein the ECC circuit is further capable of repairing data from the first location address and sending the repaired data to the hard fail identifier circuit,
wherein the hard fail identifier circuit is capable of, in response to the error flag signal being sent, determining and tracking the number of times of failure occurring at the first location address and the first bit location,
wherein the hard fail identifier circuit is further capable of determining whether the number of times of failure at the first location address and the first bit location is equal to a predetermined threshold value, and
wherein the hard fail identifier circuit is further capable of, in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value, sending a threshold reached signal to indicate that the first bit fail is a hard fail.
2. The memory sub-system of claim 1, further comprising:
a repair circuit electrically coupled to the hard fail identifier circuit; and
a redundant memory electrically coupled to the main memory and the repair circuit,
wherein the repair circuit is capable of, in response to the threshold reached signal being sent, determining whether there is an available redundant memory location in the redundant memory, and
wherein the repair circuit is further capable of, in response to the repair circuit determining that there is an available redundant memory location in the redundant memory, selecting the available redundant memory location of the redundant memory to replace a defective main memory location of the main memory at the first location address, such that whenever the first location address of the first bit fail appears on an address bus of the main memory, the selected redundant memory location is accessed instead of the defective main memory location of the main memory.
3. The memory sub-system of claim 2, wherein the repair circuit is further capable of sending a no repair location available signal in response to the repair circuit determining that there is no available redundant memory location in the redundant memory for replacing the defective main memory location in the main memory.
4. The memory sub-system of claim 1, further comprising a threshold setting circuit electrically coupled to the hard fail identifier circuit, wherein the threshold setting circuit is capable of providing the predetermined threshold value to the hard fail identifier circuit.
5. The memory sub-system of claim 1,
wherein the hard fail identifier circuit is further capable of forwarding the repaired data to a repair circuit in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value, and
wherein the hard fail identifier circuit is further capable of forwarding the first location address to the repair circuit in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value.
6. The memory sub-system of claim 5,
wherein the repair circuit is further capable of forwarding the repaired data and a write repaired data signal to a redundant memory, in response to receiving the threshold reached signal from the hard fail identifier circuit and subsequently identifying an available redundant memory location to be used to replace the failing main memory location, and
wherein the repaired data is written into the selected redundant memory location in response to the write repaired data signal.
7. The memory sub-system of claim 1, further comprising:
an eFUSE repair circuit electrically coupled to the hard fail identifier circuit;
a redundant memory electrically coupled to the main memory; and
an FARR (Fuse Address Repair Register) circuit electrically coupled to the redundant memory and the eFUSE repair circuit,
wherein the eFUSE repair circuit receives a fuse blow voltage,
wherein the eFUSE repair circuit is capable of, in response to the threshold reached signal being sent, determining whether there is an available redundant memory location in the redundant memory,
wherein the eFUSE repair circuit is further capable of, in response to the eFUSE repair circuit determining that there is an available redundant memory location in the redundant memory, selecting the available redundant memory location of the redundant memory to replace a defective main memory location of the main memory at the first location address, and
wherein the eFUSE repair circuit is further capable of applying the fuse blow voltage to blow out some fuses of the eFUSE circuit, thereby programming the FARR circuit such that whenever the first location address of the first bit fail appears on an address bus of the main memory, the selected redundant memory location is accessed instead of the defective main memory location of the main memory.
8. The memory subsystem of claim 1, wherein the hard fail identifier circuit comprises a failure stack electrically coupled to the ECC circuit,
wherein the failure stack comprises N entries,
wherein N is a positive integer,
wherein each of the N entries comprises a use bit, an address field, an age field, and a bit location field,
wherein the N entries comprises M unavailable entries and P available entries, M and P being non-negative integers,
wherein M plus P is equal to N, and
wherein each of the M unavailable entries stores a bit fail.
9. The memory subsystem of claim 8,
wherein the hard fail identifier circuit further comprises a compare circuit electrically coupled to the ECC circuit and the failure stack,
wherein the compare circuit is capable of, in response to the error flag signal being sent, determining whether the first location address is equal to any of the contents of the address fields of the M unavailable entries in the failure stack, and
wherein the compare circuit is further capable of, in response to the error flag signal being sent and the first location address being found on the failure stack, determining whether the first bit location is equal to the bit location of the matching stack entry.
10. A memory sub-system operation method, comprising:
providing a memory sub-system which includes (a) a main memory, (b) an ECC (Error Correction Code) circuit electrically coupled to the main memory, and (c) a hard fail identifier circuit electrically coupled to the ECC circuit;
in response to a first bit fail at a first bit location and at a first location address of the main memory occurring, using the ECC circuit to send an error flag signal to the hard fail identifier circuit;
in response to the first bit fail occurring, using the ECC circuit to further send the first location address of the first bit fail to the hard fail identifier circuit;
in response to the first bit fail occurring, using the ECC circuit to further send the first bit location of the first bit fail to the hard fail identifier circuit;
in response to the first bit fail occurring, using the ECC circuit to further repair data from the first location address and send the repaired data to the hard fail identifier circuit;
in response to the error flag signal being sent, using the hard fail identifier circuit to determine and track the number of times of failure at the first location address and the first bit location;
using the hard fail identifier circuit to further determine whether the number of times of failure is equal to a predetermined threshold value; and
using the hard fail identifier circuit to further send a threshold reached signal in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value.
11. The method of claim 10, further comprising:
in response to the threshold reached signal being sent, using a repair circuit to determine whether there is an available redundant memory location in a redundant memory,
in response to the repair circuit determining that there is an available redundant memory location in the redundant memory, using a repair circuit to further select the available redundant memory location of the redundant memory to replace a defective main memory location of the main memory at the first location address, such that whenever the defective location address appears on the address bus of the main memory, the selected redundant memory location is accessed instead of the defective main memory location of the main memory,
wherein the memory sub-system further includes (i) the repair circuit electrically coupled to the hard fail identifier circuit, and (ii) the redundant memory electrically coupled to main memory and the repair circuit.
12. The method of claim 11, wherein the repair of the defective main memory location of the main memory at the first location address is a hard repair.
13. The method of claim 11, wherein the repair of the defective main memory location of the main memory at the first location address is a soft repair.
14. The method of claim 11, using the repair circuit to further send a no repair location available signal in response to the repair circuit determining that there is no available redundant memory location in the redundant memory for replacing the defective main memory location in the main memory.
15. The method of claim 10, further comprising using a threshold setting circuit to provide the predetermined threshold value to the hard fail identifier circuit,
wherein the memory sub-system further includes the threshold setting circuit electrically coupled to the hard fail identifier circuit.
16. Method of claim 10, further comprising:
using the hard fail identifier circuit to forward the repaired data to a repair circuit in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value; and
using the hard fail identifier circuit to forward the first location address to the repair circuit in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value.
17. The method of claim 16, further comprising:
using the repair circuit to forward the repaired data and a write repaired data signal to the redundant memory, in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value, and the repair circuit subsequently identifying an available redundant memory location to be used to replace the failing main memory location at the first location address; and
writing the repaired data into the selected redundant memory location in response to the write repaired data signal being sent by the repair circuit.
18. The method of claim 10, further comprising:
using an eFUSE repair circuit to receive a fuse blow voltage;
in response to the threshold reached signal being sent, using the eFUSE repair circuit to determine whether there is an available redundant memory location in a redundant memory;
in response to the e FUSE repair circuit determining that there is an available redundant memory location in the redundant memory, using the eFUSE repair circuit to further select the available redundant memory location of the redundant memory to replace a defective main memory location of the main memory at the first location address; and
using the eFUSE repair circuit to further apply the fuse blow voltage to blow out some fuses of the eFUSE circuit, thereby programming a FARR (Fuse Address Repair Register) circuit such that whenever the first location address of the first bit fail appears on an address bus of the main memory, the selected redundant memory location is accessed instead of the defective main memory location of the main memory,
wherein the memory sub-system further includes (i) the eFUSE repair circuit electrically coupled to the hard fail identifier circuit, (ii) the redundant memory electrically coupled to main memory, and (iii) the FARR (Fuse Address Repair Register) circuit electrically coupled to the redundant memory and the eFUSE repair circuit.
19. A memory sub-system, comprising:
(a) a main memory;
(b) an ECC (Error Correction Code) circuit electrically coupled to the main memory;
(c) a hard fail identifier circuit electrically coupled to the ECC circuit;
(d) a repair circuit electrically coupled to the hard fail identifier circuit;
(e) a redundant memory electrically coupled to the main memory and the repair circuit; and
(f) a threshold setting circuit electrically coupled to the hard fail identifier circuit,
wherein the ECC circuit is capable of detecting a first bit fail at a first bit location at a first location address of the main memory,
wherein the ECC circuit is further capable of sending an error flag signal to notify the hard fail identifier circuit about the first bit fail,
wherein the ECC circuit is further capable of sending the first location address of the first bit fail to the hard fail identifier circuit,
wherein the ECC circuit is further capable of sending the first bit location of the first bit fail to the hard fail identifier circuit,
wherein the ECC circuit is further capable of repairing data from the first location address and sending the repaired data to the hard fail identifier circuit,
wherein the hard fail identifier circuit is capable of, in response to the error flag signal being sent, determining and tracking the number of times of failure occurring at the first location address and the first bit location,
wherein the hard fail identifier circuit is further capable of determining whether the number of times of failure at the first location address and the first bit location is equal to a predetermined threshold value,
wherein the hard fail identifier circuit is further capable of, in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value, sending a threshold reached signal to indicate that the first bit fail is a hard fail,
wherein the repair circuit is capable of, in response to the threshold reached signal being sent, determining whether there is an available redundant memory location in the redundant memory,
wherein the repair circuit is further capable of, in response to the repair circuit determining that there is an available redundant memory location in the redundant memory, selecting the available redundant memory location of the redundant memory to replace a defective main memory location of the main memory at the first location address, such that whenever the first location address of the first bit fail appears on an address bus of the main memory, the selected redundant memory location is accessed instead of the defective main memory location of the main memory, and
wherein the threshold setting circuit is capable of providing the predetermined threshold value to the hard fail identifier circuit.
20. The memory device of claim 19,
wherein the hard fail identifier circuit is further capable of forwarding the repaired data to the repair circuit in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value, and
wherein the hard fail identifier circuit is further capable of forwarding the first location address to the repair circuit in response to the hard fail identifier circuit determining that the number of times of failure is equal to the predetermined threshold value.
US11/275,464 2006-01-06 2006-01-06 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit Expired - Fee Related US7386771B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US11/275,464 US7386771B2 (en) 2006-01-06 2006-01-06 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit
US12/105,338 US7689881B2 (en) 2006-01-06 2008-04-18 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11/275,464 US7386771B2 (en) 2006-01-06 2006-01-06 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/105,338 Continuation US7689881B2 (en) 2006-01-06 2008-04-18 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit

Publications (2)

Publication Number Publication Date
US20070162786A1 true US20070162786A1 (en) 2007-07-12
US7386771B2 US7386771B2 (en) 2008-06-10

Family

ID=38353694

Family Applications (2)

Application Number Title Priority Date Filing Date
US11/275,464 Expired - Fee Related US7386771B2 (en) 2006-01-06 2006-01-06 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit
US12/105,338 Expired - Fee Related US7689881B2 (en) 2006-01-06 2008-04-18 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit

Family Applications After (1)

Application Number Title Priority Date Filing Date
US12/105,338 Expired - Fee Related US7689881B2 (en) 2006-01-06 2008-04-18 Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit

Country Status (1)

Country Link
US (2) US7386771B2 (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100080074A1 (en) * 2008-09-30 2010-04-01 Semiconductor Energy Laboratory Co., Ltd. Semiconductor memory device
US20160350199A1 (en) * 2015-06-01 2016-12-01 Cisco Technology, Inc. Predictive in-field memory repair scheme
US10430264B2 (en) 2017-06-02 2019-10-01 International Business Machines Corporation Monitoring correctable errors on a bus interface to determine whether to redirect input/output (I/O) traffic from a first processing unit to a second processing unit
US20190361769A1 (en) * 2017-01-12 2019-11-28 Agency For Science, Technology And Research Memory device with soft-decision decoding and methods of reading and forming thereof
US10528437B2 (en) * 2017-06-02 2020-01-07 International Business Machines Corporation Monitoring correctable errors on a bus interface to determine whether to redirect input/output request (I/O) traffic to another bus interface
US11036673B2 (en) * 2018-12-21 2021-06-15 Graphcore Limited Assigning identifiers to processing units in a column to repair a defective processing unit in the column
CN113268373A (en) * 2020-02-14 2021-08-17 华邦电子股份有限公司 Memory storage device with automatic error recovery mechanism and method thereof
CN113608908A (en) * 2021-07-28 2021-11-05 烽火超微信息科技有限公司 Server fault processing method, system, equipment and readable storage medium
US20230195568A1 (en) * 2021-12-20 2023-06-22 Micron Technology, Inc. Handling Memory Errors Identified by Microprocessors
US11720438B2 (en) 2021-04-01 2023-08-08 Micron Technology, Inc. Recording and decoding of information related to memory errors identified by microprocessors

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7296129B2 (en) 2004-07-30 2007-11-13 International Business Machines Corporation System, method and storage medium for providing a serialized memory interface with a bus repeater
US7512762B2 (en) 2004-10-29 2009-03-31 International Business Machines Corporation System, method and storage medium for a memory subsystem with positional read data latency
US7331010B2 (en) 2004-10-29 2008-02-12 International Business Machines Corporation System, method and storage medium for providing fault detection and correction in a memory subsystem
US7478259B2 (en) 2005-10-31 2009-01-13 International Business Machines Corporation System, method and storage medium for deriving clocks in a memory system
US7685392B2 (en) 2005-11-28 2010-03-23 International Business Machines Corporation Providing indeterminate read data latency in a memory system
US7669086B2 (en) 2006-08-02 2010-02-23 International Business Machines Corporation Systems and methods for providing collision detection in a memory system
US7539842B2 (en) * 2006-08-15 2009-05-26 International Business Machines Corporation Computer memory system for selecting memory buses according to physical memory organization information stored in virtual address translation tables
US7870459B2 (en) 2006-10-23 2011-01-11 International Business Machines Corporation High density high reliability memory module with power gating and a fault tolerant address and command bus
US7721140B2 (en) * 2007-01-02 2010-05-18 International Business Machines Corporation Systems and methods for improving serviceability of a memory system
JP4617405B2 (en) * 2008-02-05 2011-01-26 富士通株式会社 Electronic device for detecting defective memory, defective memory detecting method, and program therefor
US8423852B2 (en) * 2008-04-15 2013-04-16 Qualcomm Incorporated Channel decoding-based error detection
US8281190B2 (en) * 2009-08-02 2012-10-02 Avago Technologies Enterprise IP (Singapore) Pte. Ltd. Circuits and methods for processing memory redundancy data
DE102011079259B9 (en) * 2011-07-15 2013-11-28 Infineon Technologies Ag Bit error correction for eliminating age-related errors in a bit pattern
US9135099B2 (en) * 2012-03-29 2015-09-15 Taiwan Semiconductor Manufacturing Company, Ltd. Memory error correction
US8839054B2 (en) 2012-04-12 2014-09-16 International Business Machines Corporation Read only memory (ROM) with redundancy
KR101862379B1 (en) 2013-04-19 2018-07-05 삼성전자주식회사 Memory device with error correction code and redundancy repair operations
JP6377751B2 (en) * 2013-09-24 2018-08-22 インテル・コーポレーション Using error correction pointers to handle errors in memory
US9208024B2 (en) 2014-01-10 2015-12-08 Freescale Semiconductor, Inc. Memory ECC with hard and soft error detection and management
US9389954B2 (en) 2014-02-26 2016-07-12 Freescale Semiconductor, Inc. Memory redundancy to replace addresses with multiple errors
KR102238706B1 (en) * 2014-11-28 2021-04-09 삼성전자주식회사 Semiconductor memory device and memory system including the same
KR20160074925A (en) 2014-12-19 2016-06-29 에스케이하이닉스 주식회사 Fuse cell circuit, fuse cell array and memory device including the same
KR20170073079A (en) * 2015-12-18 2017-06-28 에스케이하이닉스 주식회사 Nonvolatile memory circuit and memory device including same
US10042700B2 (en) * 2016-05-28 2018-08-07 Advanced Micro Devices, Inc. Integral post package repair
KR102498208B1 (en) 2016-06-07 2023-02-10 삼성전자주식회사 Memory device including extra capacity and stacked memory device including the same
DE102020134945A1 (en) 2020-02-27 2021-09-02 Taiwan Semiconductor Manufacturing Co., Ltd. DYNAMIC FAULT MONITORING AND REPAIR
US11586495B2 (en) * 2020-07-15 2023-02-21 Micron Technology, Inc. Fuse logic to perform selectively enabled ECC decoding

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4661955A (en) * 1985-01-18 1987-04-28 Ibm Corporation Extended error correction for package error correction codes
US6073258A (en) * 1998-02-27 2000-06-06 International Business Machines Corporation Method and device for performing two dimensional redundancy calculations on embedded memories avoiding fail data collection
US6373758B1 (en) * 2001-02-23 2002-04-16 Hewlett-Packard Company System and method of operating a programmable column fail counter for redundancy allocation
US6552947B2 (en) * 1999-04-05 2003-04-22 Madrone Solutions, Inc. Memory tile for use in a tiled memory
US6795942B1 (en) * 2000-07-06 2004-09-21 Lsi Logic Corporation Built-in redundancy analysis for memories with row and column repair

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4661955A (en) * 1985-01-18 1987-04-28 Ibm Corporation Extended error correction for package error correction codes
US6073258A (en) * 1998-02-27 2000-06-06 International Business Machines Corporation Method and device for performing two dimensional redundancy calculations on embedded memories avoiding fail data collection
US6552947B2 (en) * 1999-04-05 2003-04-22 Madrone Solutions, Inc. Memory tile for use in a tiled memory
US6795942B1 (en) * 2000-07-06 2004-09-21 Lsi Logic Corporation Built-in redundancy analysis for memories with row and column repair
US6373758B1 (en) * 2001-02-23 2002-04-16 Hewlett-Packard Company System and method of operating a programmable column fail counter for redundancy allocation

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102165533A (en) * 2008-09-30 2011-08-24 株式会社半导体能源研究所 Semiconductor memory device
US20100080074A1 (en) * 2008-09-30 2010-04-01 Semiconductor Energy Laboratory Co., Ltd. Semiconductor memory device
US20160350199A1 (en) * 2015-06-01 2016-12-01 Cisco Technology, Inc. Predictive in-field memory repair scheme
US9983972B2 (en) * 2015-06-01 2018-05-29 Cisco Technology, Inc. Predictive in-field memory repair scheme
US20190361769A1 (en) * 2017-01-12 2019-11-28 Agency For Science, Technology And Research Memory device with soft-decision decoding and methods of reading and forming thereof
US11061784B2 (en) 2017-06-02 2021-07-13 International Business Machines Corporation Monitoring correctable errors on a bus interface to determine whether to redirect input/output request (I/O) traffic to another bus interface
US10430264B2 (en) 2017-06-02 2019-10-01 International Business Machines Corporation Monitoring correctable errors on a bus interface to determine whether to redirect input/output (I/O) traffic from a first processing unit to a second processing unit
US10528437B2 (en) * 2017-06-02 2020-01-07 International Business Machines Corporation Monitoring correctable errors on a bus interface to determine whether to redirect input/output request (I/O) traffic to another bus interface
US10949277B2 (en) 2017-06-02 2021-03-16 International Business Machines Corporation Monitoring correctable errors on a bus interface to determine whether to redirect input/output (I/O) traffic from a first processing unit to a second processing unit
US11036673B2 (en) * 2018-12-21 2021-06-15 Graphcore Limited Assigning identifiers to processing units in a column to repair a defective processing unit in the column
US11698883B2 (en) * 2018-12-21 2023-07-11 Graphcore Limited Assigning identifiers to processing units in a column to repair a defective processing unit in the column
CN113268373A (en) * 2020-02-14 2021-08-17 华邦电子股份有限公司 Memory storage device with automatic error recovery mechanism and method thereof
US11720438B2 (en) 2021-04-01 2023-08-08 Micron Technology, Inc. Recording and decoding of information related to memory errors identified by microprocessors
CN113608908A (en) * 2021-07-28 2021-11-05 烽火超微信息科技有限公司 Server fault processing method, system, equipment and readable storage medium
US20230195568A1 (en) * 2021-12-20 2023-06-22 Micron Technology, Inc. Handling Memory Errors Identified by Microprocessors
US11726873B2 (en) * 2021-12-20 2023-08-15 Micron Technology, Inc. Handling memory errors identified by microprocessors

Also Published As

Publication number Publication date
US7689881B2 (en) 2010-03-30
US7386771B2 (en) 2008-06-10
US20080195888A1 (en) 2008-08-14

Similar Documents

Publication Publication Date Title
US7386771B2 (en) Repair of memory hard failures during normal operation, using ECC and a hard fail identifier circuit
US9389954B2 (en) Memory redundancy to replace addresses with multiple errors
US20080181035A1 (en) Method and system for a dynamically repairable memory
US6584015B2 (en) Storage device counting error correction
JP5030443B2 (en) How to recover hardware
CN110277130B (en) Semiconductor device involving repair of redundant region
US8423837B2 (en) High reliability and low power redundancy for memory
US9396817B2 (en) Self-repairing memory and method of use
US20070168783A1 (en) ROM redundancy in ROM embedded DRAM
US20170017546A1 (en) Dynamic Enabling of Redundant Memory Cells During Operating Life
CN106356099B (en) Semiconductor device and method for repairing the same
US20040088614A1 (en) Management system for defective memory
US6386456B1 (en) Memory card identification system
US20050240838A1 (en) Semiconductor memory device having code bit cell array
CN113393889A (en) Memory system
US20020010891A1 (en) Redundant memory access system
EP3392885B1 (en) Non-volatile memory repair circuit
US6687170B2 (en) System and method for storing parity information in fuses
EP1402365A1 (en) Method and circuit arrangement for memory error processing
US8310888B2 (en) Repair fuse device
US6728146B1 (en) Memory device and method for automatically repairing defective memory cells
KR100327332B1 (en) Embedded self repair method and apparatus for embedded memory
US20010042228A1 (en) Memory access system
US20230386598A1 (en) Methods for real-time repairing of memory failures caused during operations, memory systems performing repairing methods, and data processing systems including repairing memory systems
KR20010035837A (en) Self repair method for Embedded memory

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SHUMA, STEPHEN GERARD;REEL/FRAME:016995/0516

Effective date: 20051221

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

REMI Maintenance fee reminder mailed
FPAY Fee payment

Year of fee payment: 4

SULP Surcharge for late payment
REMI Maintenance fee reminder mailed
LAPS Lapse for failure to pay maintenance fees
STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20160610