US20070061685A1 - Method, system, and apparatus for adjacent-symbol error correction and detection code - Google Patents
Method, system, and apparatus for adjacent-symbol error correction and detection code Download PDFInfo
- Publication number
- US20070061685A1 US20070061685A1 US11/585,411 US58541106A US2007061685A1 US 20070061685 A1 US20070061685 A1 US 20070061685A1 US 58541106 A US58541106 A US 58541106A US 2007061685 A1 US2007061685 A1 US 2007061685A1
- Authority
- US
- United States
- Prior art keywords
- memory
- error
- data
- adjacent
- syndrome
- 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.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
- G11B20/1833—Error detection or correction; Testing, e.g. of drop-outs by adding special lists or symbols to the coded information
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1008—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
- G06F11/1012—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices using codes or arrangements adapted for a specific type of error
- G06F11/1028—Adjacent errors, e.g. error in n-bit (n>1) wide storage units, i.e. package error
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
Definitions
- the present disclosure pertains to the field of memory and computer memory systems and more specifically to error detection and correction for memory errors.
- ECC Error correcting codes
- SEC single error correcting
- DED double error detecting
- SbEC single symbol error correcting
- DbED double symbol error detecting
- FIG. 1 illustrates a block diagram of a code word utilized in an embodiment.
- FIG. 2 illustrates an apparatus utilized in an embodiment.
- FIG. 3 illustrates a flowchart of a method utilized in an embodiment.
- FIG. 4 illustrates an apparatus utilized in an embodiment described in connection with FIG. 2 .
- FIG. 5 illustrates a system utilized in an embodiment.
- typical ECC code utilizes 36 memory devices for chipfail detection and correction that results in increased cost and design of a computer system.
- the present ECC codes do not scale.
- the claimed subject matter facilitates a new ECC code, “adjacent-symbol” code that supports memory systems with 18 memory devices
- the claimed subject matter facilitates the ability for decoding and correcting memory errors in systems that utilize 18 memory devices for a memory transaction (memory rank).
- the claimed subject matter facilitates forming a code word of data with only two clock phases.
- the adjacent-symbol ECC code corrects any error pattern within the data from one memory device and detects various errors (double device errors) from failures in 2 memory devices.
- the adjacent-symbol ECC code is utilized for a memory system with two channels of Double Data Rate (DDR) memory, wherein each channel is 64 bits wide with eight optional bits for ECC.
- the memory system may utilize x4 or x8 wide memory devices (x4 and x8 refers to the number of bits that can be output from the memory device).
- x4 and x8 refers to the number of bits that can be output from the memory device.
- the claimed subject matter supports various configurations of memory systems. For example, a memory system with x8 devices would utilize 18 memory devices per memory rank if ECC is supported, otherwise, 16 memory devices per memory rank if ECC is not supported. Alternatively, a memory system with x4 devices would utilize 36 memory devices per memory rank if ECC is supported, otherwise, 32 memory devices per memory rank if ECC is not supported.
- FIG. 1 illustrates a block diagram of a code word utilized in an embodiment.
- the block diagram 100 comprises an adjacent symbol codeword 106 to be formed from two clock phases of data 102 and 104 from a memory device.
- a memory access transaction comprises a transfer of 128 data bits plus an additional 16 ECC check bits per clock edge, for a total of 144 bits for each clock edge (288 bits for both clock edges).
- a first nibble “n0” and a second nibble “n2” of data from a memory are transferred and mapped to a first nibble of each of two symbols of the codeword 106 .
- a first nibble “n1” and a second nibble “n3” from a memory are transferred and mapped to a second nibble of each of two symbols of the codeword 106 .
- the two symbols of the codeword 106 are adjacent and are on a 16 bit boundary of the code word, which are designated as “adjacent symbols”, thus, the codeword 106 is an adjacent symbol codeword.
- the scheme illustrated in the block diagram facilitates error detection and improves fault coverage of common mode errors.
- an x4 memory device there is a one to one mapping of nibbles from the x4 memory device to a symbol in the underlying code word.
- a x8 memory device there is a one to one mapping of nibbles from half of the x8 memory device to a symbol in the underlying code word
- the claimed subject matter facilitates isolating common mode errors across nibbles to the symbol level and results in increased fault coverage. Therefore, for the x8 memory device, the claimed subject matter precludes aliasing for a second device failure.
- device errors in the x4 memory devices are isolated to a single symbol in the codeword 106 , thus, there is complete double device coverage for the x4 memory devices.
- a simultaneous double device failure has no early sign warning because there is no indication of an error in a previous memory transaction.
- the computer system reports an uncorrectable error in the absence of an aliasing.
- the system might incorrectly report a correctable single device failure. This time the aliasing may be discovered in subsequent accesses because an error pattern might change as to preclude the alias.
- a sequential double device failure is a more typical failure pattern than a simultaneous double device failure.
- the first device error is detected as a correctable error.
- the error is reported as uncorrectable, otherwise, the error is reported as a correctable error at a new location.
- the analysis is complete. Otherwise, the system changes the error location from the first device failure to the second device's failure location. Therefore, the preceding method for detecting the alias is accurate because it is unlikely that the first device failure location resolves itself and even less likely that is does at the simultaneous instant that the second device failure has failed.
- double device errors that are always detected (no aliasing) are double bit errors, double wire faults, wire faults in one memory device with a single bit error in a second memory device, and a fault that affects only one nibble of each memory device.
- all 16 bits of the codeword may be affected (corrupted) because the failure results in an error for both nibbles and both clock phases of the memory device's data.
- the claimed subject matter facilitates the correction of this device failure by first correcting the 16 bits that are in error.
- the code detects the error pattern in two groups of 16 bits which are aligned on 16-bit boundaries in the code word 106 .
- FIG. 2 illustrates an apparatus utilized in an embodiment. From a high-level perspective, the apparatus generates a code word by creating check bits to be appended to data that is forwarded to memory. Subsequently, the apparatus generates a syndrome based at least in part on decoding the code word received from memory and facilitates classifying errors and correcting the errors.
- the code word from the memory device is an adjacent symbol codeword that was described in connection with FIG. 1 .
- the apparatus comprises an encoder circuit 202 , at least one memory device 204 , a decoder circuit 206 , an error classification circuit 208 , and a correction circuit 210 .
- the encoder circuit receives data that is to be forwarded to the memory device or memory devices 204 .
- the encoder circuit generates a plurality of check bits based at least in part on the data.
- a codeword is formed based at least in part on the plurality of check bits and the data and is forwarded to the memory device or memory devices 204 .
- the check bits are generated from the binary form of a G-matrix, wherein the matrix has 32 rows and 256 columns to form 32 check bits.
- the multiply operation becomes an AND function and the sum operation the 1-bit sum or XOR operation.
- the resulting encoding circuit comprises 32 XOR, each tree computing one of the 32 check bits.
- the memory device or memory devices 104 returns data and the check bits back to the decoder circuit 106 .
- the decoder circuit generates a 32-bit syndrome based at least in part on a 288-bit code word (as earlier described in connection with FIG. 1 for the 288-bit code word).
- the syndrome is generated from an H-matrix, wherein the matrix comprises 32 rows and 288 columns.
- the generation of the syndrome bits is simplified to a XOR operation over the code word bits corresponding to the columns of the H-matrix that have a binary 1 value.
- the decoding circuit comprises 32 XOR trees, each tree computing one of the 32 syndrome bits. Therefore, in one embodiment, a 32 bit syndrome is generated by an H matrix receiving a 288 bit codeword.
- the claimed subject matter is not limited to this bit configuration.
- One skilled in the art appreciates modifications to the size of the syndrome and codeword.
- FIG. 3 depicts a flowchart for a method utilized in an embodiment.
- the flowchart depicts a method for detecting whether there were errors in data in a transaction with a memory device or devices.
- a first block 302 generates check bits to be appended to data for forwarding to a memory device or devices.
- An adjacent symbol codeword is generated based at least in part on data received from the memory device or devices to be utilized for checking the integrity of the data, as depicted by a block 304 .
- a decoder generates a syndrome based at least in part on the adjacent symbol codeword, as depicted by a block 306 . In the presence of an error as determined by the syndrome, an error classification and correction is performed, as depicted by a block 308 .
- FIG. 4 illustrates an apparatus utilized in an embodiment described in connection with FIG. 2 . As previously described, FIG. 4 describes one embodiment of the error classification and error correction in connection with FIG. 2 .
- a single device correctable error may be classified based at least in part on a weight of the error value.
- an adjacent pair may generate error values eo and el.
- the error locator vector L is then used to gate the error values on a plurality of busses, 402 and 404 because the circuits allow for the error locator bits for one adjacent pair will be enabled for a given error pattern.
- the claimed subject matter allows for test coverage of both single and double device errors.
- FIG. 5 depicts a system in accordance with one embodiment.
- the system in one embodiment is a processor 502 that is coupled to a chipset 504 that is coupled to a memory 506 .
- the chipset performs and facilitates various operations, such as, memory transactions between the processor and memory and verifies the data integrity by utilizing the adjacent symbol codeword as described in connection with FIG. 1 .
- the chipset is a server chipset to support a computer server system.
- the chipset is a desktop chipset to support a computer desktop system.
- the system comprises the previous embodiments depicted in FIGS. 1-4 of the specification to support the adjacent symbol codeword and error correction and detection methods and apparatus.
Abstract
A circuit and method for generating an Error Correcting Code (ECC) based on an adjacent symbol codeword that is formed in two clock phases.
Description
- This application is a division of U.S. patent application Ser. No. 10/624,424, (Attorney Docket No. 042390.P15881), filed Jul. 21, 2003 entitled “A METHOD, SYSTEM, AND APPARATUS FOR ADJACENT-SYMBOL ERROR CORRECTION AND DETECTION” and is related to concurrently filed U.S. Patent Application No. (unassigned), Attorney Docket No. 042390.P15881D2, entitled “A METHOD, SYSTEM, AND APPARATUS FOR ADJACENT-SYMBOL ERROR CORRECTION AND DETECTION.”
- 1. Field
- The present disclosure pertains to the field of memory and computer memory systems and more specifically to error detection and correction for memory errors.
- 2. Description of Related Art
- Error correcting codes (ECC) have been routinely used for fault tolerance in computer memory subsystems. The most commonly used codes are the single error correcting (SEC) and double error detecting (DED) codes capable of correcting all single errors and detecting all double errors in a code word.
- As the trend of chip manufacturing is toward a larger chip capacity, more and more memory subsystems will be configured in b-bits-per-chip. The most appropriate symbol ECC to use on the memory are the single symbol error correcting (SbEC) and double symbol error detecting (DbED) codes, wherein “b” is the width (number of bits in output) of the memory device, that correct all single symbol errors and detect all double symbol errors in a code word. A memory designed with a SbEC-DbED code can continue to function when a memory chip fails, regardless of its failure mode. When there are two failing chips that line up in the same ECC word sometime later, the SbEC-DbED code would provide the necessary error detection and protect the data integrity for the memory.
- Existing and imminent memory systems utilize eighteen memory devices. However, the present SbEC-DbED error correcting codes utilize 36 memory devices in order to provide chipfail correction and detection. Thus, the cost increases due to the added expense of 36 memory devices for error correcting purposes and they are inflexible because they do not scale (adapt) to the memory systems with eighteen memory devices. Furthermore, the various circuits for encoding and decoding the errors are complex. Thus, this increases the cost and design of computer systems to insure data integrity.
- The present invention is illustrated by way of example and not limitation in the Figures of the accompanying drawings.
-
FIG. 1 illustrates a block diagram of a code word utilized in an embodiment. -
FIG. 2 illustrates an apparatus utilized in an embodiment. -
FIG. 3 illustrates a flowchart of a method utilized in an embodiment. -
FIG. 4 illustrates an apparatus utilized in an embodiment described in connection withFIG. 2 . -
FIG. 5 illustrates a system utilized in an embodiment. - The following description provides a method, apparatus, and system for error detection and correction of memory devices. In the following description, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. It will be appreciated, however, by one skilled in the art that the invention may be practiced without such specific details. Those of ordinary skill in the art, with the included descriptions, will be able to implement appropriate logic circuits without undue experimentation.
- As previously described, typical ECC code utilizes 36 memory devices for chipfail detection and correction that results in increased cost and design of a computer system. Also, with the advent of eighteen memory devices in a system, the present ECC codes do not scale. In contrast, the claimed subject matter facilitates a new ECC code, “adjacent-symbol” code that supports memory systems with 18 memory devices For example, in one embodiment, the claimed subject matter facilitates the ability for decoding and correcting memory errors in systems that utilize 18 memory devices for a memory transaction (memory rank). Furthermore, the claimed subject matter facilitates forming a code word of data with only two clock phases. Also, the adjacent-symbol ECC code corrects any error pattern within the data from one memory device and detects various errors (double device errors) from failures in 2 memory devices.
- In one embodiment, the adjacent-symbol ECC code is utilized for a memory system with two channels of Double Data Rate (DDR) memory, wherein each channel is 64 bits wide with eight optional bits for ECC. Also, the memory system may utilize x4 or x8 wide memory devices (x4 and x8 refers to the number of bits that can be output from the memory device). Thus, the claimed subject matter supports various configurations of memory systems. For example, a memory system with x8 devices would utilize 18 memory devices per memory rank if ECC is supported, otherwise, 16 memory devices per memory rank if ECC is not supported. Alternatively, a memory system with x4 devices would utilize 36 memory devices per memory rank if ECC is supported, otherwise, 32 memory devices per memory rank if ECC is not supported.
-
FIG. 1 illustrates a block diagram of a code word utilized in an embodiment. The block diagram 100 comprises anadjacent symbol codeword 106 to be formed from two clock phases ofdata first clock phase 102, a first nibble “n0” and a second nibble “n2” of data from a memory are transferred and mapped to a first nibble of each of two symbols of thecodeword 106. Subsequently, during asecond clock phase 104, a first nibble “n1” and a second nibble “n3” from a memory are transferred and mapped to a second nibble of each of two symbols of thecodeword 106. Thus, the two symbols of thecodeword 106 are adjacent and are on a 16 bit boundary of the code word, which are designated as “adjacent symbols”, thus, thecodeword 106 is an adjacent symbol codeword. - The scheme illustrated in the block diagram facilitates error detection and improves fault coverage of common mode errors. For example, for an x4 memory device, there is a one to one mapping of nibbles from the x4 memory device to a symbol in the underlying code word. In contrast, for a x8 memory device, there is a one to one mapping of nibbles from half of the x8 memory device to a symbol in the underlying code word Thus, the claimed subject matter facilitates isolating common mode errors across nibbles to the symbol level and results in increased fault coverage. Therefore, for the x8 memory device, the claimed subject matter precludes aliasing for a second device failure. Likewise, device errors in the x4 memory devices are isolated to a single symbol in the
codeword 106, thus, there is complete double device coverage for the x4 memory devices. - To further illustrate, there are typically two classes of double device failures, simultaneous and sequence, that occur in the same memory rank.
- A simultaneous double device failure has no early sign warning because there is no indication of an error in a previous memory transaction. Typically, the computer system reports an uncorrectable error in the absence of an aliasing. However, the system might incorrectly report a correctable single device failure. This time the aliasing may be discovered in subsequent accesses because an error pattern might change as to preclude the alias.
- In contrast, a sequential double device failure is a more typical failure pattern than a simultaneous double device failure. Typically, the first device error is detected as a correctable error. For a second device failure, there may be two outcomes in one embodiment; the error is reported as uncorrectable, otherwise, the error is reported as a correctable error at a new location. In the event of an uncorrectable error for the second device failure, the analysis is complete. Otherwise, the system changes the error location from the first device failure to the second device's failure location. Therefore, the preceding method for detecting the alias is accurate because it is unlikely that the first device failure location resolves itself and even less likely that is does at the simultaneous instant that the second device failure has failed.
- A few examples of double device errors that are always detected (no aliasing) are double bit errors, double wire faults, wire faults in one memory device with a single bit error in a second memory device, and a fault that affects only one nibble of each memory device.
- In one example of a device error for the x8 memory device, all 16 bits of the codeword (adjacent symbols) may be affected (corrupted) because the failure results in an error for both nibbles and both clock phases of the memory device's data. Thus, the claimed subject matter facilitates the correction of this device failure by first correcting the 16 bits that are in error. However, in the event of a second memory device failure, the code detects the error pattern in two groups of 16 bits which are aligned on 16-bit boundaries in the
code word 106. -
FIG. 2 illustrates an apparatus utilized in an embodiment. From a high-level perspective, the apparatus generates a code word by creating check bits to be appended to data that is forwarded to memory. Subsequently, the apparatus generates a syndrome based at least in part on decoding the code word received from memory and facilitates classifying errors and correcting the errors. In one embodiment, the code word from the memory device is an adjacent symbol codeword that was described in connection withFIG. 1 . - The apparatus comprises an
encoder circuit 202, at least onememory device 204, adecoder circuit 206, anerror classification circuit 208, and acorrection circuit 210. - The encoder circuit receives data that is to be forwarded to the memory device or
memory devices 204. The encoder circuit generates a plurality of check bits based at least in part on the data. Thus, a codeword is formed based at least in part on the plurality of check bits and the data and is forwarded to the memory device ormemory devices 204. - In one embodiment, the check bits are generated from the binary form of a G-matrix, wherein the matrix has 32 rows and 256 columns to form 32 check bits. The check bits are computed as follows:
c i =Σd j ×G ij for i=0 to 31 and j=0 to 255 - For binary data, the multiply operation becomes an AND function and the sum operation the 1-bit sum or XOR operation. Thus, the resulting encoding circuit comprises 32 XOR, each tree computing one of the 32 check bits.
- Subsequently, the memory device or
memory devices 104 returns data and the check bits back to thedecoder circuit 106. In one embodiment, the decoder circuit generates a 32-bit syndrome based at least in part on a 288-bit code word (as earlier described in connection withFIG. 1 for the 288-bit code word). - In one embodiment, the syndrome is generated from an H-matrix, wherein the matrix comprises 32 rows and 288 columns. Each syndrome bit is calculated as follows:
s i =Σv j ×H ij for i=0 to 31 and j=0 to 287 - As previously described with the encoder circuit, the generation of the syndrome bits is simplified to a XOR operation over the code word bits corresponding to the columns of the H-matrix that have a binary 1 value. Thus, the decoding circuit comprises 32 XOR trees, each tree computing one of the 32 syndrome bits. Therefore, in one embodiment, a 32 bit syndrome is generated by an H matrix receiving a 288 bit codeword. However, the claimed subject matter is not limited to this bit configuration. One skilled in the art appreciates modifications to the size of the syndrome and codeword.
- The error classification and error correction are described in connection with
FIG. 4 . -
FIG. 3 depicts a flowchart for a method utilized in an embodiment. The flowchart depicts a method for detecting whether there were errors in data in a transaction with a memory device or devices. Afirst block 302 generates check bits to be appended to data for forwarding to a memory device or devices. An adjacent symbol codeword is generated based at least in part on data received from the memory device or devices to be utilized for checking the integrity of the data, as depicted by ablock 304. A decoder generates a syndrome based at least in part on the adjacent symbol codeword, as depicted by ablock 306. In the presence of an error as determined by the syndrome, an error classification and correction is performed, as depicted by ablock 308. -
FIG. 4 illustrates an apparatus utilized in an embodiment described in connection withFIG. 2 . As previously described,FIG. 4 describes one embodiment of the error classification and error correction in connection withFIG. 2 . - The error classification is based at least in part on the decoding circuit's computation of the syndrome. For example, in one embodiment, if the syndrome (S)=0, then there is NO error. Otherwise, if the syndrome (S)>0, there is an error. Also, it is optional to further classify the error by computing an error location vector L. For example, in one embodiment, the error is uncorrectable if L=0. Otherwise, the error is correctable in an indicated column if L>0. Furthermore, one may further classify the correctable error as whether the error occurs in a data column or check column. For example, if the error is in a check column, the data portion of the code word may bypass the correction logic.
- In yet another embodiment, a single device correctable error may be classified based at least in part on a weight of the error value. As depicted in
FIG. 4 , an adjacent pair may generate error values eo and el. Thus, the error locator vector L is then used to gate the error values on a plurality of busses, 402 and 404 because the circuits allow for the error locator bits for one adjacent pair will be enabled for a given error pattern. - Thus, the claimed subject matter allows for test coverage of both single and double device errors.
-
FIG. 5 depicts a system in accordance with one embodiment. The system in one embodiment is aprocessor 502 that is coupled to achipset 504 that is coupled to amemory 506. For example, the chipset performs and facilitates various operations, such as, memory transactions between the processor and memory and verifies the data integrity by utilizing the adjacent symbol codeword as described in connection withFIG. 1 . In one embodiment, the chipset is a server chipset to support a computer server system. In contrast, in another embodiment, the chipset is a desktop chipset to support a computer desktop system. In both previous embodiments, the system comprises the previous embodiments depicted inFIGS. 1-4 of the specification to support the adjacent symbol codeword and error correction and detection methods and apparatus. - While certain exemplary embodiments have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not restrictive on the broad invention, and that this invention not be limited to the specific constructions and arrangements shown and described, since various other modifications may occur to those ordinarily skilled in the art upon studying this disclosure.
Claims (6)
1. A method for testing a memory comprising:
generating a plurality of check bits to append to data that is forwarded to the memory;
generating an adjacent symbol codeword based at least in part on data received from the memory;
decoding the adjacent symbol codeword; and
determining whether an error exists in the memory.
2. The method of claim 1 wherein decoding the adjacent symbol codeword comprises generating a syndrome based at least in part on the adjacent symbol codeword.
3. The method of claim 1 wherein determining whether an error exists in the memory is based at least in part on the syndrome.
4. The method of claim 3 wherein an error exists based on the syndrome, further comprising:
classifying the error in the received data; and
correcting the error in the received data.
5. The method of claim 1 wherein the memory is a Double Data Rate (DDR) memory.
6. The method of claim 2 wherein the syndrome is thirty two bits based on a two hundred eighty eight bit codeword.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/585,411 US20070061685A1 (en) | 2003-07-21 | 2006-10-23 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/624,424 US20050022091A1 (en) | 2003-07-21 | 2003-07-21 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US11/585,411 US20070061685A1 (en) | 2003-07-21 | 2006-10-23 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/624,424 Division US20050022091A1 (en) | 2003-07-21 | 2003-07-21 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/622,950 Division US20100065221A1 (en) | 2004-01-07 | 2009-11-20 | Tape supplier and refill cartridge for binding apparatus |
Publications (1)
Publication Number | Publication Date |
---|---|
US20070061685A1 true US20070061685A1 (en) | 2007-03-15 |
Family
ID=34080014
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/624,424 Abandoned US20050022091A1 (en) | 2003-07-21 | 2003-07-21 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US11/584,059 Expired - Fee Related US7496826B2 (en) | 2003-07-21 | 2006-10-20 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US11/585,411 Abandoned US20070061685A1 (en) | 2003-07-21 | 2006-10-23 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US11/968,148 Expired - Fee Related US8127213B2 (en) | 2003-07-21 | 2007-12-31 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/624,424 Abandoned US20050022091A1 (en) | 2003-07-21 | 2003-07-21 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US11/584,059 Expired - Fee Related US7496826B2 (en) | 2003-07-21 | 2006-10-20 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/968,148 Expired - Fee Related US8127213B2 (en) | 2003-07-21 | 2007-12-31 | Method, system, and apparatus for adjacent-symbol error correction and detection code |
Country Status (6)
Country | Link |
---|---|
US (4) | US20050022091A1 (en) |
EP (1) | EP1646947A2 (en) |
KR (1) | KR100865195B1 (en) |
CN (1) | CN100447750C (en) |
TW (1) | TWI259357B (en) |
WO (1) | WO2005010754A2 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080104476A1 (en) * | 2003-07-21 | 2008-05-01 | Intel Corporation | Method, system, and apparatus for adjacent-symbol error correction and detection code |
CN104486615A (en) * | 2014-12-09 | 2015-04-01 | 广东威创视讯科技股份有限公司 | Fault location method and device of DDR (Double Data Rate) chip |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
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 |
US7685392B2 (en) | 2005-11-28 | 2010-03-23 | International Business Machines Corporation | Providing indeterminate read data latency in a memory system |
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 |
KR100888695B1 (en) | 2007-02-27 | 2009-03-16 | 삼성전자주식회사 | Flash memory device for over-sampling read operation and read method thereof |
US8185801B2 (en) * | 2008-01-31 | 2012-05-22 | International Business Machines Corporation | System to improve error code decoding using historical information and associated methods |
US8181094B2 (en) * | 2008-01-31 | 2012-05-15 | International Business Machines Corporation | System to improve error correction using variable latency and associated methods |
US8185800B2 (en) * | 2008-01-31 | 2012-05-22 | International Business Machines Corporation | System for error control coding for memories of different types and associated methods |
US8140945B2 (en) * | 2008-05-23 | 2012-03-20 | Oracle America, Inc. | Hard component failure detection and correction |
CN101369242B (en) * | 2008-09-28 | 2011-06-15 | 西北工业大学 | Self-checking method for program code and data in computer internal memory |
US8533572B2 (en) | 2010-09-24 | 2013-09-10 | Intel Corporation | Error correcting code logic for processor caches that uses a common set of check bits |
US9021325B2 (en) * | 2013-02-07 | 2015-04-28 | Lsi Corporation | Classifying bit errors in transmitted run length limited data |
CN104484310A (en) * | 2014-12-11 | 2015-04-01 | 北京国双科技有限公司 | Formula normalization calibration method and device |
US9912355B2 (en) | 2015-09-25 | 2018-03-06 | Intel Corporation | Distributed concatenated error correction |
CN110209524B (en) * | 2019-06-18 | 2022-12-06 | 哈尔滨工业大学 | ECC decoder reinforcing method for resisting single-event transient effect |
KR20210138241A (en) | 2020-05-12 | 2021-11-19 | 삼성전자주식회사 | Memory controller, memory system and memory module |
US11601137B2 (en) * | 2020-06-18 | 2023-03-07 | Intel Corporation | ECC memory chip encoder and decoder |
Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3728678A (en) * | 1971-09-03 | 1973-04-17 | Bell Telephone Labor Inc | Error-correcting systems utilizing rate {178 {11 diffuse codes |
US4740968A (en) * | 1986-10-27 | 1988-04-26 | International Business Machines Corporation | ECC circuit failure detector/quick word verifier |
US5490155A (en) * | 1992-10-02 | 1996-02-06 | Compaq Computer Corp. | Error correction system for n bits using error correcting code designed for fewer than n bits |
US5748652A (en) * | 1995-06-29 | 1998-05-05 | Hyundai Electronics Ind. Co., Ltd. | Apparatus for detecting and correcting cyclic redundancy check errors |
US5768294A (en) * | 1995-12-11 | 1998-06-16 | International Business Machines Corporation | Memory implemented error detection and correction code capable of detecting errors in fetching data from a wrong address |
US5987629A (en) * | 1996-02-22 | 1999-11-16 | Fujitsu Limited | Interconnect fault detection and localization method and apparatus |
US6662336B1 (en) * | 1999-07-06 | 2003-12-09 | Cirrus Logic, Inc. | Error correction method and apparatus |
US6751769B2 (en) * | 2000-06-06 | 2004-06-15 | International Business Machines Corporation | (146,130) error correction code utilizing address information |
US6981196B2 (en) * | 2001-07-25 | 2005-12-27 | Hewlett-Packard Development Company, L.P. | Data storage method for use in a magnetoresistive solid-state storage device |
US20070061675A1 (en) * | 2003-07-21 | 2007-03-15 | Holman Thomas J | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US7234099B2 (en) * | 2003-04-14 | 2007-06-19 | International Business Machines Corporation | High reliability memory module with a fault tolerant address and command bus |
Family Cites Families (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4995041A (en) * | 1989-02-03 | 1991-02-19 | Digital Equipment Corporation | Write back buffer with error correcting capabilities |
US5278847A (en) * | 1990-12-28 | 1994-01-11 | General Electric Company | Fault-tolerant memory system with graceful degradation |
US5701314A (en) * | 1995-12-21 | 1997-12-23 | Cirrus Logic, Inc. | On-the-fly error correction using thermal asperity erasure pointers from a sampled amplitude read channel in a magnetic disk drive |
US5846249A (en) | 1996-02-07 | 1998-12-08 | Pinotage, Llc | Video gynecological examination apparatus |
US6003152A (en) | 1997-06-30 | 1999-12-14 | Sun Microsystems, Inc. | System for N-bit part failure detection using n-bit error detecting codes where n less than N |
IL122393A0 (en) * | 1997-12-01 | 1998-06-15 | Ttr Technologies Ltd | A code word for use in digital optical media and a method of generation thereof |
US6272659B1 (en) * | 1998-05-18 | 2001-08-07 | Cirrus Logic, Inc. | Error correction code processor employing adjustable correction power for miscorrection minimization |
US6405339B1 (en) * | 1999-08-31 | 2002-06-11 | International Business Machines Corporation | Parallelized programmable encoder/syndrome generator |
JP2003077294A (en) * | 2001-08-31 | 2003-03-14 | Mitsubishi Electric Corp | Memory circuit |
-
2003
- 2003-07-21 US US10/624,424 patent/US20050022091A1/en not_active Abandoned
-
2004
- 2004-07-14 KR KR1020067001341A patent/KR100865195B1/en not_active IP Right Cessation
- 2004-07-14 CN CNB2004800212847A patent/CN100447750C/en not_active Expired - Fee Related
- 2004-07-14 EP EP04778060A patent/EP1646947A2/en not_active Withdrawn
- 2004-07-14 WO PCT/US2004/022353 patent/WO2005010754A2/en active Application Filing
- 2004-07-19 TW TW093121485A patent/TWI259357B/en not_active IP Right Cessation
-
2006
- 2006-10-20 US US11/584,059 patent/US7496826B2/en not_active Expired - Fee Related
- 2006-10-23 US US11/585,411 patent/US20070061685A1/en not_active Abandoned
-
2007
- 2007-12-31 US US11/968,148 patent/US8127213B2/en not_active Expired - Fee Related
Patent Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3728678A (en) * | 1971-09-03 | 1973-04-17 | Bell Telephone Labor Inc | Error-correcting systems utilizing rate {178 {11 diffuse codes |
US4740968A (en) * | 1986-10-27 | 1988-04-26 | International Business Machines Corporation | ECC circuit failure detector/quick word verifier |
US5490155A (en) * | 1992-10-02 | 1996-02-06 | Compaq Computer Corp. | Error correction system for n bits using error correcting code designed for fewer than n bits |
US5748652A (en) * | 1995-06-29 | 1998-05-05 | Hyundai Electronics Ind. Co., Ltd. | Apparatus for detecting and correcting cyclic redundancy check errors |
US5768294A (en) * | 1995-12-11 | 1998-06-16 | International Business Machines Corporation | Memory implemented error detection and correction code capable of detecting errors in fetching data from a wrong address |
US5987629A (en) * | 1996-02-22 | 1999-11-16 | Fujitsu Limited | Interconnect fault detection and localization method and apparatus |
US6662336B1 (en) * | 1999-07-06 | 2003-12-09 | Cirrus Logic, Inc. | Error correction method and apparatus |
US6751769B2 (en) * | 2000-06-06 | 2004-06-15 | International Business Machines Corporation | (146,130) error correction code utilizing address information |
US6981196B2 (en) * | 2001-07-25 | 2005-12-27 | Hewlett-Packard Development Company, L.P. | Data storage method for use in a magnetoresistive solid-state storage device |
US7234099B2 (en) * | 2003-04-14 | 2007-06-19 | International Business Machines Corporation | High reliability memory module with a fault tolerant address and command bus |
US20070061675A1 (en) * | 2003-07-21 | 2007-03-15 | Holman Thomas J | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US20080104476A1 (en) * | 2003-07-21 | 2008-05-01 | Intel Corporation | Method, system, and apparatus for adjacent-symbol error correction and detection code |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080104476A1 (en) * | 2003-07-21 | 2008-05-01 | Intel Corporation | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US7496826B2 (en) | 2003-07-21 | 2009-02-24 | Intel Corporation | Method, system, and apparatus for adjacent-symbol error correction and detection code |
US8127213B2 (en) | 2003-07-21 | 2012-02-28 | Intel Corporation | Method, system, and apparatus for adjacent-symbol error correction and detection code |
CN104486615A (en) * | 2014-12-09 | 2015-04-01 | 广东威创视讯科技股份有限公司 | Fault location method and device of DDR (Double Data Rate) chip |
Also Published As
Publication number | Publication date |
---|---|
WO2005010754A2 (en) | 2005-02-03 |
EP1646947A2 (en) | 2006-04-19 |
KR20060061335A (en) | 2006-06-07 |
TW200508851A (en) | 2005-03-01 |
US20070061675A1 (en) | 2007-03-15 |
CN1826588A (en) | 2006-08-30 |
US20050022091A1 (en) | 2005-01-27 |
TWI259357B (en) | 2006-08-01 |
WO2005010754A3 (en) | 2005-04-14 |
US7496826B2 (en) | 2009-02-24 |
KR100865195B1 (en) | 2008-10-23 |
US8127213B2 (en) | 2012-02-28 |
US20080104476A1 (en) | 2008-05-01 |
CN100447750C (en) | 2008-12-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7496826B2 (en) | Method, system, and apparatus for adjacent-symbol error correction and detection code | |
US11734106B2 (en) | Memory repair method and apparatus based on error code tracking | |
US8327222B2 (en) | Mechanism for adjacent-symbol error correction and detection | |
US6044483A (en) | Error propagation operating mode for error correcting code retrofit apparatus | |
US10169126B2 (en) | Memory module, memory controller and systems responsive to memory chip read fail information and related methods of operation | |
US9646716B2 (en) | Circuit arrangement and method with modified error syndrome for error detection of permanent errors in memories | |
US6662333B1 (en) | Shared error correction for memory design | |
US7765454B2 (en) | Fault tolerant memory system | |
US9195551B2 (en) | Enhanced storage of metadata utilizing improved error detection and correction in computer memory | |
US11372715B2 (en) | Error correction hardware with fault detection | |
US6463563B1 (en) | Single symbol correction double symbol detection code employing a modular H-matrix | |
US11934263B2 (en) | Parity protected memory blocks merged with error correction code (ECC) protected blocks in a codeword for increased memory utilization | |
US10740179B2 (en) | Memory and method for operating the memory | |
US20170346505A1 (en) | Circuits and methods for writing and reading data | |
JPS6133221B2 (en) |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |