Parallel concatenated code with soft-in soft-out interactive turbo decoder

• US 7,570,700 B2
• Filed: 07/22/2004
• Issued: 08/04/2009
• Est. Priority Date: 09/12/2000
• Status: Expired due to Fees

• Current Assignee: Broadcom Corporation (Broadcom, Inc.)
• Original Assignee: Broadcom Corporation (Broadcom, Inc.)
• Inventors: Shen, Ba-Zhong, Jones, Christopher R., Tran, Hau Thien, Cameron, Kelly B.
• Primary Examiner(s): WANG, TED M
• Application Number:
  US10/897,200
• Publication Number:
  US 20050021555A1
• Time in Patent Office: 1,839 Days
• Field of Search: 375/265, 375/262, 375/341, 714/701, 714/746, 714/755
• US Class Current: 375/265
• CPC Class Codes: H03M 13/151 using error location or error correction polynomials
• CPC Class Codes: H03M 13/1515 Reed-Solomon codes
• CPC Class Codes: H03M 13/25 Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] modulation codes H03M13/31
• CPC Class Codes: H03M 13/258 with turbo codes, e.g. Turbo Trellis Coded Modulation [TTCM]
• CPC Class Codes: H03M 13/27 using interleaving techniques
• CPC Class Codes: H03M 13/2757 Interleaver with an interleaving rule not provided for in the subgroups H03M13/2703 - H03M13/2753
• CPC Class Codes: H03M 13/29 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
• CPC Class Codes: H03M 13/2966 Turbo codes concatenated with another code, e.g. an outer block code
• CPC Class Codes: H03M 13/2978 Particular arrangement of the component decoders
• CPC Class Codes: H03M 13/3905 Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding
• CPC Class Codes: H03M 13/3922 Add-Compare-Select [ACS] operation in forward or backward recursions
• CPC Class Codes: H03M 13/3927 Log-Likelihood Ratio [LLR] computation by combination of forward and backward metrics into LLRs
• CPC Class Codes: H03M 13/3972 using sliding window techniques or parallel windows
• CPC Class Codes: H03M 13/3988 for rate k/n convolutional codes, with k>1, obtained by convolutional encoders with k inputs and n outputs
• CPC Class Codes: H03M 13/4107 implementing add, compare, select [ACS] operations
• CPC Class Codes: H03M 13/6505 Memory efficient implementations
• CPC Class Codes: H03M 13/6561 Parallelized implementations
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 1/005 Iterative decoding, including iteration between signal detection and decoding operation
• CPC Class Codes: H04L 1/006 Trellis-coded modulation
• CPC Class Codes: H04L 1/0065 : Serial concatenated codes
• CPC Class Codes: H04L 1/0066 : Parallel concatenated codes
• CPC Class Codes: H04L 1/0068 : by puncturing
• CPC Class Codes: H04L 1/0071 : Use of interleaving interleaving per se H03M13/27

Abstract

A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo−N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed. If the input tuples comprise multiple bits, the bits may be interleaved independently to interleaved positions having the same modulo−N and the same bit position. This may improve the robustness of the code. A first encoder may have no interleaver or all encoders may have interleavers, whether the input tuple bits are interleaved independently or not. Modulo type interleaving also allows decoding in parallel.

Claims

1. A method for producing a coded signal from a sequence of tuples, the method comprising:

employing an encoder to encode the sequence of tuples in a first encoding;

modulo interleaving the sequence of tuples in at least one interleaving;

encoding the modulo interleaved sequence of tuples in at least one encoding, such that each respective encoding of the at least one encoding encodes one corresponding modulo interleaved sequence of tuples generated by one corresponding interleaving of the at least one interleaving;

selecting the encoded tuples sequentially from each encoding of the first encoding and the at least one encoding; and

mapping the selected tuples to at least one constellation in at least one mapper.

2. The method as in claim 1, wherein:

encoding the sequence of tuples in the first encoding comprises systematically encoding the sequence of tuples in the first encoding.

3. The method as in claim 1, wherein:

encoding the sequence of tuples in the first encoding comprises nonsystematically encoding the sequence of tuples in the first encoding.

4. The method as in claim 1, wherein:

encoding the sequence of tuples in the first encoding comprises convolutionally encoding the sequence of tuples in the first encoding.

5. The method as in claim 1, wherein:

encoding the sequence of tuples in the first encoding comprises recursively encoding the sequence of tuples in the first encoding.

6. The method as in claim 1, wherein:

modulo interleaving the sequence of tuples in at least one interleaving comprises ST (Separate Tuple) interleaving.

7. The method as in claim 1, wherein:

encoding the modulo interleaved sequence of tuples in at least one encoding comprises systematically encoding the sequence of N tuples.

8. The method as in claim 1, wherein:

encoding the modulo interleaved sequence of tuples in at least one encoding comprises nonsystematically encoding.

9. The method as in claim 1, wherein:

encoding the modulo interleaved sequence of tuples in at least one encoding comprises convolutionally encoding.

10. The method as in claim 1, wherein:

encoding the modulo interleaved sequence of tuples in at least one encoding comprises recursively encoding.

11. The method as in claim 1, wherein:

selecting the encoded tuples sequentially from each encoding of the first encoding and the at least one encoding comprises puncturing at least one bit from at least one of the first encoding and the at least one encoding.

12. The method as in claim 11, wherein:

the puncturing of at least one bit from at least one of the first encoding and the at least one encoding further comprises substituting at least one uncoded bit for at least one bit within at least one of the selected encoded tuples.

13. An apparatus that produces a coded signal from a sequence of tuples, the apparatus comprising:

a first encoder that encodes the sequence of tuples in a first encoding;

at least one modulo interleaver that interleaves the sequence of tuples in at least one interleaving;

at least one second encoder that encodes the modulo interleaved sequence of tuples in at least one encoding, such that each respective encoder of the at least one second encoder encodes one corresponding modulo interleaved sequence of tuples generated by one corresponding modulo interleaver of the at least one modulo interleaver;

a selector that selects encoded tuples sequentially from each encoding of the first encoding and the at least one encoding; and

at least one mapper that maps the selected tuples to at least one constellation.

14. The apparatus as in claim 13, wherein:

the first encoder comprises a systematic encoder.

15. The apparatus as in claim 13, wherein:

the first encoder comprises a nonsystematic encoder.

16. The apparatus as in claim 13, wherein:

the first encoder encodes the sequence of tuples in the first encoding that comprises convolutionally encoding the sequence of tuples in the first encoding.

17. The apparatus as in claim 13, wherein:

the first encoder is a recursive encoder.

18. The apparatus as in claim 13, wherein:

the at least one modulo interleaver comprises at least one modulo ST (Separate Tuple) interleaving.

19. The apparatus as in claim 13, wherein:

encoding the modulo interleaved sequence of tuples in at least one encoding comprises systematically encoding the sequence of N tuples.

20. The apparatus as in claim 13, wherein:

the at least one second encoder comprises a nonsystematic encoder.

21. The apparatus as in claim 13, wherein:

the at least one second encoder comprises a convolutional encoder.

22. The apparatus as in claim 13, wherein:

the at least one second encoder comprises a recursive encoder.

23. The apparatus as in claim 13, wherein:

the selector that selects encoded tuples sequentially from each encoding further comprises puncturing means for puncturing at least one bit from at least one of the first encoding and the at least one encoding.

24. The apparatus as in claim 23, wherein:

the puncturing means further comprises means for substituting at least one uncoded bit for at least one bit within at least one of the selected encoded tuples.