System and Method of Encoding and Transmitting Codewords

1. A method comprising: performing a first encoding of a first message to produce a first codeword where the first message is related to and has the same length as an original message; generating a second message by at least algebraically modifying a third message, the second message having the same length as the original message, and the third message is related to and has the same length as the original message; performing a second encoding of the second message to produce a second codeword; and transmitting at least part of the first codeword and transmitting at least part of the second codeword; wherein transmitting at least part of the first codeword and transmitting at least part of the second codeword are performed from different locations.

2. The method of claim 1 wherein the third message is the original message.

3. The method of claim 1 wherein: generating the second message comprises interleaving the original message to produce the third message.

4. The method of claim 1 wherein: performing a first encoding comprises using a non-recursive convolutional encoder; and performing a second encoding comprises using a non-recursive convolutional encoder.

5. The method of claim 1 wherein: generating the second message and performing the second encoding of the second message to produce a second codeword are performed such that the second codeword is the same as what would have been obtained by encoding the third message with a recursive systematic code.

6. The method of claim 5 wherein: the second encoding uses a non-systematic convolution code with generator polynomials G 1 and G 2 ; the recursive systematic code has generator polynomials G 1 and G 2 , where G 1 is a feedback generator polynomial; and algebraically modifying the third message to produce the second message comprises: determining the second message=Q([third message, tail sequence]/G 1 ) where Q(y/x) defines the quotient that results from deconvolving the third message by G 1 , and wherein tail sequence is a sequence which drives a linear feedback shift register with feedback generator polynomial G 1 to zero from an ending state when inputting the third message.

7. The method of claim 1 further comprising: generating the first message by at least performing algebraically modifying a fourth message, wherein the fourth message has the same length as the original message.

8. The method of claim 7 wherein the fourth message is the original message.

9. The method of claim 7 wherein: generating the first message comprises interleaving the original message to produce the fourth message.

10. The method of claim 7 wherein: generating the first message and performing the first encoding of the first message to produce the first codeword are performed such that the first codeword is the same as what would have been obtained by encoding the fourth message with a recursive systematic code; and generating the second message and performing the second encoding of the second message to produce the second codeword are performed such that the second codeword is the same as what would have been obtained by encoding the third message with a recursive systematic code.

11. The method of claim 10 wherein: the first codeword and the second codeword are the same as what would have been obtained by encoding the original message with a turbo encoder.

12. The method of claim 10 wherein: determining the second message=Q([third message, tail sequence]/G 1 ) where Q(y/x) defines the quotient that results from deconvolving the third message by G 1 , and wherein tail sequence is a sequence which drives a linear feedback shift register with feedback generator polynomial G 1 to zero from an ending state when inputting the third message; and determining the fourth message=Q([first message, tail sequence]/G 1 ) where Q(y/x) defines the quotient that results from deconvolving the first message by G 1 , and wherein tail sequence is a sequence which drives a linear feedback shift register with feedback generator polynomial G 1 to zero from an ending state when inputting the first message.

13. The method of claim 1 wherein transmitting at least part of the first codeword and transmitting at least part of the second codeword are performed from a common location.

14. The method of claim 1 wherein: transmitting at least part of the first codeword is performed using a first network; and transmitting at least part of the second codeword is performed using a second network.

15. The method of claim 1 wherein: transmitting at least part of the first codeword is performed using a first radio access technology; and transmitting at least part of the second codeword is performed using a second radio access technology operating independently from the first radio access technology.

16. The method of claim 1 wherein: transmitting at least part of the first codeword is performed over a first carrier; and transmitting at least part of the second codeword is performed over a second carrier different from the first carrier.

17. The method of claim 1 wherein: transmitting at least part of the first codeword is performed using a first carrier; and transmitting at least part of the second codeword is performed using the first carrier but at a different time from transmitting at least part of the first codeword.

18. The method of claim 1 wherein: transmitting at least part of the first codeword is performed using a first carrier; and transmitting at least part of the second codeword is performed using the first carrier concurrently with the transmission of the first codeword and using a same physical resource.

19. The method of claim 1 wherein transmitting the first and second codewords are performed by a single transmitter.

20. The method of claim 1 further comprising: transmitting signaling to indicate that transmitted codewords should together be treated as a turbo codeword.

21. A mobile device configured to perform the method of claim 1 .

22. A network element configured to perform the method of claim 1 .