US 6,584,595 B2Grant
Technique for correcting single-bit errors in caches with sub-block parity bits
Issue Date:2003-06-24
•18 Claims
•7 Drawing Sheets
Abstract
A data block includes a plurality of sub-blocks. Each sub-block includes a sub-block check bit that may be used to detect the presence of a bit error within the sub-block. A composite sub-block is generated, which is the column-wise exclusive-or of the bits of each sub-block. In one embodiment, the composite sub-block is not stored, but rather used for computational purposes only. A plurality of composite check bits is used to detect a bit position of a bit error within the composite sub-block. If a bit error within the data block occurs, the sub-block check bits may be used to detect in which sub-block the error occurred. The composite check bits may be used to determine which bit position of the composite sub-block is erroneous. The erroneous bit position of the composite sub-block also identifies the bit position of the erroneous bit in the sub-block identified by the sub-block check bits. Accordingly, the sub-block and the bit position within the sub-block may be detected by using the sub-block check bits and the composite check bits.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventor
- Robert Cypher
Application Information
Application Number:US 09/975,225
Filing Date:2001-10-11
Priority Date:1998-09-24
Art Unit:7
Classifications
IPC:
G11C 2900G06F 1100
Field of Search:
714763714758714764714766714757714746714752714799714800714802714701714702
Patent Drawings (7 sheets)
Description
[0002] This is a continuation of application Ser. No. 09/160,214 filed Sep. 24, 1998 U.S. Pat. No. 6, 301,992.
Background of the Invention
[0003] 1. Field of the Invention
[0004] This invention relates to error correction and more particularly, to error codes that correct bit errors in computer memory systems.
[0005] 2. Description of the Relevant Art
[0006] Error codes are commonly used in electronic systems to detect and/or correct data errors, such as transmission errors or storage errors. For example, error codes may be used to detect and correct errors within data transmitted via a telephone line, a radio transmitter or a compact disc laser. Another common use of error codes is to detect and correct errors within data stored in a memory of a computer system. For example, error correction bits, or check bits, may be generated for data prior to storing data to one or more memory devices. When the data are read from the memory device, the check bits may be used to detect or correct errors within the data. Errors may be introduced either due to faulty components or noise within the computer system. Faulty components may include faulty memory devices or faulty data paths between devices within the computer system, such as faulty pins.
[0007] Hamming codes are one commonly used error code. The check bits in a Hamming code are parity bits for portions of the data bits. Each check bit provides the parity for a unique subset of the data bits. If an error occurs, i.e. one or more bits change state, one or more syndrome bits will be asserted (assuming the error is within the class of errors covered by the code). Generally speaking, syndrome bits are generated by regenerating the check bits and comparing the regenerated check bits to the original check bits. If the regenerated check bits differ from the original check bits, an error has occurred and one or more syndrome bits will be asserted. Which syndrome bits are asserted may also be used to determine which data bit changes state, and enable the correction of the error. For example, if one data bit changes state, this data bit will modify one or more check bits. Because each data bit contributes to a unique group of check bits, the check bits that are modified will identify the data bit that changed state. The error may be corrected by inverting the bit identified to be erroneous.
[0008] One common use of Hamming codes is to correct single bit errors within a group of data. Generally speaking, the number of check bits must be large enough such that 2k−1is greater than or equal to n, where k is the number of check bits and n is the number of data bits plus the number of check bits. Accordingly, seven check bits are required to implement a single error correcting Hamming code for 64 bits data block. A single error correcting Hamming code is able to detect and correct a single error. The error detection capability of the code may be increased by adding an additional check bit. The use of an additional check bit allows the Hamming code to detect double bit errors and correct single bit errors. The addition of a bit to increase the data detection capabilities of a Hamming code is referred to as an extended Hamming code.
[0009] In a single error correction code, such as a Hamming code, multiple bit errors may cause one or more syndromes to be non-zero. However, multiple bit errors may erroneously appear as a single bit error in a different bit position. For example, in a single error correcting Hamming code with six check bits, one bit error may cause two check bits to change states. Another bit error may cause two other check bits to change state. Accordingly, if these two errors occur, four check bits will change state. Unfortunately, a one-bit error in still another bit position may cause those same four check bits to change state. The error correction procedure may assume the bit that affects all four check bits changed state and invert the data bit. If the check bit changes were actually caused by two bit errors, the error correction procedure has inverted a non-erroneous bit. Accordingly, the error correction procedure has created more errors, and may erroneously indicate that the data is error free.
[0010] The addition of an extended parity bit resolves this problem. When the data are read from memory, the check bits and extended parity bit are regenerated and compared to the original check bits and extended parity bit. If the regenerated check bits are different than the original check bits, the extended parity bit may be used to determine whether one or two bit errors occurred. If one error occurs, the regenerated extended parity bit will differ from the original extended parity bit. If two errors occur, the regenerated extended parity bit will be the same as the original extended parity bit. If one or more check bits change state and the regenerated extended parity bit is different, a single bit error has occurred and is corrected. Alternatively, if one or more check bits change state and the extended parity bit is the same, two bit errors are detected and no correction is performed. In the latter case, an uncorrectable error may be reported to a memory controller or other component within the computer system. It is noted, that more than two bit errors in a logical group is not within the class of errors addressed by the error correcting code. Accordingly, three or more errors may go undetected or the error correcting code may interpret the errors as a single bit error and invert a data bit that was not erroneous.
[0011] Parity checking is a commonly used technique for error detection. A parity bit, or check bit, is added to a group of data bits. The check bit may be asserted depending on the number of asserted data bits within the group of data bits. If even parity is used, the parity bit will make the total number of asserted bits, including the data bits and check bit, equal to an even number. If odd parity if used, the parity bit will make the total number of asserted bits, including the data bits and check bit, an odd number. Parity checking is effective for detecting an odd number of errors. If an even number of errors occurs, however, parity checking will not detect the error.
[0012] One common use of error codes is to detect and correct bit errors of data stored in a cache of a computer memory system. Generally speaking, a cache is a buffer between a processor and relatively slow memory devices. The cache is typically smaller and faster than main memory, and stores data recently accessed by the processor. Because of the repetitive nature of computer programs, the processor is more likely to access recently accessed information than other information in the memory. Accordingly, by storing recently used data in the faster cache, the average access time of data may be reduced. Reducing the access time of data reduces the time in which the processor is waiting for data from memory, which increases the overall speed of the processor.
[0013] Turning now to FIG. 1, portions of a computer system that implements a cache is shown. Computer system 100 includes processor 102, cache 104, memory controller 106, and system memory 108. Other portions of computer system 100 are eliminated for simplicity. Processor 102 is coupled to cache 104. Cache 104 is coupled to memory controller 106, which is in turn coupled to system memory 108. It is noted that the computer system of FIG. 1 is for illustrative purposes only. Other configurations of a processor, cache and system memory are contemplated.
[0014] Processor 102 requests data from system memory 108 by initiating a memory read request on processor bus 110. Cache 104 receives the memory read request and determines whether the requested data are stored in cache. If the requested data are stored in cache, cache 104 supplies the data to processor 102. Alternatively, if the requested data are not stored in cache, cache 104 initiates a memory read request to memory controller 106 to read the data. In one embodiment, memory controller 106 accesses the data from system memory 108 and stores the data to cache 104, which in turn supplies the data to processor 102. Alternatively, the data from memory controller 106 may be conveyed to processor 102 in parallel with storing the data to cache 104. When processor 102 writes to data stored in cache 104, several techniques for maintaining coherency may be implemented. For example, the data may be written to both cache 104 and memory 108, or the data may be invalidated in cache 104 and written to memory 108 only. The above described operation of computer system 100 is for illustrative purposes only and is not intended to limit the scope of the claims.
[0015] It is a common design goal of computer systems to reduce the number of check bits used to detect and correct errors. The check bits increase the amount of data handled by the system, which may increase the number of memory components, data paths and other circuitry. Further, the increased number of bits increases the probability of an error. Although the check bits may make an error detectable and/or correctable, increasing the number of data bits within the system increases the probability of an error occurring. For at least these reasons, it is desirable to decrease the number of check bits for a given level of error detection and/or correction.
Summary of the Invention
[0016] The present invention reduces the number of check bits required to correct errors in a data block that includes a plurality of sub-blocks. Each sub-block includes a sub-block check bit that may be used to detect the presence of a bit error within the sub-block. A composite sub-block is generated, which is the column-wise exclusive-or of the bits of each sub-block. In other words, a first bit of the composite sub-block is the exclusive-or of all the bits in a first column position of the sub-blocks. The second bit of the composite sub-block is the exclusive-or of all the bits in a second column position of the sub-blocks, etc. In one embodiment, the composite sub-block is not stored, but rather used for computational purposes only. A plurality of composite check bits is generated to detect a bit position of an error within the composite sub-block. If a bit error within the data block occurs, the sub-block check bits may be used to detect in which sub-block the error occurred. The composite check bits may be used to determine which bit position of the composite sub-block is erroneous. The erroneous bit position of the composite sub-block also identifies the bit position of the erroneous bit in the sub-block identified by the sub-block check bits. Accordingly, the sub-block and the bit position within the sub-block may be detected by using the sub-block check bits and the composite check bits.
[0017] Broadly speaking, the present invention contemplates a method of correcting a bit error in a data block comprising: partitioning the data block into a plurality of sub-blocks, wherein each sub-block includes a plurality of bit positions; generating a first sub-block check bit for a first sub-block, wherein the first sub-block check bit is configured to detect an error within the first sub-block; generating a composite sub-block, wherein each bit of the composite sub-block corresponds to a bit position in the plurality of sub-blocks; generating composite check bits for the composite sub-block, wherein the composite check bits are configured to detect and locate a bit error in the composite sub-block; detecting an erroneous bit in the first sub-block using the first sub-block check bit and determining a bit position of the erroneous bit using the composite check bits; and inverting the erroneous bit.
[0018] The present invention further contemplates a computer memory that corrects a bit error in a data block. The computer memory includes one or more storage devices and an error correction circuit coupled to the one or more storage devices. The one or more storage devices are configured to store a plurality of sub-blocks of the data block. Each of the sub-blocks includes a plurality of bit positions. The error correction circuit is configured to receive the data block, to generate sub-block check bits for each of the sub-blocks, to generate a composite sub-block, and to generate composite check bits to detect a bit position of an erroneous bit within the composite sub-block. The sub-block check bits and the composite check bits are stored in the one or more storage devices. When a data block with an erroneous bit is read from the one or more storage devices, the error correction circuit uses the sub-block check bits to determine a sub-block that includes the erroneous bit and the composite check bits to determine a bit position of the erroneous bit within the sub-block that includes the erroneous bit.
[0019] The present invention still further contemplates a cache that corrects a bit error in a data block. The cache includes one or more storage devices and an error correction circuit coupled to the one or more storage devices. The one or more storage devices are configured to store a plurality of sub-blocks of the data block. Each of the sub-blocks includes a plurality of bit positions. The error correction circuit is configured to receive the data block, to generate sub-block check bits for each of the sub-blocks, to generate a composite sub-block, and to generate composite check bits to detect a bit position of an erroneous bit within the composite sub-block. The sub-block check bits and the composite check bits are stored in the one or more storage devices. When a data block with an erroneous bit is read from the one or more storage devices, the error correction circuit uses the sub-block check bits to determine a sub-block that includes the erroneous bit and the composite check bits to determine a bit position of the erroneous bit within the sub-block that includes the erroneous bit.
Brief Description of the Drawings
[0020] Other objects and advantages of the invention will become apparent upon reading the following detailed description and upon reference to the accompanying drawings in which:
[0021] FIG. 1 is a block diagram of a processor, cache, and system memory;
[0022] FIG. 2 is a block diagram of a cache;
[0023] FIG. 3A illustrates a configuration of a cache entry according to one embodiment of the present invention;
[0024] FIG. 3B illustrates a configuration of a sub-block of a cache entry according to one embodiment of the present invention;
[0025] FIG. 3C illustrates a configuration of a check bit block associated with a data block stored in a cache;
[0026] FIG. 4 illustrates the organization of a data block that includes error correction codes to correct single bit errors;
[0027] FIG. 5 illustrates an improved organization of a data block that includes error correction codes to correct single bit errors according to one embodiment of the present invention;
[0028] FIG. 6 is a flowchart diagram of a method for correcting single bit errors in caches with sub-block parity bits; and
[0029] FIG. 7 is a block diagram of a computer system with a cache and system memory according to an embodiment of the present invention.
[0030] While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the drawings and detailed description thereto are not intended to limit the invention to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention as defined by the appended claims.
Detailed Description of the Preferred Embodiments
[0031] Turning now to FIG. 2, a block diagram of cache 104 according to one embodiment of the present invention is shown. In the illustrated embodiment, cache 104 includes storage unit 202, error correction unit 206 and cache controller 208. Other portions of cache 202 have been omitted for simplicity. Storage unit 202 includes a plurality of entries 204A-204X. Components designated by a reference numeral followed by a letter may be collectively referred to by the reference numeral alone. For example, cache entries 204A-204X may be referred to as cache entries 204. Generally speaking, cache controller 208 is configured to receive memory access requests from processor 102 and determine whether the requested data is present in storage unit 202. If the memory access is a read request and the requested data are stored in storage unit 202, cache controller 208 sends control signals to storage unit 202 to output the requested data. The requested data are provided to error correction unit 206, which detects and corrects one or more bit errors in the data. Alternatively, if the requested data are not present in storage unit 202, cache controller 208 is configured to send a request for the data to memory controller 106. When the data are received, the data are provided to error correction unit 206, which generates a plurality of check bits that are stored with the data in storage unit 202. If all entries are currently occupied, cache controller 208 uses one of several conventional algorithms to determine which entry the new data overwrites. For example, cache controller 208 may overwrite the least recently used entry of storage unit 202.
[0032] If the memory access is a write request and the requested data are stored in storage unit 202, several conventional techniques for maintaining coherency between cache 104 and memory 108 may be implemented. For example, the data may be written to both cache 104 and memory 108, or the data in the cache 104 may be invalidated and written to memory 108 only.
[0033] It is noted that cache 104 may be directly mapped or set associative. In one particular embodiment, storage unit 202 stores 64 byte cache lines. Each cache line includes two entries of 32 bytes each. In one particular embodiment, data may be accessed by reading or writing a 32 byte entry or by one byte writes. In one embodiment, each entry includes 32 bytes of data (or 256 bits of data) and 41 check bits. Accordingly, each entry includes 297 bits.
[0034] Turning now to FIG. 3A, a configuration of a cache entry according to one embodiment of the present invention is shown. In the illustrated embodiment, cache entry 204A includes 32 sub-blocks (S[0:31]) and one check bit block (CB). Each sub-block stores a plurality of data bits and one or more check bits that may be used to detect errors within the sub-block. The check bit block includes a plurality of check bits used to detect and correct bit errors within entry 204A.
[0035] Turning now to FIG. 3B, a configuration of a sub-block of a cache entry according to one embodiment of the present invention is shown. In the illustrated embodiment, a sub-block (S[x]) includes eight bits of data (D[x][0:7]) and one sub-block check bit (C[x]). In one particular embodiment, the sub-block check bit is a parity bit of the eight data bits. The sub-block check bit may be used to detect a bit error within the data bits. As discussed above, the sub-block check bit may be generated by error correction unit 206 prior to storing data to entry 204A.
[0036] Turning now to FIG. 3C, a configuration of a check bit block of a cache entry is shown. In the illustrated embodiment, the check bit block includes nine entry check bits. (CB[0:8]). In one particular embodiment, the nine entry check bits implement a single error correcting Hamming code for the 256 data bits and 32 check bits in the entry. Accordingly, if the sub-block check bits detect an error in the data block, the entry check bits may be used to locate and correct the erroneous bit.
[0037] In one embodiment, when a single-byte is read, the sub-block check bit corresponding to the read sub-block is checked to determine whether the sub-block includes any bit errors. If no bit errors are detected, the data of the sub-block are used. Alternatively, if a bit error is detected, then the data from each sub-block in the entry are read and the sub-block check bits are used to detect other bit errors. If multiple bit errors are detected, then an uncorrectable error is reported. If only one bit error is detected, then the entry check bits are recomputed and compared to the stored entry check bits in order to determine the bit position of the erroneous bit.
[0038] When an entry is read, the sub-block check bits of the bytes of the entry are checked. If no bit errors are detected, the data are used without correction. If multiple bit errors are detected, an uncorrectable error is reported. If one bit error is detected, the entry check bits are used to correct the bit error. In the above manner, error free data may be read from the cache without using the entry check bits to verify the accuracy of the data. When an erroneous bit is detected, however, the entry check bits may be used to correct the erroneous bit.
[0039] During a one byte write operation, all the sub-blocks of the entry are read and the check bits are checked. If no errors are detected, then the data are written to the appropriate sub-block and new entry check bits are generated and stored. Alternatively, if a single sub-block check bit is incorrect, the entry check bits are regenerated and compared to the stored entry check bits and the erroneous bit is corrected. The new data are then stored to the appropriate sub-block and new entry check bits are generated and stored. During a 32-byte write, the sub-block and entry check bits are generated, and the data and check bits are stored.
[0040] Turning now to FIG. 4, the organization of a data block that includes error correction codes to correct single bit errors is shown. In the illustrated embodiment, the data bits and check bits of entry 204A are shown. As discussed above, entry 204A includes 32 sub-blocks (S[0:31]). Each sub-block includes eight data bits (D[x][0:7]) and one sub-block check bit (C[x]). In one embodiment, the check bit of a sub-block is a parity bit of the eight data bits within the sub-block. Entry 204A additionally includes a check bit block (CB). The check bit block includes a plurality of entry check bits that may be used to detect and correct a bit error within the data bits of entry 204A. In one embodiment, the check bit block stores a nine bit Hamming code that covers the 256 data bits and 32 check bits of entry 204A.
[0041] Turning now to FIG. 5, an improved organization of a data block that includes error correction codes to correct single bit errors according to one embodiment of the present invention is shown. In the illustrated embodiment, cache entry 204A includes 32 sub-blocks (S[0:31]) of eight data bits and one check bit each. The check bit block of FIG. 4 has been replaced with a composite check bit block (CCB). The composite check bit block (CCB) includes four composite check bits. Generally speaking, the composite check bits are an error code to locate an error within a composite sub-block. The composite sub-block is the column-wise exclusive-or of the sub-blocks. In other words, the first bit of the composite sub-block (CS[0]) is the exclusive-or of the first bit of each sub-block (D[x][0]). The second bit of the composite sub-block (CS[1]) is the exclusive-or of the second bit of each sub-block (D[x][1]), etc. Accordingly, in the illustrated embodiment, the composite sub-block includes nine bits. One bit of the composite sub-block corresponds to each data bit position within the sub-blocks and one bit corresponds to the check bit position within the sub-blocks.
[0042] If a bit error occurs, the bit in the composite sub-block corresponding to the bit position of the erroneous bit will change state. By locating the bit that changes state in the composite sub-block, the bit position of an erroneous bit within a sub-block may be located. Accordingly, the sub-block check bits may be used to locate which sub-block includes an erroneous data bit, and the composite check bits may be used to locate the bit position of the erroneous bit within that sub-block.
[0043] In one embodiment, the composite check bits are a single error correcting Hamming code for the nine bits for the composite sub-block. In the above-described manner, the number of check bits required to locate a bit error may be reduced. In the illustrated embodiment, the nine entry check bits of FIG. 4 are replaced by four composite check bits. It is noted that the composite sub-block is not stored in the cache. The composite sub-block is used as an intermediate step in calculating the composite check bits, which are stored in the cache entry.
[0044] As discussed above, in one embodiment, data are read in 32 byte blocks. Accordingly, when data are read from cache 202, an entry including 256 data bits and 36 check bits are provided to error detection circuit 206. Error correction unit 206 uses the sub-block check bit associated with each sub-block to determine whether a bit error occurs within that sub-block. If no errors are detected within the read sub-blocks, then the data are output without correction. If one of the sub-blocks contains an error, then the composite sub-block is regenerated, composite check bits are regenerated, and the regenerated composite check bits are compared to the stored composite check bits to locate the bit position of the error within the composite sub-block. The bit position of the error within the composite sub-block corresponds to the bit position of the erroneous bit in the sub-block that includes the erroneous bit. Alternatively, if an error is detected in two or more sub-blocks, then an uncorrectable error has occurred. The uncorrectable error may be reported to the system or the entry may be read again.
[0045] When a one byte write operation is performed, all stored sub-blocks of the entry are provided to error correction unit 206. Error correction unit 206 uses the sub-block check bits to detect bit errors within the entry. If a correctable error is detected, it is corrected using the composite check bits. If no uncorrectable errors are detected, then the byte and associated sub-block check bit are written to the entry and new composite check bits are generated. It is noted that the stored byte and check bit must be read prior to storing the new byte and check bit in order to detect and correct bit errors within the entry.
[0046] Table 1 below illustrates the bits of the composite sub-block (CS[0:7] and CS[P]) that contribute to each bit of the composite check bits (CCB[0:3]). Each row represents one of the four composite check bits. Each column represents one bit of the composite sub-block. Each bit of the composite sub-block that contributes to a composite check bit has a one in the corresponding box. For example, composite check bit three (CCB[3]) is the parity bit of CS[4:7] and CS[P]. It is noted that this is the equivalent of taking the exclusive-or of the bits in bit positions 4-7 and the check bits of all the sub-blocks.
| TABLE 1 | |
|---|---|
| CS[i]: |
[0047] In one embodiment, when the composite check bits are used to detect a bit position of an erroneous bit, syndrome bits (S[3:0]) are generated. Table 2 below illustrates which bits contribute to each syndrome bit. For example, S[3] is the exclusive-or of composite sub-block bits CS[4:7] and CS[P], and CCB [3]. The bit position of an error may be located by searching Table 2 to find the column which matches S[3:0]. The syndrome bits to which an erroneous bit contribute match the syndrome bits. If the syndrome bits do not match a column of Table 2, then more than one bit error has occurred.
| TABLE 2 | ||
|---|---|---|
| CS[x]: |
[0048] Turning now to FIG. 6, a method of correcting single bit errors in data blocks with sub-block check bits according to one embodiment of the present invention is shown. In step 602, the data block is partitioned into a plurality of sub-blocks. Each sub-block includes a plurality of bit positions. In step 604, a sub-block check bit for each sub-block is generated. The sub-block check bit may be used to detect an error within the sub-block. In one embodiment, the sub-block check bit is a parity bit for the data bits within the sub-block. In step 606, a composite sub-block is generated. A composite sub-block is the column-wise exclusive-or of the sub-blocks. It is noted that the composite sub-block is for computational purposes only and is not stored with the data block.
[0049] In step 608, composite check bits are generated for the composite sub-block. The composite check bits are an error code for the composite sub-block. The composite check bits may be used to detect and locate a bit position of an error within the composite sub-block. In one embodiment, the composite check bits are a single error correcting Hamming code for the composite sub-block. In step 610, the sub-block check bits are used to detect a bit error within a sub-block. In step 612, the composite check bits are used to detect the bit position of the error within the composite sub-block. The bit position of the error within the composite sub-block indicates the bit position of the error in the sub-block that contains the erroneous bit. In step 614 the erroneous bit is corrected by inverting the bit identified by the sub-block check bits and the composite check bits.
[0050] Turning now to FIG. 7, a block diagram of a computer system with a cache and system memory for correcting single bit errors with sub-block parity bits is shown. Computer system 700 includes a cache 725, a system memory 720, a bus 730 and peripheral devices 770 and 775. It should be noted that computer system 700 is only shown as an example and many other configurations are contemplated. System memory 720 and cache 725, both include storage unit 702, controller 708, and error correction unit 706 of the present invention; respectively. It should be also noted that cache unit 725 may be included within processor 710. Further, either the cache or the system memory may include the error detection unit 706 of the present invention. Bus 730 as shown is a system bus for simplicity, however, computer system 700 may include other buses. Instructions executed in processor 710 may control data movements among processor 710, cache 725, and system memory 720, and peripheral devices 770 and 775 through bus 730. Further, data movements may be also achieved directly between processor 710 and cache 725 and between cache 725 and system memory 720. Other algorithms, including cache coherency are contemplated. It should be noted that the number of buses, processors, caches, memories, and peripheral deices may vary within system 700. Error detection unit 706 may also be included within cache 725 and/or system memory 720 or outside these elements, such as in processor 710, bus 730, within a peripheral device, or the combination of such elements of the system.
[0051] While the present invention has been described with reference to particular embodiments, it will be understood that the embodiments are illustrative and that the invention scope is not so limited. Any variations, modifications, additions and improvements to the embodiments described are possible. These variations, modifications, additions and improvements may fall within the scope of the invention as detailed within the following claims.
Claims
What is claimed is:
1. A system configured to facilitate data error detection and correction, said system comprising:
a circuit configured to:
receive a data block;
partition said data block into a plurality of sub-blocks, wherein each sub-block includes a first number of a plurality of bit positions;
generate a check bit corresponding to each of said sub-blocks;
generate composite check bits corresponding to said data block, wherein said composite check bits include a number of bits less than said first number of bits; and
determine a bit position of an erroneous bit in a first sub-block of said sub-blocks using said composite check bits;
a storage device coupled to said circuit, wherein said storage device is configured to store said data block, said check bits, and said composite check bits.
2. The system of claim 1, wherein said circuit is further configured to detect the presence of an erroneous bit in said first sub-block using a sub-block check bit corresponding to said first sub-block.
3. The system of claim 2, wherein said circuit is further configured to correct said erroneous bit by inverting said bit.
4. The system of claim 1, wherein said circuit is further configured to generate a composite sub-block corresponding to said data block.
5. The system of claim 4, wherein said circuit is configured to utilize said composite sub-block to generate said composite check bits.
6. The system of claim 4, wherein each bit of said composite sub-block is the column-wise exclusive-or of corresponding bits within said plurality of sub-blocks.
7. The system of claim 4, wherein said composite check bits implement a single error correcting Hamming code for said composite sub-block.
8. The system of claim 1, wherein said check bits generated for said sub-blocks are parity bits.
9. The system of claim 1, wherein said check bit corresponding to each of said sub-blocks is derived solely from said sub-block corresponding to said check bit.
10. A method for facilitating data error detection and correction, said method comprising:
receiving a data block;
partitioning said data block into a plurality of sub-blocks, wherein each sub-block includes a first number of a plurality of bit positions;
generating a check bit corresponding to each of said sub-blocks;
generating composite check bits corresponding to said data block, wherein said composite check bits include a number of bits less than said first number of bits; and
determining a bit position of an erroneous bit in a first sub-block of said sub-blocks using said composite check bits.
11. The method of claim 10, further comprising detecting the presence of an erroneous bit in said first sub-block using a sub-block check bit corresponding to said first sub-block.
12. The method of claim 11, further comprising correcting said erroneous bit by inverting said bit.
13. The method of claim 10, further comprising generating a composite sub-block corresponding to said data block.
14. The method of claim 13, further comprising utilizing said composite sub-block to generate said composite check bits.
15. The method of claim 13, further comprising performing a column-wise exclusive-or of corresponding bits within said plurality of sub-blocks to generate bits of said composite sub-block.
16. The method of claim 13, wherein said composite check bits implement a single error correcting Hamming code for said composite sub-block.
17. The method of claim 10, wherein said check bits generated for said sub-blocks are parity bits.
18. The method of claim 10, further comprising deriving said check bit corresponding to each of said sub-blocks solely from said sub-block corresponding to said check bit.
Patent Citations (33)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| USRE30187(E) | 1980-01-01 | Hong et al. | Applicant |
| US4211997(A) | 1980-07-01 | Rudnick et al. | Applicant |
| US4334309(A) | 1982-06-01 | Bannon et al. | Applicant |
| US4358848(A) | 1982-11-01 | Patel | Applicant |
| US4447902(A) | 1984-05-01 | Wilkinson | Applicant |
| US4491943(A) | 1985-01-01 | Igo et al. | Applicant |
| US4617664(A) | 1986-10-01 | Aichelmann, Jr. et al. | Examiner |
| US4719628(A) | 1988-01-01 | Ozaki et al. | Examiner |
| US4785451(A) | 1988-11-01 | Sako et al. | Examiner |
| US4845664(A) | 1989-07-01 | Aichelmann, Jr. et al. | Applicant |
| US4862462(A) | 1989-08-01 | Zulian | Applicant |
| US4953164(A) | 1990-08-01 | Asakura et al. | Applicant |
| US4995041(A) | 1991-02-01 | Hetherington et al. | Applicant |
| US5099484(A) | 1992-03-01 | Smelser | Applicant |
| US5245428(A) | 1993-09-01 | With et al. | Applicant |
| US5251219(A) | 1993-10-01 | Babb | Examiner |
| US5291498(A) | 1994-03-01 | Jackson et al. | Applicant |
| US5369650(A) | 1994-11-01 | Kirk et al. | Applicant |
| US5396239(A) | 1995-03-01 | McMahon et al. | Applicant |
| US5537426(A) | 1996-07-01 | Chen | Applicant |
| US5642366(A) | 1997-06-01 | Lee et al. | Applicant |
| US5671239(A) | 1997-09-01 | Higashitani et al. | Applicant |
| US5734678(A) | 1998-03-01 | Paneth et al. | Applicant |
| US5777307(A) | 1998-07-01 | Yamazaki | Applicant |
| US5784391(A) | 1998-07-01 | Konigsburg | Applicant |
| US5841795(A) | 1998-11-01 | Olarig et al. | Applicant |
| US5922080(A) | 1999-07-01 | Olarig | Applicant |
| US5970207(A) | 1999-10-01 | De With et al. | Applicant |
| US6141789(A) | 2000-10-01 | Cypher | Applicant |
| US6233716(B1) | 2001-05-01 | Cypher | Applicant |
| US6282686(B1) | 2001-08-01 | Cypher | Applicant |
| US6301680(B1) | 2001-10-01 | Cypher | Applicant |
| US6304992(B1) | 2001-10-01 | Cypher | Examiner |
Non-Patent Literature (15)
- Alzahrani et al., “On-Chip TEC_QED ECC for ultra-Large, Single-Chip Memory System,” Proceedings of the International conference on Computer Design: VLSI in computers and processors, Oct. 1994, pp. 132-137.Applicant
- Fuja et al., “Linear Sum Codes for Random, Access Memories,” IEEE Transactions on Computers, vol. 37 No. 9, Sep. 1988, pp. 1030-1041.Applicant
- Mangelsdorf et al., “A VLSI Processor for HP Precision Architecture,” Hewlett-Packard Journal, vol. 38, No. 9, Sep. 198 pp. 4-11, 17.Applicant
- Castagnoli et al., “Optimization of Cyclic Redundancy-Check Codes with 24 and 32 Parity Bits,” IEEE Transactions on Communications, vol. 41, No. 6, Jun. 1993, pp. 883-892.Applicant
- Dell “A White Paper on the Benefits of Chipkill-Correct ECC for PC Server Main Memory,” IBM Microelectronics Division, Nov. 1997, pp. 1-23.Applicant
- “Parallel Parity,” http://bbs-koi.uniinc.msk.ru/tech1/er_cont/block.htm, 1994, 1 page.Applicant
- “Modulo-2 Arithmetic,” http://bbs-koi.uniinc.msk.ru/tech1/1994/er_cont/modulo.htm, 1994, 1 page.Applicant
- “Introduction to Error Control,” ,http://bbs-koi.uniinc.msk.ru/tech1/1994/er_cont/intro.htm, 1994, 1 page.Applicant
- Barker et al. “ASCII Table,” http::/www.eng2.uconn.edu/cse/Cour...08w/References/Ref_ASCIITable.html., Feb. 1998, 1 pg.Applicant
- “Parity & Computing Parity,” http://bbs-koi.uniinc.msk.ru/tech1/1994/er_cont/parity.htm, 1994, 2 pgs.Applicant
- “Error Correction with Hamming Codes,” http://bbs-koi.uniinc.msk.ru/tech1/1994/er_cont/hamming.htm, 1994, 2 pgs.Applicant
- Barker et al. “Hamming Code, Background Information,” http://www.eng2.uconn.edu/cse/Courses/CSE208W/Hamming/Background.html, Feb. 1998, 3 pgs.Applicant
- Barker et al., “Hamming Code, Theory,” http://www.eng2.uconn.edu/cse/Courses/CSE208W/Hamming/Theory.html, Mar. 1998, 2 pgs.Applicant
- Barker et al. “General Definitions,” http://www.eng2.uconn.edu/cse/Cour...8W/References/Ref_Definitions.html, Feb. 1998 3 pgs.Applicant
- Barker et al. “Hamming Code,Lab Procedure,” http://www.eng2.uconn.edu/cse/Courses/CSE208W/Hamming/Procedure.html, Feb. 1998, 3 pgs.Examiner