Continuously interleaved error correction
View Patent ↗Continuously interleaved codewords are used in a communication system to provide error correction capability. In general, each codeword shares symbols with both preceding and subsequent codewords, when the codewords are arranged in an order, such that correction of symbols in any one codeword also corrects symbols in another codeword and correction of symbols in any codeword may allow, considering possible corrections of intermediate codewords, for further correction of any codeword in the order of codewords. In one embodiment received information may be arranged in subframes, with each subframe including terminal symbols of a plurality of codewords, each of the plurality of codewords including symbols in multiple subframes.
1. A method performed using circuit of encoding data for transmission over a communication medium to enable recovery of the data, comprising:
iteratively forming codewords using circuitry, each codeword having n symbols and each codeword formed using k symbols, with each codeword formed using at least some symbols of previously formed codewords, wherein n and k are integer numbers and the codewords are transmitted with the data to enable recovery of the data by a receiver.
2. The method of claim 1 wherein each codeword includes n-k symbols of redundant information.
3. The method of claim 2 wherein each codeword is formed using at least some symbols of redundant information of previously formed codewords.
4. The method of claim 1 wherein each symbol of each codeword is a symbol in at least two codewords.
5. The method of claim 4 wherein each symbol of each codeword is a symbol in two codewords.
6. The method of claim 5 , further comprising forming at least n/2 codewords prior to iteratively forming codewords, each codeword having n symbols and each codeword formed using k symbols, with each codeword formed using at least some symbols of previously formed codewords.
7. The method of claim 5 wherein n/2 symbols of a codeword are symbols of previously formed codewords and n/2 symbols are symbols of subsequently formed codewords.
8. The method of claim 1 wherein each codeword is formed using a BCH code.
9. The method of claim 8 wherein the symbols are bits.
10. The method of claim 9 wherein the BCH code has a generator polynomial of (x 10 +x 3 +1)(x 10 +x 3 +x 2 +x+1)(x 10 +x 5 +x 3 +x 2 +1)(x 2 +1).
11. A method performed using circuitry of forming codewords with error correction information to enable data recovery in a communications system, comprising:
forming a codeword of n bits using k bits using circuitry, the codeword including n-k parity bits, each of the n bits being in at least one other codeword of n bits, at least some of the k bits being parity bits of other codewords, wherein n and k are integer numbers.
12. A method performed using circuitry of decoding received information to correct for errors in communication of the received information to recover data in a communications system. comprising:
receiving a stream of information, the information comprised of bits;
iteratively decoding. using circuitry, codewords of the received stream of information, each bit of each codeword being in at least two codewords, with some of the bits of any particular codeword of the codewords being in a codeword whose last bit was received prior to receipt of the particular codeword, and with others of the bits of any particular codeword received subsequent to receipt of the last bit of the particular codeword, the received stream of information being encoded to enable recovery of data included in the stream of information.
13. A method performed using circuitry of decoding information arranged in subframes, each subframe including 32640 bits, each subframe including a final 510 bits of 64 codewords of a BCH (1020,988) code, with a first 510 bits of the 64 codewords spread over 8 other subframes, each of which also a final 510 bits of 64 other codewords of a BCH (1020,988) code, comprising decoding, using circuitry, codewords which terminate in a particular subframe, correcting bits of the codewords pursuant to the decoding, including bits which are in other subframes and other codewords, and decoding the other codewords.