Method and apparatus for generating error detection check bytes for a data record

Abstract: The present invention relates to apparatus for generating a set of CRC check bytes for a variable-length record formed as a sequence of data bytes and error correction check bytes inserted into the sequence of data bytes at preselected inter­ vals. The apparatus comprises a computing system adapted to operate on the sequence of data bytes and error correction check bytes in order to generate the set of CRC check bytes. According to the invention the apparatus is characterised in that the computing system comprises first computing means for sequentially receiving the sequence of data bytes and error correction check bytes in the record and for multiplying all the data bytes and error cor­ rection check bytes, except for a first preselected set of the error correction check bytes, by a matrix of the form T -n , where n is an integer and different from any integer used for computing the error correction check bytes, in order to generate a first sub-set of CRC check bytes, second computing means for sequentially receiving the sequence of data bytes and error correction check bytes in the record and for multiplying all the data bytes and error cor­ rection check bytes, except for a second preselected set of the error correction check bytes, by a matrix of the form T -(n+1) in order to generate a second sub-set of CRC check bytes, and means for combining the first and second sub-sets of CRC check bytes so as to generate the set of CRC check bytes.

Description: The present invention relates to arrangements and methods for detecting and correcting errors in records including sequences of data bytes and error detection and correction check bytes. The invention is related to the invention described in the Specification of European Patent Application No. 86307326.8 published as EP-A 0218413. This specification is incorporated herein by reference as if fully set forth herein. A cyclic redundancy check (CRC) operation on a sequence of data bytes is extremely efficient and well suited for error detection in the transmission, retrieval or storage of variable length records of binary data including such sequences. A CRC operation is capable of detecting nearly all patterns of error with almost negligent amount of redundancy. CRC operations are also very well known. See, for example, "Cyclic Codes for Error Detection", W. W. Peterson and D. T. Brown, Proceedings of the IRE, pages 228 to 235, January, 1961, and "A Multi-channel CRC Register", Arvind M. Patel, Spring Joint Computer Conference, 1971. A linear feedback register is essentially the only hardware needed for encoding and decoding a record comprising a variable length sequence of binary data for error detection by means of the use of a CRC check byte. The CRC byte may be generated using a GF(2) polynomial divider circuit. In such a circuit, the sequence of binary data is serially shifted into a feedback shift register as the data is transmitted. The CRC check byte generated is transmitted at the end of the binary data sequence and received in sequence at the receiver. The CRC check byte as generated is then compared with the CRC check byte as received for detection of any errors in the received record which is processed in the same manner by a feedback shift register. The number of digits in the CRC check byte determines the checking capability of the code and, in general, equals the number of stages of the encoding and decoding shift register. The object of the present invention is to provide an improved apparatus and method for generating a set of CRC check bytes for a variable length record. The present invention relates to apparatus for generating a set of CRC check bytes for a variable length record formed as a sequence of data bytes and error correction check (ECC) bytes inserted into the sequence of data bytes at preselected intervals, the ECC bytes being calculated using powers of a companion matrix T derived from an irreducible polynomial, the apparatus comprising a computing system adapted to operate on said sequence of data bytes and ECC bytes in order to generate said set of CRC check bytes. According to the invention the apparatus is characterised in that said computing system comprises: first computing means for generating a first subset of CRC check bytes by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (-ni) D i , where D i is the ith value in said sequence of data bytes and ECC bytes after excluding a first preselected set of ECC bytes, T is the companion matrix used for computing said ECC bytes, and n is an integer different from any of the powers used for computing said ECC bytes or any other CRC check bytes; second computing means for generating a second subset of CRC check bytes, each paired with a CRC check byte in said first subset, by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (n+1)i Z i , where Z i is the ith value in said sequence of data bytes and ECC bytes after excluding a second preselected set of ECC bytes, and where n has the same value as used to generate the paired CRC check byte from the first subset; and means for combining said first and second subsets of CRC check bytes so as to generate said set of CRC check bytes. The invention also relates to a method of generating a plurality of CRC check bytes for a variable length record formed as a sequence of data bytes and error correction check (ECC) bytes inserted into said sequence of data bytes at preselected intervals, the ECC bytes being calculated using powers of a companion matrix T derived from an irreducible polynomial, comprising performing a computation operation on said sequence of data bytes and ECC bytes in order to generate said set of CRC check bytes. According to the invention, the method is characterised in that said computation operation comprises: generating a first subset of CRC check bytes by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (-ni) D i , where D i is the ith value in said sequence of data bytes and ECC bytes after excluding a first preselected set of ECC bytes, T is the companion matix used for computing said ECC bytes, and n is an integer different from any of the powers used for computing said ECC bytes or any other CRC check bytes; generating a second subset of CRC check bytes, each paired with a CRC check byte in said first subset, by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (n+1)i Z i , where Z i is the ith value in said sequence of data bytes and ECC bytes after excluding a second preselected set of ECC bytes, and where n has the same value as used to generate the paired CRC check byte from the first subset; and combining said first and second subsets of CRC check bytes so as to generate said set of CRC check bytes. The CRC check bytes are created in pairs and each computed using different powers of the T matrix. The T matrix is the companion matrix of an irreducible polynomial, G(x), which is the same as that used for computing other associated ECC check bytes for the record. In many practical applications G(x) is a degree-eight primitive polynomial. Use of the same T matrix provides computational convenience not found in conventional CRC implementations which typically employ a high degree (e. g. degree 16) polynomial divider to obtain long cycle length. The longer the cycle length, the less chance two errors in the same record will cancel; therefore, cycle length must be longer than the record. The present invention obtains long cycle lengths while operating in a reasonable size Galois field, such as GF(2⁸) instead of a larger field GF(2¹⁶) in a conventional CRC operation. The check bytes generated in accordance with the invention are also useful in two-level error correction code configurations such as that described in the European Patent Application referred to above. In the arrangement described in that Application, a variable length record is divided into subblocks, each of which has 2 x 2 check bytes of the two-way interleaved cyclic codeword for single error correction and 1 x 2 extension check bytes for double error detection. At the second level, correction of a double burst error in one subblock is provided by reprocessing the subblock check bytes with additional 1 x 2 extension check bytes at the end of the block. Four additional check bytes at the end of the block are CRC check bytes which provide substantially strong data integrity check after ECC correction and these CRC check bytes and may be generated in accordance with the present invention. When the CRC check bytes are used in the two-level ECC (error correction code) scheme described above, use of the same T matrix provides computational convenience when second level error correction requires recomputation of CRC bytes. In order that the invention may be more readily understood an embodiment will now be described with reference to the accompany drawings, in which: Fig. 1 is a block diagram of the logic for an encoding feedback shift register which can be used to generate CRC check bytes according to the principles of the present invention, Fig. 2 is a block diagram of the logic for a feedback shift register for simultaneous decoding of data and error patterns utilising CRC check bytes generated according to the principles of the present invention, and Fig. 3 is a diagrammatic illustration showing the format of data bytes and subblock and block check bytes at the end of a two-level encoded record configured for a disk memory track constructed and including CRC check bytes generated according to the principles of the present invention. The present invention relates to the generation of check bytes CRC for a record of the type which includes blocks of data bytes in sequence. Each block includes one or more subblocks and error correction check bytes. Each sub block includes data bytes and error correction check bytes. The four check bytes to be generated for the records, CRC1, CRC2, CRC3, CRC4, are defined by the following equation: in which the byte sequences D i and Z i are as defined below. The matrix T is a companion matrix of a degree-eight primitive polynomial, G(x). The polynomial is given by G(x) = g₀ + g₁x + g₂x² + ... + g₇x⁷ + x 8, (5) where + ○ signifies modulo-2 sum. Different powers of the same primitive element (matrix) T are used to create check bytes for all CRC operations as well as performing ECC functions as will be described below. The matrix T of the polynomial G(x) is given by the following non-singular matrix Referring to Equations (1) - (4), the byte sequence [D i ] consists of all data bytes in the record to be checked for errors and all first level error correction check bytes, but excludes second level error correction check bytes. The byte sequence [Z i ] consists of the same data and check bytes but further excludes two check bytes corresponding to the last two byte positions of each subblock of the record (except the last subblock) to create a recurring, two-byte offset between sequences [D i ] and [Z i ]. The two check bytes are excluded by inhibiting the clock signal which controls the shift register processing of the byte sequence [Z i ] for two cycles. The first-level check bytes in these byte sequences (and the corresponding error patterns) may be replaced by null bytes (i.e. all zeroes) in CRC calculations. Such use of null bytes will eliminate the need for correcting errors, if any, in the ECC check bytes. The byte sequence [Z i ] is offset from the byte sequence [D i ] by two bytes at the end of each subblock. When G(x) is a degree-8 primitive polynomial, the exponent for matrices T⁻¹ and T⁻² is 255. If a typical subblock is 102 bytes long, the recurring offset arrangement provides combined effective cycle lengths of two CRC checks for sequences [D i ] and [Z i ] as given below: 255 x 102 = 26,010 bytes for [D i ], and 255 x 100 = 25,500 bytes for [Z i ]. Thus, two identical detectable error patterns will not cancel each other simultaneously in both types of CRC check for any record comprising up to 255 subblocks of data bytes. The four check bytes, CRC1, CRC2, CRC3 and CRC4, are generated or computed by means of four 8-bit shift registers 1, 2, 3 and 4 with premultipliers T⁻¹, T⁻², T⁻³ and T⁻⁴, respectively and each of the type illustrated in Figure 1. The sequence [D i ] is entered into shift registers 1 and 3 with premultipliers T⁻¹ and T⁻³, respectively. Similarly, the sequence [Z i ] is entered into shift registers 2 and 4 with premultipliers T⁻² and T⁻⁴, respectively. The subscript "i" counts from high to low and the last bytes are identified by D₁ and Z₁ in their respective sequences. By way of example, for computing all CRC bytes a typical encoder configuration for implementing Equation (3) is shown in Fig. 1. When the last bytes have been entered during the check byte computing operation, the contents of the four shift registers are shifted through 0, 1, 2 and 3 additional cycles, respectively, with null (all zeroes) input. The final contents of the shift registers comprise the four check bytes. During the process of reading the data record after transmission in order to check for errors, CRC error syndromes may be generated on-the-fly along with the ECC error syndromes as the data bytes are received. Of course, the CRC error syndromes also must be adjusted for first and second-level error correction. The equations for the four CRC error syndromes, S₋₁, S₋₂, S₋₃ and S₋₄ are given by The symbols ^ indicates readback bytes, and E₁(D i ) and E₁(Z i ) represent the first level error correction patterns and E₂(D i ) and E₂(Z i ) represent the second level error correction patterns corresponding to the sequences of bytes D i and Z i , respectively. The error patterns corresponding to the check bytes are replaced by null bytes. The data sequence [D and i ] and the corresponding sequence of error-correction patterns [E₁(D i )] appear at the input and output of the first level decoder, respectively. If second level error correction is required, then the error correction patterns [E₂(D i )] will be available for decoding at the second level. If the first level decoder includes a subblock buffer and on-the-fly error correction, then first level CRC error syndromes can be computed from the corrected data which is the combined sequence [D i + E₁(D i )]. However, if the first-level error correction is deferred, then the subblock buffer and the corrected data sequence may not be readily available. In that case, the CRC error syndromes may be computed by combining partial computations. Syndrome S₋₃ is used to illustrate the process which is applicable to all CRC error syndromes. The partial computations of Equation (9) are defined as where S₋₃(0), S₋₃(1) and S₋₃(2) denote the values for S₋₃ with no error correction, first level error correction and second level error correction, respectively. Corresponding equations for partial computations of Equations (7), (8) and (10) are given in the Appendix at the end of this description. Equations (11) and (12) can be implemented using two shift registers (each similar to the one shown in Fig. 1) for processing the uncorrected sequence [D i ] and the first level error correction pattern [E₁(D i )] separately. Each shift register will use the multiplier T⁻³. The first shift register provides a sufficient CRC check if no errors were corrected. This check is available immediately at the end of the record. When first-level error correction is required, the second shift register provides the CRC check with one-subblock delay from the end of the record. Preferably, however, the two sequences [D i ] and [E₁(D i )] can be processed in one shift register. The one subblock delay between these two sequences creates a delay of exactly 102 byte positions between them. If a count-down clock j, synchronised to the output of the first-level decoder, is used, then E₁(D j ) appears at the output in synchronism with D and j-102 at the input. Equations (11) and (12) can be combined and rewritten in terms of j as where L is the length of sequence [D i ]. Note that E₁ (D j ) for j>L and D j-102 for j≦102 do not exist, they are null bytes. Equation (14) may be implemented with a shift register 20 as shown in Fig. 2 in which the sequence [D j ] enters through a premultiplier T 3x102 (21) and is added to the sequence (E₁(D j )] at the input as the clock parameter j counts down from L+102 to 1. The sequence [D and j ] starts at j=L+102 and ends at j=103. The sequence E₁(D j ) starts at j=L and continues after j=102 to the end j=1. The final content of the shift register, when combined with CR andC3, yields S₋₃(1). Referring to Fig. 3, all four readback CRC check bytes at the end of the record also may be processed through a corresponding shift register along with the data during the readback process. Just as null bytes are entered for subblock check bytes during encoding, null bytes are also entered for the CRC check byte positions at the end of the record. Similarly, null bytes are entered again for syndrome generation during the readback process. For example, check byte CRC3 is physically offset two byte positions away from the last byte, D₁, of sequence [D i ] as shown in Fig. 3. Thus, two additional null bytes are entered into the shift register for the CRC3 check byte after byte D₁ during encoding as well as during syndrome generation. Readback check byte CR andC3 is processed through premultiplier 21 in shift register 20 (Fig. 2) after byte D₁ and two null bytes. At the end of entering sequence [E₁(D i )] two null bytes need not be entered. The final contents of shift register 20 therefore is syndrome S₋₃(1). The contents of shift register 20 upon entering the last readback check byte CRC3 provides sufficient CRC check if no errors were corrected. In particular the content at j=102 is 0, if and only if, syndrome S₋₃(1) is 0. Thus, if all ECC error syndromes are 0, the immediate contents of the CRC registers at the end of the record provide a complete CRC check without requiring the final 100 shifting operations. Since most data records are error-free, this feature provides substantial performance advantage. The other CRC error syndromes are computed in like manner. Syndrome S₋₁, given by Equation (7), merely requires different multiplier circuits, namely, T⁻¹ and T¹⁰² in place of those shown in Fig. 2. Syndromes S₋₂ and S₋₄ require processing of sequences [Z and i ] and [E₁ (Z i )], in which one subblock delay equals 100 byte positions between them. Thus, the corresponding multiplier circuits for S₋₂ are T⁻² and T 2x100 , and for S₋₄ are T⁻⁴ and T 4x100 . Just as for CRC3, any other CRC check byte may be processed along with the data through its shift register by allowing an appropriate number of cycles with null byte input during encoding or syndrome generation operations. In particular, check bytes CRC1, CRC2, CRC3 and CRC4 require 0, 1, 2 and 3 additional cycles, respectively, with null byte input at the ends of their sequences [D i ] and (D and i ] or [Z i ] and [Z and i ]. If no errors are present, all CRC error syndromes will be 0. If second level error correction is required, one of the subblocks with up to four byte error corrections will be involved. Byte count "i" in sequence [D i ] for each of the four error bytes will be determined from the error location numbers generated by the second-level ECC decoders described in the Specification of European Patent Application No. 86307326.8. Thereafter, for Equation (13), the term "T -3i E₂(D i )" for each i can be computed using the same log and antilog tables as those used by the ECC decoder employing the relation T -3i E₂ (D i ) = log ⁻¹ {[log E₂(D i ) - 3i] modulo 255}. (15) When added to the previously computed S₋₃ (1), the final CRC check of Equation (9) corresponding to the CRC error syndrome S₋₃ is now complete. Similarly, the byte count i in sequence [Z i ] for each of the four errors will also be determined. Computations for syndromes S₋₁, S₋₂, S₋₃ and S₋₄ will be done in like manner. The final values of these CRC error syndromes must be all zero if all errors are corrected properly and no errors are present. Errors in CRC check bytes will tend to create unnecessary reread operations with undue performance penalty. In order to avoid such performance penalty, operational rules which balance adequate error correction and detection capability against unnecessary reread operations may be adopted. Rule 1: All CRC check bytes may be ignored if subblock level and block level ECC error syndromes are zero. Rule 2: One non-zero CRC check byte on [D i ] sequence and one such CRC check byte on [Z i ] sequence may be ignored if second level correction is not required. Rule 3: Block level ECC check byte may be ignored if all CRC checks are zero and second level correction is not required. Rule 2 allows errors in up to two CRC check bytes, one each in sequences [D i ] and [Z i ], thereby retaining the benefit of the offset between such sequences. In order to balance the errors in the odd and even phases, odd phase CRC check bytes, namely CRC1 and CRC3, are generated from the [D i ] sequence and the even phase CRC check bytes, namely CRC2 and CRC4, are generated from the [Z i ] sequence. As will be apparent from the above description, the use of four separate CRC check bytes derived from the same primitive field element in GF(2⁸) provides not only computational convenience but also a better error checking operation. The recurring offset of the sequences [D i ] and [Z i ] provides desired long cycle length without using degree-16 polynomials.

Claims: Apparatus for generating a set of CRC check bytes for a variable length record formed as a sequence of data bytes and error correction check (ECC) bytes inserted into the sequence of data bytes at preselected intervals, the ECC bytes being calculated using powers of a companion matrix T derived from an irreducible polynomial, the apparatus comprising a computing system adapted to operate on said sequence of data bytes and ECC bytes in order to generate said set of CRC check bytes; characterised in that said computing system comprises; first computing means for generating a first subset of CRC check bytes by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (-ni) D i , where D i is the ith value in said sequence of data bytes and ECC bytes after excluding a first preselected set of ECC bytes, T is the companion matrix used for computing said ECC bytes, and n is an integer different from any of the powers used for computing said ECC bytes or any other CRC check bytes; second computing means for generating a second subset of CRC check bytes, each paired with a CRC check byte in said first subset, by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (n+1)i Z i , where Z i is the ith value in said sequence of data bytes and ECC bytes after excluding a second preselected set of ECC bytes, and where n has the same value as used to generate the paired CRC check byte from the first subset; and means for combining said first and second subsets of CRC check bytes so as to generate said set of CRC check bytes. Apparatus as claimed in claim 1, for operating on a record formed as a sequence of data bytes and a set of first level error correction check bytes and a set of second level error correction check bytes, characterised in that, said first preselected set of error correction check bytes comprises all said second level error correction check bytes, and said second preselected set of error correction check bytes comprises a predetermined number of first level error correction check bytes. Apparatus as claimed in claims 1 or 2 characterised in that said first and second sub-sets of CRC check bytes each contain two check bytes. A method of generating a plurality of CRC check bytes for a variable length record formed as a sequence of data bytes and error correction check (ECC) bytes inserted into said sequence of data bytes at preselected intervals, the ECC bytes being calculated using powers of a companion matrix T derived from an irreducible polynomial, comprising performing a computation operation on said sequence of data bytes and ECC bytes in order to generate said set of CRC check bytes, characterised in that said computation operation comprises: generating a first subset of CRC check bytes by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (-ni) D i , where D i is the ith value in said sequence of data bytes and ECC bytes after excluding a first preselected set of ECC bytes, T is the companion matix used for computing said ECC bytes, and n is an integer different from any of the powers used for computing said ECC bytes or any other CRC check bytes; generating a second subset of CRC check bytes, each paired with a CRC check byte in said first subset, by sequentially receiving said sequence of data bytes and ECC bytes in said record and for each CRC check byte calculating Σ T (n+1)i Z i , where Z i is the ith value in said sequence of data bytes and ECC bytes after excluding a second preselected set of ECC bytes, and where n has the same value as used to generate the paired CRC check byte from the first subset; and combining said first and second subsets of CRC check bytes so as to generate said set of CRC check bytes. A method as claimed in claim 4, for operating on a record formed as a sequence of data bytes and a set of first level error correction check bytes and a set of second level error correction check bytes, characterised in that said first preselected set of error correction check bytes comprises all said second level error correction check bytes, and said second preselected set of error correction check bytes comprises a predetermined number of said first level correction check bytes. A method as claimed in claims 4 or 5 characterised in that said first and second sub-sets of CRC check bytes each contain two check bytes. Error correction apparatus, for performing an error correction operation on a record including a plurality of CRC check bytes (CRC) generated by a method as claimed in claim 4, said apparatus comprising a computing system for computing the value of two CRC error syndromes for use in said error correction operation, characterised in that said computing system comprises first error syndrome computing means for computing the value of a first CRC error syndrome S -n (1) adjusted for error correction in accordance with the relation where T is the companion matrix used for computing the CRC check bytes, -n is any integer, i is the byte count in a sequence D i of all the data bytes and error correction check bytes of said record, except for a first preselected set of said error correction check bytes, and E₁(D i ) is the sequence of error correction check bytes corresponding to the sequence, D i , second error syndrome computing means for computing the value of a second CRC error syndrome S -(n+1) (1) adjusted for error correction in accordance with the relation where i is the byte count in a sequence Z i of all the data bytes and error correction check bytes in said record, except for a second preselected set of said error correction check bytes, and E₁(Z i ) is the sequence of error correction check bytes corresponding to the sequence Z i , and means for utilising said two CRC error syndromes for performing said error correction operation. Error correction apparatus as claimed in claim 7, for performing an error correction operation on a record having first and second level error correction check bytes, comprising second level processing means for processing second level error correction bytes, characterised in that said second level processing means comprises first partial processing means for computing a first partial value of the CRC error syndrome adjusted for second level error correction in accordance with the relation T -ni E₂(D i ) = log ⁻¹ {[log E₂(D i ) - ni] modulo 255} where i is the byte count in a sequence D i of all the data bytes in the record and all said first level error correction check bytes but excluding all said second level error correction check bytes, and E₂(D i ) is the sequence of second level error correction bytes corresponding to the sequence, D i , first combining means for combining the first partial value of the CRC error syndrome computed by the first partial processing means with the value of the CRC error syndrome computed by said first error syndrome computing means to produce a first total value of the CRC error syndrome, second partial processing means for computing a second partial value of the CRC error syndrome adjusted for second error correction in accordance with the relation T -(n+1)i E₂(Z i ) = log ⁻¹ {[log E₂(Z i ) - (n+1)i] modulo 255}, where i is the byte count in a sequence Z i of all data bytes in the record and a predetermined number of said first level error correction check bytes but excluding all said second level error correction check bytes, and E₂(Z i ) is the sequence of second-level error correction bytes corresponding to the sequence, Z i , second combining means for combining the second partial value of the CRC error syndrome computed by said second partial processing means with the value of the CRC error syndrome computed by said second error syndrome computing means to produce a second total of the CRC error syndrome, and means for utilising said first and second total values of said CRC error syndrome for performing said error correction operation. A method of correcting errors in a record including a plurality of CRC check bytes generated by a method as claimed in claim 4, said method of correcting errors comprising performing a computing operation to compute the value of two CRC error syndromes for use in said error correction operation, characterised in that said computing operation comprises computing the value of a first CRC error syndrome S -n (1) adjusted for error correction in accordance with the relation where T is the companion matrix used for computing the CRC check bytes, -n is any integer, i is the byte count in a sequence D i of all the data bytes and error correction check bytes of said record, except for a first preselected set of said error correction check bytes, and E₁(D i ) is the sequence of error correction bytes corresponding to the sequence, D i , computing the value of a second CRC error syndrome S -(n+1) (1) adjusted for error correction in accordance with the relation where i is the byte count in a sequence Z i of all the data bytes and error correction check bytes in said record, except for a second preselected set of error correction check bytes and E₁(Z i ) is the sequence of error correction check bytes corresponding to the sequence, Z i , and utilising said two CRC error syndromes to correct said errors. A method of correcting errors as claimed in claim 9, for correcting errors in a record having first and second level error correction check bytes, said method comprising processing second level error correction bytes, characterised in that said second level processing operation comprises computing a first partial value of the CRC error syndrome adjusted for second level error correction in accordance with the relation T -ni E₂(D i ) = log ⁻¹ {[log E₂(D i ) - ni] modulo 255} where i is the byte count in a sequence D i of all data bytes in the record and all said first level error correction check bytes but excluding all said second level error correction check bytes, and E₂(D i ) is the sequence of second-level error correction bytes corresponding to the sequence, D i , combining the first partial value of the CRC error syndrome computed by the first partial processing means with the value of the CRC error syndrome computed by said first error syndrome computing means to produce a first total value of the CRC error syndrome, computing a second partial value of the CRC error syndrome adjusted for second error correction in accordance with the relation T -(n+1)i E₂(Z i ) = log ⁻¹{[log E₂(Z i ) - (n+1)i] modulo 255}, where i is the byte count in a sequence Z i of all data bytes in the record and a predetermined number of said first level error correction check bytes but excluding all said second level error correction check bytes, and E₂(Z i ) is the sequence of second-level error correction bytes corresponding to the sequence Z i , combining the second partial value of the CRC error syndrome computed by said second partial processing means with the value of the CRC error syndrome computed by said second error syndrome computing means to produce a second total of the CRC error syndrome, and utilising said first and second total values of said CRC error syndrome to correct said errors.

Inventors: PATEL ARVIND MOTIBHAI, PATEL, ARVIND MOTIBHAI,
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1987
Main classification: H03M13
IPC codes: G11B20, H03M13