Modulation coding based on an ECC interleave structure

• US 6,774,825 B2
• Filed: 09/25/2002
• Issued: 08/10/2004
• Est. Priority Date: 09/25/2002
• Status: Expired due to Fees

• Current Assignee: Quarterhill Inc. (f/k/a Wi-LAN Inc.)
• Original Assignee: Infineon Technologies AG
• Inventors: Bliss, William G., Vityaev, Andrei, Karabed, Razmik, Najafi, Ali, Ashley, Jonathan
• Primary Examiner(s): JEANGLAUDE, JEAN BRUNER
• Application Number:
  US10/253,909
• Publication Number:
  US 20040056786A1
• Time in Patent Office: 685 Days
• Field of Search: 341/81, 341/107, 714/755, 714/752
• US Class Current: 341/81
• CPC Class Codes: G11B 20/1426 conversion to or from block codes or representations thereof
• CPC Class Codes: G11B 20/1833 by adding special lists or symbols to the coded information G11B20/1806, G11B20/1866 take precedence
• CPC Class Codes: G11B 20/1866 by interleaving G11B20/1809 takes precedence
• CPC Class Codes: H03M 13/27 using interleaving techniques
• CPC Class Codes: H03M 5/145 Conversion to or from block codes or representations thereof

Abstract

A system and method to modulate coding based on an ECC interleave structure include a first encoder encoding an input stream of bits comprising input blocks sorted into interleaves. A second encoder encodes a subset of the input blocks to produce output blocks, where the first encoder permutates a remainder of the input blocks and the output blocks to produce a codeword.

Claims

1. A system to modulate coding based on an error correcting code (ECC) interleave structure, comprising:

a first encoder encoding an input stream of bits comprising input blocks sorted into interleaves; and

a second encoder encoding a subset of the input blocks to produce output blocks, wherein the first encoder permutates a remainder of the input blocks and the output blocks to produce a codeword.

2. The system as recited in claim 1, wherein the first encoder providing an effective length of an error, e, for two input blocks in a same interleave to be corrupted by the error, e.

3. The system as recited in claim 1, further comprising:

a decoder inverse decoding the output blocks to restore the input blocks.

4. The system as recited in claim 1, wherein the at least one subset of the input blocks are selected so that no two blocks in the same codeword are in the same interleave and that no two blocks in two consecutive codewords are in the same interleave.

5. A system to modulate coding based on an error correcting code (ECC) interleave structure, comprising:

a first encoder encoding an input stream of bits, sorting the input bits into interleaves of input blocks, and selecting at least one subset of the input blocks, wherein each input block comprises a predetermined input block size;

a second encoder encoding the at least one subset of the input blocks to output blocks, wherein the first encoder permutates a remainder of the input blocks and the output blocks to prevent channel errors from being greater than a correction capability of the interleave; and

a decoder inverse decoding the output blocks to restore the input blocks.

6. The system as recited in claim 5, wherein no two of the at least one subset selected is in the same interleave.

7. The system as recited in claim 5, wherein the first encoder providing an effective length of an error, e, for two input blocks in a same interleave to be corrupted by the error, e.

8. The system as recited in claim 5, wherein the first encoder comprises a rate different from a rate of the second encoder.

9. The system as recited in claim 5, wherein the first encoder selects the at least one subset of the input blocks so that no two consecutive blocks in the same codeword are in the same interleave and that no two blocks in two consecutive codewords are in the same interleave.

10. The system as recited in claim 5, wherein the first encoder adds a bit at an end of the codeword to generate an even parity of the codeword.

11. The system as recited in claim 5, wherein the first encoder adds several bits to generate other parity structures or algebraic structures.

12. A method to modulate coding based on an error correcting code (ECC) interleave structure, comprising:

encoding an input stream of bits with a first encoder;

sorting the input bits into interleaves of input blocks, each input block comprising a predetermined input block size;

selecting at least one subset of the input blocks;

encoding with a second encoder the at least one subset of the input blocks to output blocks;

permutating a remainder of the input blocks and the output blocks to prevent channel errors from being greater than a correction capability of the interleave; and

inverse decoding the output blocks to restore the input blocks.

13. The method as recited in claim 12, wherein the selecting of the at least one subset of the input blocks so that no two consecutive blocks in the same codeword are in the same interleave and that no two blocks in two consecutive codewords are in the same interleave.

14. The method as recited in claim 12, further comprising:

providing an effective length of an error, e, for two input blocks in a same interleave to be corrupted by the error, e.

15. The method as recited in claim 12, further comprising:

adding a bit at an end of the codeword to generate an even parity of the codeword.

16. The method as recited in claim 12, further comprising:

adding several bits to generate other parity structures or algebraic structures.

17. A method to modulate coding based on an error correcting code (ECC) interleave structure, comprising:

selecting an n/m rate of a first encoder;

receiving an input signal comprising input bits, b(i)'"'"'s, wherein i=1, 2, . . . n;

selecting an input block size, S, for the input bits, b(i)'"'"'s;

interleaving the input bits, b(i)'"'"'s, into blocks, (B1-Bk), each block comprising the input block size, S, wherein k=n/S;

selecting at least one subset, (Bi1, Bi2, . . . , Biq), from the blocks, wherein q<

k;

mapping the at least one subset, (Bi1, Bi2, . . . , Biq) to an output vector, f=(f1, f2, . . . , fp), of a second encoder within the first encoder, wherein p is a number of output bits, f, from the second encoder; and

permutating ((f1, f2, . . . , fp), Bj1, Bj2, Bj(k−

q)) to prevent channel errors from being greater than a correction capability in the interleave, wherein (Bj1, Bj2, . . . Bj(k−

q))=(B1-Bk)−

(Bi1, Bi2, . . . , Biq), are the blocks remaining after the at least one subset, (Bi1, Bi2, . , Biq), is selected and the permutating is a permutation, P, operating on the bits of vector ((f1, f2, . . . , fp), Bj1, Bj2, Bj(k−

q)).

18. The method as recited in claim 17, wherein no two of the at least one subset, (Bi1, Bi2, . . . , Biq), selected is in the same interleave.

19. The method as recited in claim 17, wherein no t+1 of the at least one subset, (Bi1, Bi2, . . . , Biq), selected is in the same interleave, where t is a correction capability on each interleave.

20. The method as recited in claim 17, wherein an output of the first encoder and the permutation, P, comprise the following relationship:

c=(c(1), c(2) c(p+(k−

q) S))=P(((f1, f2, . . . , fp), Bj1, Bj2, Bj(k−

q)).

21. The method as recited in claim 20, wherein the permutation, P, satisfies:

(c(i1) ε

f and c(i2) ε

B) and (c(i1) and c(i2) are in a same interleave), OR

(c(i1) ε

B and c(i2) ε

B) and (c(i1) and c(i2) are in a same interleave) AND

(c(i1)&

c(i2) are in different blocks), where B=(Bj1, Bj2, . . . Bj(k−

q))=(B1-Bk)−

(Bi1, Bi2, . . . , Biq) and c=c(i1) and c(i2), then,

then, |i1-i2 |>

{circumflex over (M)}, for some predetermined integer {circumflex over (M)}, and

a last bit in a codeword and a first bit in a next codeword are not in a same interleave, wherein (Bj1, Bj2, . . . Bj(k−

q))=(B1-Bk)−

(Bi1, Bi2, . . . , Biq) comprise the blocks remaining after the at least one subset, (Bi1, Bi2, . . . , Biq), is selected.

22. The method as recited in claim 17, further comprising:

providing an effective length of an error, e, for two input blocks in a same interleave to be corrupted by the error, e.

23. The method as recited in claim 17, further comprising:

adding a bit, c(m), at an end of the codeword to generate an even parity of the codeword, wherein the codeword includes c(1) to c(m), for m=p+(k+q)S+1.

24. The method as recited in claim 17, further comprising:

inverse decoding (f1, f2, . . . , fp) to restore the at least one subset, (Bi1, Bi2, . . . , Biq), selected.

25. A computer readable medium storing a program for controlling at least one computer to perform a method comprising:

encoding an input stream of bits with a first encoder;

sorting the input bits into interleaves of input blocks, each input block comprising a predetermined input block size;

selecting at least one subset of the input blocks;

encoding with a second encoder the at least one subset of the input blocks to output blocks;

permutating a remainder of the input blocks and the output blocks to prevent channel errors from being greater than a correction capability of the interleave; and

inverse decoding the output blocks to restore the input blocks.