Elongated burst trapping

Claim 2

An error correction processor for interleaved codes comprising: storage means for receiving and storing a block of D interleaved codewords, each codeword being of length n characters including r check characters in a code of size N characters; encoder means for computing from a given codeword a set of r remainder characters with respect to a chosen set of characters defining a code generator polynomial, said encoder means comprising encoder shift register means for receiving successive characters of said given codeword and for storing said r remainder characters, and r zero detector means for detecting whenever corresponding ones of characters stored in said encoder shift registers are zero value; a decoder processor adapted to execute an error correction algorithm so as to generate from said set of remainder characters a set of error patterns and corresponding error locations in said given codeword; and control processor means for: a. activating said encoder shift register means so as to shift each one of said D codewords in said received block individually from said storage means through said encoder means so that said encoder means generates a set of r remainder characters in said encoder shift register means corresponding to said one codeword, b. isolating said encoder means and causing said encoder means to shift its contents by one character location as many as n times so as to produce as many as n sets of r virtual check characters, c. sensing said r zero detector means and, whenever said r zero detector means detects in said encoder shift register means a continuous succession of zero-value virtual check characters in excess of a threshold number of zero-value virtual check characters, transmitting to said decoder processor the locations of the corresponding non-zero-value virtual check characters as erasure locations in all other codewords in said received block, whereby said decoder corrects said other codewords in said block from the corresponding remainder characters using said erasure locations, while said control processor means corrects said one codeword by adding said set of virtual check characters corresponding to said one shift to corresponding locations in said one codeword.

Claim 3

The error correction processor of claim 1 wherein said threshold number of continuous zero-value check characters and said code size N are chosen to correspond to a maximum probability that one or more of said zero-value virtual check characters is a false indication, said threshold number being selected so that said probability is acceptably low.

Claim 4

The error correction processor of claim 1 wherein said codewords and said code generator polynomial correspond to a Reed-Solomon code, whereby said decoder corrects as many as s erasures having designated locations and t errors of a priori unknown locations in each of said other codewords with the proviso that s+2t is no greater than r.

Claim 5

The error correction processor of claim 1 wherein said erasure locations correspond to a continuous error burst affecting the same character locations in all codewords in said block.

Claim 6

An error correction processor employing a code of size N, comprising: encoder means for computing from a given codeword of length n characters including r check characters a set of r remainder characters with respect to a chosen set of characters defining a code generator polynomial, said encoder means comprising encoder shift register means for receiving successive characters of said given codeword and for storing said r remainder characters, and r zero detector means for detecting whenever corresponding ones of characters stored in said encoder shift registers are zero value, said encoder means further comprising r adder means for adding corresponding ones of said characters stored in said encoder shift register means to individual characters in said codeword; and control processor means for: a. activating said encoder shift register means so as to shift the contents of said encoder means as many as n times so as to produce as many as n sets of r virtual check characters in said encoder shift register means, b. sensing said r zero detector means and, whenever said r zero detector means detects in said encoder shift register means a succession of zero-value virtual check characters in excess of a threshold number B of continuous zero-value virtual check characters, enabling said r adder means so as to add the non-zero-value virtual check characters produced upon said one shift of said encoder to corresponding locations in said given codeword, so as to correct said codeword, wherein said threshold B of non-zero-value check characters corresponds to a probability (N+1) - (B- 1) that one or more of said zero-value check characters is a false indication, and wherein said probability corresponds to an acceptably low residual bit error rate.

Claim 7

An error correction processor employing a code of size N, comprising: encoder means for computing from a given codeword of length n characters including r check characters a set of r remainder characters with respect to a chosen set of characters defining a code generator polynomial, said encoder means comprising encoder shift register means for receiving successive characters of said given codeword and for storing said r remainder characters, and r zero detector means for detecting whenever corresponding ones of characters stored in said encoder shift registers are zero value, said encoder means further comprising r adder means for adding corresponding ones of said characters stored in said encoder shift register means to individual characters in said codeword; and control processor means for: a. activating said encoder shift register means so as to shift the contents of said encoder means as many as n times so as to produce as many as n sets of r virtual check characters in said encoder shift register means, b. sensing said r zero detector means and, whenever said r zero detector means detects in said encoder shift register means a succession of zero-value virtual check characters in excess of a threshold number B of continuous zero-value virtual check characters, enabling said r adder means so as to add the non-zero-value virtual check characters produced upon said one shift of said encoder to corresponding locations in said given codeword, so as to correct said codeword, wherein said threshold B of non-zero-value check characters corresponds to a probability (N+1) - (B- 1) that one or more of said zero-value check characters is a false indication, and wherein said probability corresponds to an acceptably low residual bit error rate.

Claim 8

The error correction processor of claim 5 wherein N=255, r=16, B=4 and said probability is 2 -24 .

Claim 9

An error correction processor for interleaved codes comprising: storage means for receiving and storing a block of D interleaved codewords, each codeword being of length n characters including r check characters; encoder means for computing from a given codeword a set of r remainder characters with respect to a chosen set of characters defining a code generator polynomial, said encoder means comprising encoder shift register means for receiving successive characters of said given codeword and for storing said r remainder characters, and r zero detector means for detecting whenever corresponding ones of characters stored in said encoder shift registers are zero value, said encoder means further comprising r adder means for adding corresponding ones of said characters stored in said encoder shift register means to individual characters in said codeword; a decoder processor adapted to execute an error correction algorithm so as to generate from said set of remainder characters a set of error patterns and corresponding error locations in said given codeword; and control processor means for: a. activating said encoder shift register means so as to shift each one of said D codewords in said received block individually from said storage means through said encoder means so that said encoder means generates a set of r remainder characters in said encoder shift register means corresponding to said one codeword, b. isolating said encoder means and causing said encoder means to shift its contents by one character location as many as n times so as to produce as many as n sets of r virtual check characters, c. sensing said r zero detectors and determining from said r zero detectors which one of said shifts of said encoder means produces the longest continuous succession of zero-value virtual check characters in excess of a threshold number of zero-value check characters, and transmitting to said decoder processor the locations of the corresponding non-zero-value virtual check characters as erasure locations in all other codewords in said received block, whereby said decoder corrects said other codewords in said block from the corresponding remainder characters using said erasure locations, while enabling said r adder means whereby to correct said one codeword by adding said set of virtual check characters corresponding to said one shift to corresponding locations in said one codeword.

Claim 10

An error correction processor for interleaved codes comprising: storage means for receiving and storing a block of D interleaved codewords, each codeword being of length n characters including r check characters; encoder means for computing from a given codeword a set of r remainder characters with respect to a chosen set of characters defining a code generator polynomial, said encoder means comprising encoder shift register means for receiving successive characters of said given codeword and for storing said r remainder characters, and r zero detector means for detecting whenever corresponding ones of characters stored in said encoder shift registers are zero value, said encoder means further comprising r adder means for adding corresponding ones of said characters stored in said encoder shift register means to individual characters in said codeword; a decoder processor adapted to execute an error correction algorithm so as to generate from said set of remainder characters a set of error patterns and corresponding error locations in said given codeword; and control processor means for: a. activating said encoder shift register means so as to shift each one of said D codewords in said received block individually from said storage means through said encoder means so that said encoder means generates a set of r remainder characters in said encoder shift register means corresponding to said one codeword, b. isolating said encoder means and causing said encoder means to shift its contents by one character location as many as n times so as to produce as many as n sets of r virtual check characters, c. sensing said r zero detectors and determining from said r zero detectors which one of said shifts of said encoder means produces the longest continuous succession of zero-value virtual check characters in excess of a threshold number of zero-value check characters, and transmitting to said decoder processor the locations of the corresponding non-zero-value virtual check characters as erasure locations in all other codewords in said received block, whereby said decoder corrects said other codewords in said block from the corresponding remainder characters using said erasure locations, while enabling said r adder means whereby to correct said one codeword by adding said set of virtual check characters corresponding to said one shift to corresponding locations in said one codeword.

Claim 11

The error correction processor of claim 7 wherein said threshold number of continuous zero-value check characters and said code size N are chosen to correspond to a maximum probability that one or more of said zero-value virtual check characters is a false indication, said threshold number being selected so that said probability is acceptably low.

Claim 12

The error correction processor of claim 7 wherein said codewords and said code generator polynomial correspond to a Reed-Solomon code, whereby said decoder corrects as many as s erasures having designated locations and t errors of a priori unknown locations in each of said other codewords with the proviso that s+2t is no greater than r.

Claim 13

The error correction processor of claim 7 wherein said erasure locations correspond to a continuous error burst affecting the same character locations in all codewords in said block.