A multi-level error correction system

Abstract: A system separates data into "i" interleaved sections of "k" symbols each and encodes each section using a relatively weak (n,k) ECC. It generates for each k symbols an n symbol code word containing "n-k", or "r" redundancy symbols, or a total of "ri" redundancy symbols. The system segments the ri redundancy symbols into "m" multi-symbol sections, namely, R(1), R(2), ... , R(m), which contain corresponding symbols from each of the i code words. The system then encodes each of these sections using various ECC's and generates Q(2), ..., Q(m) redundancy symbols, respectively. The system then records just the data, the section R(1) redundancy symbols and the Q(2), ...,Q(m) redundancy symbols. When the system later retrieves the data, it decodes it code word-by-code word using the level-1 ECC and fills in the R(2), ..., R(m) redundancy symbols in each code word. It also corrects, if possible, any errors in the data. If the level-1 decoding does not correct all the errors, the system uses the Q(2) redundancy symbols and the level-2 ECC to fill in missing section R(2) code word symbols and tries to correct the corresponding code words using the level-1 ECC. If necessary, the system fills in redundancy symbols in the next section, i.e., section R(3), using the Q(3) symbols and the level-3 ECC. It then uses the level-1 ECC to correct more errors in the data, and so on.

Description: FIELD OF THE INVENTION The invention relates generally to error correction of data and more particularly to improved techniques for multi-level encoding and decoding. BACKGROUND The importance of error correction coding of data in digital computer systems has increased greatly as the density of the data recorded on mass storage media, more particularly magnetic disks, has increased. With higher recording densities, a tiny imperfection in the recording surface of a disk can corrupt a large amount of data. In order to avoid losing that data, error correction codes ("ECC's") are employed to, as the name implies, correct the erroneous data. Before a string of data symbols is recorded on a disk, it is mathematically encoded to form ECC, or redundancy, symbols. The redundancy symbols are then appended to the data string to form code words - data symbols plus redundancy symbols - and the code words are then stored on the disk. When the stored data is to be accessed from the disk, the code words containing the data symbols are retrieved from the disk and mathematically decoded. During decoding any errors in the data are detected and, if possible, corrected through manipulation of the redundancy symbols [For a detailed description of decoding see Peterson and Weldon, Error Correcting Codes , 2d Edition, MIT Press, 1972]. Stored digital code words can contain multiple errors. One of the most effective types of ECC used for the correction of multiple errors is a Reed-Solomon code [For a detailed description of Reed-Solomon codes, see Peterson and Weldon, Error Correcting Codes]. Error detection and correction techniques for Reed-Solomon ECC's are well known. Id. One such technique begins with again encoding the code word data to generate a new set of redundancy symbols and then comparing this set of redundancy symbols with the redundancy symbols in the retrieved code word, i.e. the set of redundancy symbols generated by the pre-storage encoding of the data, to detect any errors in the retrieved code word. [For a detailed discussion of this error detection technique, see United States Patent 4,413,339 issued to Riggle and Weng]. Errors in stored data often occur in patterns such as multi-symbol bursts. Such errors may be caused by, for example, an imperfection in the recording medium. Various encoding and decoding schemes have been developed to correct common error patterns. One scheme developed for bursts is interleaving. Interleaving involves separating the data into a number of sections and, using an ECC, separately encoding each section to form a code word. Each code word thus contains a section of the data and a related set of redundancy symbols. The interleaved data and the redundancy symbols from all the sections are then recorded. Typically, the interleaved data symbols are recorded contiguously, followed by the redundancy symbols. Burst errors, which affect a number of contiguous (interleaved) data symbols, cause a small number of errors in each of several code words. When the data and redundancy symbols are later retrieved, the various sets of redundancy symbols are used to correct errors in the data sections associated with them. Thus a given set of redundancy symbols protects a portion of the data, and presumably, corrects only a portion of any error burst. Accordingly, an ECC which is designed to correct "x" erroneous symbols can correct bursts which are longer than x symbols by correcting them section-by-section. The ECC selected for such a scheme can be less powerful than one which must correct burst errors without partioning them. The advantages to using a less powerful ECC are simpler encoding/decoding hardware and (typically) faster correction. [For a detailed description of interleaving encoding, see Peterson and Weldon, Error Correcting Codes ]. Another scheme used to correct common error patterns is multi-level encoding. Multi-level encoding involves encoding data once using an ECC and/or a technique which is designed to correct the most common error patterns and then encoding the data a next time using another ECC and/or technique which is designed to correct the next most common error patterns, and so on. Multi-level decoding involves correcting the data using the first level ECC or technique and, if errors then remain, correcting them using the second level ECC or technique, and so on. For example, a first level of encoding may consist of encoding the data with a relatively weak ECC. A second level of encoding may consist of again encoding the data with a more powerful ECC. Such a two-level scheme is disclosed in United States Patents 4,706,250 and 4,525,838 to Patel. The Patel scheme disclosed in the two patents first encodes the data using an ECC which corrects e a errors. Patel separates a block of data into "i" sections, or sub-blocks, of "k" symbols each and separately encodes each k-symbol section using a first ECC. This level of encoding generates "p" redundancy symbols for each data section, or a total of "ip" redundancy symbols. Patel next adds together (exclusive OR's) the corresponding data symbols in each sub-block and treats the resulting k symbols as an additional "data" section. Patel then encodes these symbols using a more powerful ECC which can correct up to e b errors (e b ≥ e a ). This second encoding generates "s" additional redundancy symbols. Patel stores the data and the ip and s redundancy symbols, that is, the redundancy symbols generated during the two levels of encoding. He does not store the k additional "data" symbols. The Patel scheme can correct up to e a errors in each sub-block using the first level, or level-1, ECC and up to e b errors in any one sub-block using the level-2 ECC. Accordingly Patel attempts first to correct any errors in the data using the level-1 ECC. If all the errors are corrected using this ECC, he stops the error correction decoding operation and does not use the level-2 ECC. If all but one sub-block is corrected, the level-2 code is used in an attempt to correct it. Patel thus exclusive OR's the corresponding data symbols in each section which include the symbols corrected using the level-1 ECC and the erroneous symbols which the level-1 code did not correct, to form k "data" symbols which correspond to the k-symbol additional data section generated during encoding. Patel then attempts to correct the errors in these k-symbols using the level-2 code. If there are e b or fewer errors, the level-2 code determines the locations of the erroneous symbols within the k-symbol "data" section and generates the associated error values, that is, the symbols which must be exclusive OR'd with the erroneous symbols to correct them. Patel translates the error locations to the sub-block which contains the errors and corrects them using the generated error value symbols. If the data contains more than e b errors per sub-block, or more than one sub-block with more than e a errors, the Patel scheme can not correct the errors. Thus, as more errors occur because of increased recording densities, it is desirable to employ an error correcting scheme which is capable of correcting a greater number of errors. One solution is to use a more powerful ECC at each level. This creates three problems. First, the more powerful ECCs generate additional redundancy symbols. Thus more storage space must be allocated to the data, and less data can be recorded in a given storage space. Second, the more powerful ECCs require more complex, and thus more expensive, encoding and decoding hardware and/or software. Third, the ECCs require more time to correct the errors than the ECCs which use fewer redundancy symbols. As data transfer technologies improve, and the speed with which data may be retrieved from a disk increases, a slower, more complex ECC acts as a limit on the speed with which data may be transferred. Accordingly, what is needed is a more powerful encoding scheme which can quickly correct errors, is easily implemented and does not require excess amounts of storage space. SUMMARY The invention is a multi-level encoding scheme which uses in higher levels of encoding the redundancy symbols generated during a first level of encoding such that all the levels together form a powerful and quick error correction scheme. The multi-level encoding scheme need not retain all of the redundancy symbols because these symbols can be re-generated from a selected number of retained symbols, as explained below. A system using the inventive multi-level encoding scheme first separates the data into "i" sections of "k" symbols each, or i sub-blocks, and encodes each sub-block using an (n,k) ECC. The data symbols may or may not be interleaved. This first level of encoding generates for each k data symbols an "n" symbol code word containing "n-k", or "r" redundancy symbols, or a total of "ri" redundancy symbols. The system next segments the ri redundancy symbols into "m" multi-symbol sections, namely, R(1), R(2), ... , R(m), which contain corresponding symbols from each of the i code words. The system then encodes each of these sections using either the same ECC, or, preferably, ECC's of decreasing strength. Thus it encodes, for example, a first redundancy symbol, w j+1 , from each of the i level-1 code words and generates q 2 redundancy symbols, the w j+1 redundancy symbols and q 2 generated redundancy forming a level-2 code word. Next it encodes a second redundancy symbol, w j+2 , from each of the i code words and generates another q 2 redundancy symbols, forming a second level-2 code word, and so forth. The level-2 redundancy symbols corresponding to the various sections R(2)...R(m), are in sections Q(2), ..., Q(m), respectively. The system then records the data, the section R(1) redundancy symbols and the section Q(2), ...,Q(m) redundancy symbols. It does not record the redundancy symbols in sections R(2), ... , R(m), however, because these symbols can be re-generated using the recorded R(1) and Q(2), ..., Q(m) redundancy symbols, as set forth below. When data is retrieved from storage, it is decoded code word-by-code word using the level-1 ECC. The system uses the retrieved section R(1) symbols as redundancy symbols and treats the "missing" section R(2)...R(m) symbols as erasure errors. The level-1 ECC is thus used to fill in the redundancy symbols in sections R(2), ..., R(m) for each level-1 code word and also to correct, if possible, any errors in the retrieved data and section R(1) redundancy symbols. If the level-1 decoding does not correct all the errors and erasures using only the retrieved section R(1) symbols as redundancy symbols, the system uses the section Q(2) redundancy symbols and the level-2 ECC to fill in missing section R(2) redundancy symbols. Next, the system tries to correct the corresponding level-1 code words using the level-1 ECC and the retrieved and filled-in redundancy symbols in sections R(1) and R(2). If necessary, the system fills in any uncorrected redundancy symbols in the next section, i.e., section R(3), using the section Q(3) symbols and the level-3 ECC. It then uses the level-1 ECC and the redundancy symbols in sections R(1), R(2) and R(3) to correct more errors in the data, and so on. BRIEF DESCRIPTION OF THE DRAWINGS The above and further advantages of the invention may be better understood by referring to the following description in conjunction with the accompanying drawings, in which: Figure 1 is a block diagram of interleaved code words generated in accordance with a first level of encoding; Figure 2 is a block diagram of the code words of Figure 1 further encoded using a second and third level of encoding; Figure 3 is a block diagram of portions of the code words of Figure 2 which are retained in memory; Figure 4 is a block diagram of retrieved code words including re-generated redundancy symbols; Figure 5 is a block diagram of an encoding system which encodes data to form code words in accordance with a second embodiment of the current invention; and Figure 6 is a block diagram of the code words generated by the encoder shown in Figure 5. DETAILED DESCRIPTION With reference to Figure 1, a system (not shown) separates a string of "ki" data symbols into "i" sections, or sub-blocks, of "k" symbols each. The system may first interleave the ki data symbols. These i Sections are arrayed as columns 10 in the drawing. The system performs a first level encoding using an (n,k) ECC and conventional techniques, and encodes each section of data to form a level-1 code word consisting of k data symbols and "n-k", or "r", redundancy symbols. The code words correspond to columns c 1 , c 2 , ..., c i of the array in the drawing. The system thus generates "ri" redundancy symbols in the first level of encoding. The system next segments the ri redundancy symbols into m sections 12-16, R(1), R(2), ..., R(m), of arbitrary size, where m=3 in the exemplary embodiment. Each section, preferably, contains at least two redundancy symbols, which is the number of symbols required to correct one erroneous data symbol. Thus each section 12-16 contains at least two rows in the array depicted in the drawing. Referring now to Figure 2, the system encodes the symbols in section R(2) using a second level of encoding. It thus encodes as "information" symbols the corresponding redundancy symbols from each of the i code words, that is, each row, "W a ", of section R(2), using a second ECC. This second level of encoding generates for each row w j+1 , ..., w p of section R(2), "q 2 " redundancy symbols. Each row consisting of i information symbols and q 2 redundancy symbols forms a level-2 code word. The system thus generates in this level of encoding a total of (p-j+1)q 2 redundancy symbols. These symbols are depicted as section Q(2) in the drawing. Generally, number of symbols in section Q(2) < number of symbols in section R(2). The system next performs a third level of encoding by similarly encoding the symbols in section R(3). It thus encodes the corresponding redundancy symbols from each of the i code words using an ECC which, preferably, is less powerful than the level-2 code. The third level of encoding generates for each row w p+1 , w p+2 ...w r of section R(3), "q 3 " redundancy symbols. Each row consisting of i "information" symbols and q 3 redundancy symbols forms a level-3 code word. The system thus generates in this level of encoding a total of (r-p+1)q 3 redundancy symbols. These symbols are depicted as section Q(3) in the drawing. Generally, the number of symbols in section Q(3) < the number of symbols in section R(3). Referring now to Figure 3, the system stores in memory (not shown) the ki data symbols and the section R(1), Q(2) and Q(3) redundancy symbols. It does not store the section R(2) and R(3) redundancy symbols, however, because these symbols can be re-generated using the stored section R(1), Q(2) and Q(3) redundancy symbols, as explained below. The section R(2) and R(3) symbols are thus intentionally "erased." Each of the erased symbols is treated during decoding as an erasure, that is, an error with a known location. Optionally, the system may also encode the stored sections R(1), Q(2)...Q(m) redundancy symbols using one or more ECCs, which generates redundancy symbols ECK(1), ECK(2) and ECK(3). These symbols are then stored along with the data and the section R(1), Q(2) and Q(3) symbols. During decoding, these (optional) redundancy symbols may be used to correct any errors in the stored redundancy symbols before the redundancy symbols are used to re-generate the erased symbols. The optional symbols are thus an added layer of protection for both the stored symbols and the erased symbols. The data symbols are protected by m levels of encoding. The storage space required for the m levels of redundancy symbols is less than the space which would be required all the ri level-1 redundancy symbols. Accordingly, the scheme offers more protection than prior multi-level encoding schemes and uses less storage space. As is understood by those skilled in the art, the data and redundancy symbols may be stored, or recorded, in any format. The block format shown in the figures is for explanatory purposes only. When the stored information is later retrieved, the system uses the retrieved section R(1) redundancy symbols to regenerate for each code word the "erased" section R(2) and R(3) level-1 redundancy symbols using conventional error and erasure correcting techniques. It also uses the section R(1) redundancy symbols to correct errors in the retrieved data and redundancy symbols. Figure 4 illustrates several re-generated columns, e.g., c 1 , c 2 , etc. If the system does not generate a valid code word for a particular section of data, i.e., a particular column, it treats the associated section R(2) and R(3) symbols as errors with known locations, e.g., columns c e1 , c e2 ...c ef . It then decodes each row of section R(2) using the appropriate section Q(2) redundancy symbols and the level-2 ECC and fills in the erased section R(2) symbols in the columns c e1 , c e2 ... c ew , as appropriate. The system next tries to correct any remaining errors in the retrieved data and section R(1) symbols of these columns using the level-1 ECC and the appropriate section R(1) and R(2) redundancy symbols. If the system can not correct all the errors and re-generate all the erased redundancy symbols using the level-1 ECC and the sections R(1) and R(2) redundancy symbols, it uses the section Q(3) redundancy symbols and the level-3 ECC to fill in any missing section R(3) symbols. It then uses these filled in symbols and the section R(1) and R(2) redundancy symbols with the level-1 ECC to correct more errors. If necessary, and if there are more levels, the system repeats the correction procedure for each such level. Before the system re-generates the erased section R(2) and R(3) symbols, it uses the optional ECC symbols, if any, to correct any errors in the retrieved section R(1), Q(2) and Q(3) redundancy symbols. Next the system performs the level-1 error and erasure correction to fill in the erased redundancy symbols and correct errors the retrieved data in section R(1) redundancy symbols. It them follows the procedures set forth above to correct the errors. If the system performs its higher levels of decoding, it is encountering badly corrupted data. The system may thus signal to a system operator that the data is badly corrupted, and the system operator may then examine the recording medium and salvage the stored data before it becomes irretrievably lost. Prior art systems which use only two levels of decoding are not so warned of corrupted data, and thus, they may eventually lose data to corrupted media. Figures 5 and 6 illustrate a second embodiment of the current invention which can be used in conjunction with an existing one-level encoding system. The one-level system encodes the ki data symbols after (optionally) interleaving them. It encodes them in k-symbol sections in encoder 18 to form code words in accordance with an ECC which has a consecutive root generator polynomial, g 1 (x) : (x+α a ) * (x+α a+1 ) *(x+α a+2 ) *(x+α a+3 ) *...* (x+α a+s ) where * represents Galois Field multiplication and α is a primitive polynomial of the Galois Field GF(2 t ) used to encode the data. The code words consist of k data symbols and s redundancy symbols and are arrayed as columns 10 in Figure 6, with the si redundancy symbols for all the code words depicted as section S(1) in the drawings. The code words are next applied to a second encoder 20 for a second level of encoding. This level of encoding is associated to with an ECC which has as a generator polynomial, g 2 (x), an expanded version of g 1 (x): (x+α a-d )*(x+α a-d+1 )*...*(x+α a )*...*(x+α a+s )*(x+α a+s+1 )*...* (x+α a+s+d ) ├g 1 (x)┤ This second ECC is more powerful, that is, it corrects more errors in a given amount of data than the ECC which is associated with g 1 (x). The data symbols have already been encoded in accordance with g 1 (x) by the one-level encoder 18 to produce the section S(1) redundancy symbols. Accordingly, the code word data symbols and S(1) redundancy symbols are treated as information symbols and the second encoder 20 actually encodes the symbols in accordance with the factors of g 2 (x) which are not part of g 1 (x). Thus encoder 20 encodes the symbols in accordance with a polynomial g* 2 (x) which is equal to g 2 (x)/g 1 (x). This second encoding generates, for each code word, redundancy symbols depicted as section S(2) in Figure 6. The section S(2) ' redundancy symbols alone do not provide adequate error protection to the data because the polynomial, g 2 *(x), used to generate them may not have as many consecutive roots in GF(2 t ) as g 1 (x). However, the section S(2) symbols together with the corresponding section S(1) symbols protect the data symbols with the relatively powerful ECC having as a generator polynomial g 2 (x). Third, fourth, ..., m levels of encoding may be performed in the same manner. A third level of encoding, for example, uses a generator polynomial g 3 *(x) = g 3 (x)/g 2 (x), where g 3 (x) is an expanded version of g 2 (x). Thus encoders for these levels, for example, encoder 22 for m-level encoding, encode the data symbols and the corresponding section S(1)...S(m-1) redundancy symbols in accordance with a polynomial g* m (x) which is equal to the quotient of g m (x), which is the expanded version of g m-1 (x), divided by the generator polynomial associated with the previous level, g m-1 (x). The level-m generator polynomial thus includes consecutive roots, also, and protects the data with an even more powerful ECC. The redundancy symbols generated for each level of encoding are depicted in sections S(1)...S(m) in Figure 6. These redundancy symbol sections correspond to the section R(1), R(2)...R(m) of Figure 2. Referring again to Figure 6, the redundancy symbols in sections S(2)...S(m), where m=3 in this embodiment, are then encoded, as information symbols, to generate the redundancy symbol depicted in sections Q(2) and Q(3), as discussed above with reference Figure 3. After the data and the levels-2 and 3 redundancy symbols have been encoded to generate the symbols depicted in sections Q(2) and Q(3), the system further encodes the redundancy symbols in sections Q(2) and Q(3), using one or more ECCs, and generates redundancy symbols ECK(2) and ECK(3). The system then stores these redundancy symbols along with the data symbols, the section S(1) redundancy symbols and the section Q(2) and Q(3) redundancy symbols. It does not store the section S(2) and S(3) redundancy symbols, however, because these symbols can be regenerated using the stored redundancy symbols. This second embodiment is different than the first, in that the system is required to encode the section Q(2)...Q(m) redundancy symbols. The system may (optionally) encode the section S(1) symbols to form section ECK(1) symbols, as in the first embodiment. The data symbols 10 are protected by all m levels of encoding. The m th level protects them using g m (x) which is much more powerful ECC than the one used in level-1, without requiring the storage of the large number of redundancy symbols. Prior systems require for such protection the storage of all the redundancy symbols from all levels of encoding. Decoding is performed by the system in levels, as discussed above with respect to the first embodiment. The system starts with the level-1 ECC and uses higher levels, as necessary, to regenerate the erased symbols and correct additional errors. Each level provides a much more powerful error correction mechanism, due to the use of a generator polynomial which has more terms than the one used in the previous level. Also, each level uses redundancy symbols filled by the codes associated with appropriate section Q(2)...Q(m) and thus uses error free redundancy symbols. Accordingly correction can be performed relatively quickly. The inventive multi-level encoding scheme protects data symbols with powerful ECCs without, as expected with prior art systems, increasing the complexity of encoders/decoders, requiring additional storage space, or drastically increasing the time required for error correction. The scheme encodes redundancy symbols from the various lower encoding levels and treats them as erasures. The encoding scheme can thus give the data symbols powerful error protection without the storage of the number of redundancy symbols required with prior systems. The inventive system uses the various levels of redundancy symbols during the multi-level decoding to correct both errors and erasures. Each decoding level corrects only a portion of the erasures and/or errors in the retrieved symbols. Accordingly, error correction can be performed relatively quickly using, in higher levels of decoding, either ECCs of decreasing complexity, as in the first embodiment, or powerful ECC's which are required to correct relatively few errors, as in the second embodiment. The foregoing description has been limited to two specific embodiments of this invention. It will be apparent, however, that variations and modifications may be made to the invention, with the attainment of some or all of its advantages, which fall within the scope of the appended claims.

Claims: A method of protecting a block of "ki" data symbols against errors, said method including the steps of: A. segmenting the block of ki data symbols into i sub-blocks of k symbols each and encoding each of the sub-blocks in accordance with a first error correction code to generate "i" level-1 code words, each of said level-1 code words containing "k" data symbols and "r" redundancy symbols resulting in a total of ri level-1 redundancy symbols; B. sectioning said ri redundancy symbols of the level-1 code words into "m" (m < r) multi-symbol sections R(1), R(2), ... , R(m) which contain corresponding symbols from each of the i code words; C. encoding the corresponding redundancy symbols in section R(2) from each of said level-1 code words in accordance with an error correction code to generate level-2 code words, each of said level-2 code words containing as information symbols "i" redundancy symbols generated using said first error correction code and "q 2 " further redundancy symbols, the symbols so generated being associated with a section Q(2) of redundancy symbols; D. repeating step C for each of the remaining R(3), ... , R(m) redundancy symbol sections, said encoding generating sections Q(3), ...; Q(m) of redundancy symbols; and E. retaining said data symbols, said section R(1) of redundancy symbols and said sections Q(2), Q(3) Q(m) of redundancy symbols. The error protection method of claim 1, wherein each of said R(2), R(m) sections of said r redundancy symbols is encoded using the same error correction code. The error protection method of claim 1, wherein each of said redundancy symbol sections is encoded using a different error correction code, and said error correction codes used to encode redundancy sections R(3), ..., R(m), respectively, are designed to correct fewer errors than the codes used to encode the previous section R(2), ... R(m-1). The error protection method of claim 1, wherein said method further includes the step of interleaving the ki data symbols. The error protection method of claim 1, wherein said method further includes the steps of: F. treating said section R(2), R(3), ..., R(m) symbols which are not retained in step E as erasures; G. filling in, in each level-1 code word, as many of said erasures and correcting as many errors in said code words as possible using said first error correction code; H. treating said data symbols as error-free, if all of said redundancy symbols in said level-1 code word are filled in; I. filling in, in each level-1 code word in which said section R(2) symbols are not filled in, said erasures in section R(2) using said section Q(2) redundancy symbols and said error correction code used to encode said section R(2) symbols; J. correcting, using said first error correction code and said section R(1) and R(2) redundancy symbols, any errors in said level-1 code words in which said section R(2) symbols were filled in by step I; K. if any redundancy symbols in said level-1 code words are not filled in: i. filling in said section R(3) erasures using said section Q(3) redundancy symbols and said error correction code used to encode said section R(3) symbols, and ii. correcting, using said first error correction code and said section R(1), R(2) and R(3) symbols, any errors in said level-1 code words in which said section R(3) symbols were filled in by this step J; and L repeating step J for each remaining section of said r redundancy symbols. The error protection method of claim 5, wherein each of said R(2), ..., R(m) sections of said r redundancy symbols is encoded using the same error correction code. The error protection method of claim 5, wherein each of said redundancy symbol sections is encoded using a different error correction code, and said error correction codes used to encode redundancy sections R(3), ..., R(m) are designed to correct fewer errors than the codes used to encode the data, and sections R(2), ... R(m-1), respectively. An error correction system for encoding a block of "ki" data symbols to protect said data symbols against errors, said system including: A. a first encoder means for segmenting the block of ki data symbols into "i" sub-blocks of k symbols each and encoding each of the sub-blocks in accordance with a first error correction code to generate i level-1 code words, each of said level-1 code words containing "k" data symbols and "r" redundancy symbols resulting in a total of ri level-1 redundancy symbols; B. means for sectioning said ri redundancy symbols of the level-1 code words into "m" (m<r) multi-symbol sections R(1), R(2), ..., R(m) which contain corresponding symbols from each of the i code words; C. a second encoder means for encoding the corresponding redundancy symbols in section R(2) from each of said level-1 code words in accordance with an error correction code to generate level-2 code words, each of said level-2 code words containing as information symbols "i" redundancy symbols generated using said first error correction code and "q 2 " further redundancy symbols, the symbols so generated being associated with a section Q(2) of redundancy symbols, said second encoder means encoding each of the remaining redundancy symbol sections to generate sections Q(3), ... , Q(m) of redundancy symbols, respectively; and D. means for retaining said data symbols, said section R(1) of redundancy symbols and said sections Q(2), Q(3), ..., Q(m) of redundancy symbols. The error correction system of claim 8, wherein said second encoder means encodes each of said R(2), ..., R(m) sections of said r redundancy symbols using the same error correction code. The error correction system of claim 8, wherein said second encoder means encodes each of said R(2), ..., R(m) sections of said r redundancy symbols using for each section an error correction code which is designed to correct fewer errors than the code used to encode the symbols of the previous section. The error correction system of claim 8, wherein said first encoder means interleaves the ki data symbols before separating them into said i sections. The error correction system of claim 8, wherein said system further includes: E. a first correcting means for: i. correcting said section R(2), ..., R(m) redundancy symbols as erasures and correcting any erroneous retained data and section R(1) symbols using said level-1 error correction code, and ii. treating said data symbols as error-free, if all of said redundancy symbols in said level-1 code word are filled in; and F. a second correcting means for: i. filling in, in turn, said section R(2) ...., R(m) symbols not filled in by said first correcting means using said section Q(2), ..., Q(m) redundancy symbols and said error correction code used to encode said section R(2), ..., R(m) symbols, respectively, and ii. applying to said first correcting means for further error correction, after each of said sections R(2)...R(m) is filled in, said level-1 code words. A method generating error correction redundancy symbols corresponding to a block of "ki" data symbols, said method including the steps of: A. segmenting the block of ki data symbols into i sub-blocks and encoding the sub-blocks over a Galois Field GF(2 t ) using a first error correction code to generate "i" level-1 code words, each of said level-1 code words containing "k" data symbols and "s" redundancy symbols, said first error correction code having a generator polynomial, g 1 (x), with consecutive roots in GF(2 t ): g 1 (x) = (x+α a )*(x+α a+1 )*(x+α a+2 )*(x+α a+3 )*...*(x+α a+s ) where * represents Galois Field multiplication and α is a primitive polynomial of GF(2 t ), said redundancy symbols being associated with a section S(1) of redundancy symbols; B. encoding, to generate a second set of redundancy symbols associated with a section S(2), said data symbols in each of said i level-1 code words and the corresponding symbols in section S(1) using a second error correction code having a generator polynomial, g* 2 (x), which is equal to the quotient of a generator polynomial, g 2 (x) g 2 (x) = (x+α a-d )*(x+α a-d+1 )*...*(x+α a )*...*(x+α a+s )* (x+α a+s+1 )*...*(x+α a+s+d ) divided by said generator polynomial, g 1 (x), said polynomial g 2 (x) being an expansion of g 1 (x); C. repeating Step B a predetermined number of times and generating sections S(3)...S(m) of redundancy symbols; D. further encoding said section S(2)...S(m) redundancy symbols to generate associated sections of redundancy symbols Q(2)...Q(m); E. encoding each of said sections Q(2)...Q(m) of redundancy symbols to generate sections ECK(2)...ECK(m) of redundancy sym-bole; and F. retaining said data symbols, said section S(1) redundancy symbols, said section Q(2)...Q(m) redundancy symbols and said ECK(2)...ECK(m) redundancy symbols. The method of claim 13, wherein said method further includes interleaving the ki data symbols. The method of claim 13, wherein said method further includes the steps of: F. correcting said data symbols using said section S(1) redundancy symbols and said first error correction code; G. if errors in said data symbols remain, filling in, each code word, said section S(2) redundancy symbols using said section Q(2) redundancy symbols and said error correction code used to generate said section Q(2) redundancy symbols; H. correcting said erroneous data symbols using said filled in section S(2) redundancy symbols and said second error correction code having said generator polynomial g* 2 (x) ; I. if errors in said data symbols remain, filling in, in each code word, the next said section of redundancy symbols, S(3)...S(m) using said corresponding section Q(3) ...Q(m) redundancy symbols and error correction code associated with said level; and J. correcting any errors using an error correction code associated with that level of encoding. A system for generating error correction redundancy symbols corresponding to a block of "ki" data symbols, said system including: A. a first encoding means for segmenting said block of ki data symbols into i sub-blocks and encoding the i sub-blocks over a Galois Field GF(2 t ) using a first error correction code to generate "i" level-1 code words, each of said level-1 code words containing "k" data symbols and "s" redundancy symbols, said first error correction code having a generator polynomial, g 1 (x), with consecutive roots in GF(2 t ): g 1 (x) = (x+α a )*(x+α a+1 )*(x+α a+2 )*(x+α a+3 )*...*(x+α a+s ) where * represents Galois Field multiplication and α is a primitive polynomial of GF(2 t ), said redundancy symbols being associated with a section S(1) of redundancy symbols; B. encoding means for encoding, to generate a section of redundancy symbols S(2), said data symbols and said section S(1) redundancy symbols in each of said i level-1 code words using a second error correction code having a generator polynomial, g* 2 (x), which is equal to the quotient of g 2 (x) which is an expanded version of g 1 (x): g 2 (x) = (x+α a-d )*(x+α a-d+1 )*...*(x+α a )*...*(x+α a+s )* (x+α a+s+1 )*...*(x+α a+s+d ) divided by g 1 (x); C. encoding means for encoding said section S(2) redundancy symbols to generate a section Q(2) of redundancy symbols; D. encoding means for encoding said section Q(2) redundancy symbols to generate a section ECK(2) of redundancy symbols; and E. means for retaining said data symbols, said section S(1) redundancy symbols, said section Q(2) and section ECK(2) redundancy symbols. The system of claim 16, wherein said system further includes: F. encoding means for encoding, in levels, said data symbols and said sections of redundancy symbols S(i) generated in previous levels of encoding to generate a next section S(i+1) of redundancy symbols using an error correcting code having a generator polynomial, g* i+1 (x), which is equal to the quotient generator polynomial, g i+1 (x), which is an expansion of the generator polynomial g i (x) associated with the preceding level, divided by said generator polynomial g i (x); G. encoding means for encoding each of said sections S(i) of redundancy symbols to generate another section of redundancy symbols Q(i); H. encoding means for encoding each of said Q(i) sections of redundancy symbols to generate ECK(i) sections of redundancy symbols; and I. means for retaining said data symbols, said section S(1) redundancy symbols, said section Q(2), ..., Q(i) of redundancy symbols, and said sections ECK(2), ..., ECK(i) sets of redundancy symbols. The system of claim 16, wherein said system further includes: F. means for correcting said data symbols using said section S(1) redundancy symbols and said first error correction code; G. if errors in said data symbols remain, means for filling in, in each code word said section S(2) redundancy symbols using said section Q(2) redundancy symbols and said error correction code used to generate said section Q(2) redundancy symbols; H. correcting said erroneous data symbols using said filled in section S(2) redundancy symbols and said second error correcting code having said generator polynomial g* 2 (x), which is equal to the quotient of generator polynomial, g 2 (x), which is an expansion of said level-1 generator polynomial, divided by said level-1 generator polynomial. The system of claim 17, wherein said system further includes: J. means for correcting said data symbols using said section S(1) redundancy symbols and said first error correction code; K. if errors in said data symbols remain, means for filling in, in each code word said section S(2) redundancy symbols using said section Q(2) redundancy symbols and said error correction code used to generate said Q(2) redundancy symbols; L. correcting said erroneous data symbols using said filled-in section S(2) redundancy symbols and said second error correction code having said generator polynomial g* 2 (x), which is equal to the quotient of generator polynomial g 2 (x), which is an expansion of said level-1 generator polynomial, divided by said level-1 generator polynomial; M. if errors in said data symbols remain, means for filling in, in each code word said section of redundancy symbols S(i) generated by said next encoding step using said corresponding section Q(i) redundancy symbols and said corresponding error correction code; N. correcting said erroneous data symbols using said filled-in section S(i) redundancy symbols and said corresponding error correction code having as a generator polynomial g* i (x) which is equal to the quotient of said generator polynomial g i (x), which is an expansion of the previous level generator polynomial, divided by said previous level generator polynomial.

Inventors: WENG LIH-JYH, WENG, LIH-JYH
Applicants: QUANTUM CORP, QUANTUM CORPORATION
Application year: 1991
Main classification: H03M13
IPC codes: H03M13, G06F11