METHOD AND SYSTEM FOR JOINT ENCODING MULTIPLE INDEPENDENT INFORMATION MESSAGES

• US 20090207725A1
• Filed: 02/10/2009
• Published: 08/20/2009
• Est. Priority Date: 02/11/2008
• Status: Abandoned Application

• Current Assignee: ZTE Corporation
• Original Assignee: ZTE Corporation
• Inventors: ZHANG, Wenfeng
• Application Number:
  US12/368,922
• Publication Number:
  US 20090207725A1
• Time in Patent Office: Days
• US Class Current: 370/203
• CPC Class Codes: H04L 1/0026 Transmission of channel quality indication
• CPC Class Codes: H04L 1/0028 Formatting
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 1/0068 by puncturing
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 1/0073 Special arrangements for feedback channel
• CPC Class Codes: H04L 1/1671 the supervisory signal being transmitted together with control information
• CPC Class Codes: H04L 1/1812 Hybrid protocols; Hybrid automatic repeat request [HARQ]

Abstract

A method and system for joint encoding multiple independent information messages are disclosed. In one embodiment, a system includes an encoder configured to encode each of the independent information messages to produce respective encoded bits, and a first multiplexer configured to multiplex each of the independent information messages. A joint block encoder encodes the multiplexed independent information messages to produce encoded common parity bits shared by all independent information messages, and a second multiplexer multiplexes the respective encoded bits from all independent channel encoders and the encoded common parity bits from the joint block encoder to produce the final output.

Claims

1. A method for jointly encoding multiple independent information messages in a communication system, comprising:

encoding each of the independent information messages to produce respective encoded bits;

multiplexing each of the independent information messages;

joint encoding the multiplexed independent information messages to produce encoded common parity bits shared by all independent information messages; and

multiplexing the respective encoded bits from each of the independent informant messages and the encoded common parity bits.

2. The method of claim 1, wherein the joint encoding comprises generating a matrix G₀ in dimension

$(\sum _{}^{}$

i = 1 L 

K i ) ×

( N - ∑

i = 1 L 

M i ) ,

where L is a total number of independent information messages, N is a total length of a final output codeword, K_i is a length of i-th information message and M_i is an output length for the i-th encoded independent information message.

3. The method of claim 2, wherein an output of the joint encoding is express by {right arrow over (x)} G₀, where {right arrow over (x)} is a row vector of length

$\sum _{}^{}$

i = 1 L 

K i

and is obtained by multiplexing all independent information message bits, and the matrix G₀ is realized using a tentative block code

$\left(n=N-\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br>\left(M_i-K_i\right),k=\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br>K_i\right)$

that has a systematic generator matrix obtained from a lookup table.

4. The method of claim 1, further comprising:

individually encoding one or more independent information messages depending on a required error protection of the one or more independent information messages.

5. The method of claim 4, wherein an error protection capability for each of the one or more independent information messages is lower-bounded by d_min(G_i)+d_min(G₀) (i=1 . . . L) for message i, where d_min(G_i) is a minimum hamming distance of code space spanned by a generator matrix G_i, L is the number of the one or more independent information messages, and G₀ is a joint encoder generator matrix.

6. The method of claim 5, wherein the error protection for each of the one or more independent information messages is realized by differentiating d_min(G_i) (i=1 . . . L) for each of the one or more independent information messages i.

7. The method of claim 6, wherein when L=2, the generator matrix G is represented by

$\begin{array}{c}(\begin{array}{cc}{G}_1& 0\\ 0& G_2\end{array}\end{array}$

G 0 ) .

8. The method of claim 4, wherein the multiplexing the respective encoded bits from all independent channel encoders and the encoded common parity bits comprises further multiplexing coded bits from the joint encoding that have been punctured, wherein the number of punctured bits is not large enough to make an effective generator matrix singular for each independent information message.

9. The method of claim 8, further comprising:

interleaving the multiplexed coded bits such that punctured positions are evenly distributed within a frame.

10. The method of claim 9, wherein the interleaving comprises:

shuffling columns of the generator matrix of original code before further multiplexing coded bits from the joint encoding that have been punctured.

11. The method of claim 4, wherein the individually encoding comprises:

individual encoding N_ACK bits of ACK/NACK information, wherein a repetition code, whose generator matrix is

$\left(\underset{\underset{\mathrm{all}<br><br><br><br>1\text{'}"\text{'}"\text{'}<br><br>s}{\mathrm{<br><br>}}}{1<br><br><br><br>\mathrm{\dots <br><br>}<br><br><br><br>1}\right),$

shall be used when N_ACK=1, and a cyclic simplex code, whose systematic generator matrix for one cycle is

$\left(\begin{array}{ccc}1& 0& 1\\ 0& 1& 1\end{array}\right),$

shall be used when N_ACK=2.

12. The method of claim 11, wherein ACK is represented by logic 1, and NACK is represented by logic 0, and the ACK/NACK bits follow the CQI bits in a bit ordering of input to the joint encoding, such that if the input bits the joint encoding are defined as a₀, a₁, a₂, a₃, . . . , a_A-1 the ACK/NACK and CQI bits are multiplexed before the joint encoding in such a way that

$a_i=\{\begin{array}{c}\mathrm{CQI}\end{array}$



bit 0 ≤

i <

N CQI ACK 



bit N CQI ≤

i <

A .

13. The method of claim 4, wherein the output coded bits from the joint encoding are modulated onto available data symbols, while the output coded bits from the individually encoding are modulated onto either available data symbols or non-data symbols.

14. The method of claim 10, further comprising:

receiving the multiplexed encoded bits without ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

15. The method of claim 10, further comprising:

receiving the multiplexed encoded bits with ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

16. The method of claim 10, further comprising:

receiving the multiplexed encoded bits to decode CQI bits only.

17. The method of claim 13, further comprising:

receiving the multiplexed encoded bits with ACK DTX handling by default to decode joint ACK/NACK and CQI transmission.

18. The method of claim 13, further comprising:

receiving the multiplexed encoded bits to decode CQI bits only.

19. The method of claim 10, further comprising:

logically converting the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

20. The method of claim 13, further comprising:

logically converting the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

21. The method of claim 14, further comprising:

logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

22. The method of claim 15, further comprising:

logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

23. The method of claim 17, further comprising:

logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

24. A system for jointly encoding multiple independent information messages in a communication system, comprising:

an encoder encoding each of the independent information messages to produce respective encoded bits;

a first multiplexer multiplexing each of the independent information messages;

a joint block encoder encoding the multiplexed independent information messages to produce encoded common parity bits shared by all independent information messages; and

a second multiplexer multiplexing the respective encoded bits from each of the independent informant messages and the encoded common parity bits.

25. The system of claim 24, wherein the joint block encoder is further configured to generate a matrix G₀ in dimension

$(\sum _{}^{}$

i = 1 L 

K i ) ×

( N - ∑

i = 1 L 

M i ) ,

where L is a total number of independent information messages, N is a total length of a final output codeword, K_i is a length of i-th information message and M_i is an output length for the i-th encoded independent information message.

26. The system of claim 25, wherein an output of the joint block encoder is express by {right arrow over (x)} G₀, where {right arrow over (x)} is a row vector of length

$\sum _{}^{}$

i = 1 L 

K i

and is obtained by multiplexing all independent information message bits, and the matrix G₀ is realized using a tentative block code

$\left(n=N-\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br>\left(M_i-K_i\right),k=\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br>K_i\right)$

that has a systematic generator matrix obtained from a lookup table.

27. The system of claim 24, further comprising:

an individual encoder configured to individually encode one or more independent information messages depending on a required error protection of the one or more independent information messages.

28. The system of claim 27, wherein an error protection capability for each of the one or more independent information messages is lower-bounded by d_min(G_i)+d_min(G₀) (i=1 . . . L) for message i, where d_min(G_i) is a minimum hamming distance of code space spanned by a generator matrix G_i, L is the number of the one or more independent information messages, and G₀ is a joint encoder generator matrix.

29. The system of claim 28, wherein the error protection for each of the one or more independent information messages is realized by differentiating d_min(G_i) (i=1 . . . L) for each of the one or more independent information messages i.

30. The system of claim 29, wherein when L=2, the generator matrix G is represented by

$\begin{array}{c}(\begin{array}{cc}{G}_1& 0\\ 0& G_2\end{array}\end{array}$

G 0 ) .

31. The system of claim 27, wherein the second multiplexer is further configured to multiplex coded bits from the joint encoding that have been punctured, wherein the number of punctured bits is not large enough to make an effective generator matrix singular for each independent information message.

32. The system of claim 31, further comprising:

an interleaver configured to interleave the multiplexed coded bits such that punctured positions are evenly distributed within a frame.

33. The system of claim 32, wherein the interleaver is further configured to:

shuffle columns of the generator matrix of original code before further multiplexing coded bits from the joint encoding that have been punctured.

34. The system of claim 27, wherein the individually encoder is further configured to:

individual encode N_ACK bits of ACK/NACK information, wherein a repetition code, whose generator matrix is

$\left(\underset{\underset{\mathrm{all}<br><br><br><br>1\text{'}"\text{'}"\text{'}<br><br>s}{\mathrm{<br><br>}}}{1<br><br><br><br>\mathrm{\dots <br><br>}<br><br><br><br>1}\right),$

shall be used when N_ACK=1, and a cyclic simplex code, whose systematic generator matrix for one cycle is

$\left(\begin{array}{ccc}1& 0& 1\\ 0& 1& 1\end{array}\right),$

shall be used when N_ACK=2.

35. The system of claim 34, wherein ACK is represented by logic 1, and NACK is represented by logic 0, and the ACK/NACK bits follow the CQI bits in a bit ordering of input to the joint encoding, such that if the input bits the joint encoding are defined as a₀, a₁, a₂, a₃, . . . , a_A-1, the ACK/NACK and CQI bits are multiplexed before the joint encoding in such a way that

$a_i=\{\begin{array}{c}\mathrm{CQI}\end{array}$



bit 0 ≤

i <

N CQI ACK 



bit N CQI ≤

i <

A .

36. The system of claim 27, wherein the output coded bits from the joint block encoder are modulated onto available data symbols, while the output coded bits from the individual encoder are modulated onto either available data symbols or non-data symbols.

37. The system of claim 33, further comprising:

a receiver configured to receive the multiplexed encoded bits without ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

38. The system of claim 33, further comprising:

a receiver configured to receive the multiplexed encoded bits with ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

39. The system of claim 33, further comprising:

a receiver configured to receive the multiplexed encoded bits to decode CQI bits only.

40. The system of claim 36, further comprising:

a receiver configured to receive the multiplexed encoded bits with ACK DTX handling by default to decode joint ACK/NACK and CQI transmission.

41. The system of claim 36, further comprising:

a receiver configured to receive the multiplexed encoded bits to decode CQI bits only.

42. The system of claim 33, further comprising:

a logical converter configured to logically convert the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

43. The system of claim 36, further comprising:

a logical converter configured to logically convert the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

44. The system of claim 37, further comprising:

a logical converter configured to logically convert the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

45. The system of claim 38, further comprising:

a logical converter configured to logically convert the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

46. The system of claim 40, further comprising:

a logical converter configured to logically convert the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

47. A computer-readable medium storing instructions thereon for performing a method of jointly encoding multiple independent information messages in a communication system, the method comprising:

encoding each of the independent information messages to produce respective encoded bits;

multiplexing each of the independent information messages;

joint encoding the multiplexed independent information messages to produce encoded common parity bits shared by all independent information messages; and

multiplexing the respective encoded bits from each of the independent informant messages and the encoded common parity bits.

48. The computer-readable medium of claim 47, wherein the joint encoding comprises generating a matrix G₀ in dimension

$(\sum _{}^{}$

i = 1 L 



K i ) ×

( N - ∑

i = 1 L 

M i ) ,

where L is a total number of independent information messages, N is a total length of a final output codeword, K_i is a length of i-th information message and M_i is an output length for the i-th encoded independent information message.

49. The computer-readable medium of claim 48, wherein an output of the joint encoding is express by {right arrow over (x)} G₀, where {right arrow over (x)} is a row vector of length

$\sum _{}^{}$

i = 1 L 



K i

and is obtained by multiplexing all independent information message bits, and the matrix G₀ is realized using a tentative block code

$\left(n=N-\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br><br><br>\left(M_i-K_i\right),k=\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br><br><br>K_i\right)$

that has a systematic generator matrix obtained from a lookup table.

50. The computer-readable medium of claim 47, further comprising:

individually encoding one or more independent information messages depending on a required error protection of the one or more independent information messages.

51. The computer-readable medium of claim 50, wherein an error protection capability for each of the one or more independent information messages is lower-bounded by d_min(G_i)+d_min(G₀) (i=1 . . . L) for message i, where d_min(G_i) is a minimum hamming distance of code space spanned by a generator matrix G_i, L is the number of the one or more independent information messages, and G₀ is a joint encoder generator matrix.

52. The computer-readable medium of claim 51, wherein the error protection for each of the one or more independent information messages is realized by differentiating d_min(G_i) (i=1 . . . L) for each of the one or more independent information messages i.

53. The computer-readable medium of claim 52, wherein when L=2, the generator matrix G is represented by

$(\begin{array}{cc}{G}_1& 0\\ 0& G_2\end{array}$





G 0 ) .

54. The computer-readable medium of claim 50, wherein the multiplexing the respective encoded bits from all independent channel encoders and the encoded common parity bits comprises further multiplexing coded bits from the joint encoding that have been punctured, wherein the number of punctured bits is not large enough to make an effective generator matrix singular for each independent information message.

55. The computer-readable medium of claim 54, further comprising:

interleaving the multiplexed coded bits such that punctured positions are evenly distributed within a frame.

56. The computer-readable medium of claim 55, wherein the interleaving comprises:

shuffling columns of the generator matrix of original code before further multiplexing coded bits from the joint encoding that have been punctured.

57. The computer-readable medium of claim 50, wherein the individually encoding comprises:

individual encoding N_ACK bits of ACK/NACK information, wherein a repetition code, whose generator matrix is

$\left(\underset{\underset{\mathrm{all}<br><br><br><br>1\text{'}"\text{'}"\text{'}<br><br>s}{\mathrm{<br><br>}}}{1<br><br><br><br>\mathrm{\dots <br><br>}<br><br><br><br>1}\right),$

shall be used when N_ACK=1, and a cyclic simplex code, whose systematic generator matrix for one cycle is

$\left(\begin{array}{ccc}1& 0& 1\\ 0& 1& 1\end{array}\right),$

shall be used when N_ACK=2.

58. The computer-readable medium of claim 57, wherein ACK is represented by logic 1, and NACK is represented by logic 0, and the ACK/NACK bits follow the CQI bits in a bit ordering of input to the joint encoding, such that if the input bits the joint encoding are defined as a₀, a₁, a₂, a₃, . . . , a_A-1, the ACK/NACK and CQI bits are multiplexed before the joint encoding in such a way that

$a_i=\{\begin{array}{c}\mathrm{CQI}\end{array}$



bit 0 ≤

i <

N CQI ACK 



bit N CQI ≤

i <

A .

59. The computer-readable medium of claim 50, wherein the output coded bits from the joint encoding are modulated onto available data symbols, while the output coded bits from the individually encoding are modulated onto either available data symbols or non-data symbols.

60. The computer-readable medium of claim 56, further comprising:

receiving the multiplexed encoded bits without ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

61. The computer-readable medium of claim 56, further comprising:

receiving the multiplexed encoded bits with ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

62. The computer-readable medium of claim 56, further comprising:

receiving the multiplexed encoded bits to decode CQI bits only.

63. The computer-readable medium of claim 59, further comprising:

receiving the multiplexed encoded bits with ACK DTX handling by default to decode joint ACK/NACK and CQI transmission.

64. The computer-readable medium of claim 59, further comprising:

receiving the multiplexed encoded bits to decode CQI bits only.

65. The computer-readable medium of claim 56, further comprising:

logically converting the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

66. The computer-readable medium of claim 59, further comprising:

logically converting the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

67. The computer-readable medium of claim 60, further comprising:

logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

68. The computer-readable medium of claim 61, further comprising:

logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

69. The computer-readable medium of claim 63, further comprising:

logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

70. A system for jointly encoding multiple independent information messages in a communication system, comprising:

means for encoding each of the independent information messages to produce respective encoded bits;

means for multiplexing each of the independent information messages;

means for joint encoding the multiplexed independent information messages to produce encoded common parity bits shared by all independent information messages; and

means for multiplexing the respective encoded bits from each of the independent informant messages and the encoded common parity bits.

71. The system of claim 70, wherein the means for joint encoding comprises means for generating a matrix G₀ in dimension

$(\sum _{}^{}$

i = 1 L 



K i ) ×

( N - ∑

i = 1 L 

M i ) ,

where L is a total number of independent information messages, N is a total length of a final output codeword, K_i is a length of i-th information message and M_i is an output length for the i-th encoded independent information message.

72. The system of claim 71, wherein an output of the joint encoding is express by {right arrow over (x)}·

G₀, where {right arrow over (x)} is a row vector of length

$\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br><br><br>K_i$

and is obtained by multiplexing all independent information message bits, and the matrix G₀ is realized using a tentative block code

$\left(n=N-\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br><br><br>\left(M_i-K_i\right),k=\underset{i=1}{\overset{L}{\sum <br><br>}}<br><br><br><br>K_i\right)$

that has a systematic generator matrix obtained from a lookup table.

73. The system of claim 72, further comprising:

means for individually encoding one or more independent information messages depending on a required error protection of the one or more independent information messages.

74. The system of claim 73, wherein an error protection capability for each of the one or more independent information messages is lower-bounded by d_min(G_i)+d_min(G₀) (i=1 . . . L) for message i, where d_min(G_i) is a minimum hamming distance of code space spanned by a generator matrix G_i, L is the number of the one or more independent information messages, and G₀ is a joint encoder generator matrix.

75. The system of claim 74, wherein the error protection for each of the one or more independent information messages is realized by differentiating d_min(G_i) (i=1 . . . L) for each of the one or more independent information messages i.

76. The system of claim 75, wherein when L=2, the generator matrix G is represented by

$(\begin{array}{cc}{G}_1& 0\\ 0& G_2\end{array}$





G 0 ) .

77. The system of claim 73, wherein the means for multiplexing the respective encoded bits from all independent channel encoders and the encoded common parity bits comprises further means for multiplexing coded bits from the joint encoding that have been punctured, wherein the number of punctured bits is not large enough to make an effective generator matrix singular for each independent information message.

78. The system of claim 77, further comprising:

means for interleaving the multiplexed coded bits such that punctured positions are evenly distributed within a frame.

79. The system of claim 78, wherein the means for interleaving comprises:

means for shuffling columns of the generator matrix of original code before further multiplexing coded bits from the joint encoding that have been punctured.

80. The system of claim 73, wherein the means for individually encoding comprises:

means for individual encoding N_ACK bits of ACK/NACK information, wherein a repetition code, whose generator matrix is

$\left(\underset{\underset{\mathrm{all}<br><br><br><br>1\text{'}"\text{'}"\text{'}<br><br>s}{\mathrm{<br><br>}}}{1<br><br><br><br>\mathrm{\dots <br><br>}<br><br><br><br>1}\right),$

shall be used when N_ACK=1, and a cyclic simplex code, whose systematic generator matrix for one cycle is

$\left(\begin{array}{ccc}1& 0& 1\\ 0& 1& 1\end{array}\right),$

shall be used when N_ACK=2.

81. The system of claim 80, wherein ACK is represented by logic 1, and NACK is represented by logic 0, and the ACK/NACK bits follow the CQI bits in a bit ordering of input to the means for joint encoding, such that if the input bits the joint encoding are defined as a₀, a₁, a₂, a₃, . . . , a_A-1, the ACK/NACK and CQI bits are multiplexed before the joint encoding in such a way that

$a_i=\{\begin{array}{c}\mathrm{CQI}\end{array}$



bit 0 ≤

i <

N CQI ACK 



bit N CQI ≤

i <

A .

82. The system of claim 76, wherein the output coded bits from the means for joint encoding are modulated onto available data symbols, while the output coded bits from the means for individually encoding are modulated onto either available data symbols or non-data symbols.

83. The system of claim 79, further comprising:

means for receiving the multiplexed encoded bits without ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

84. The system of claim 79, further comprising:

means for receiving the multiplexed encoded bits with ACK DTX handling to decode a joint ACK/NACK and CQI transmission.

85. The system of claim 79, further comprising:

means for receiving the multiplexed encoded bits to decode CQI bits only.

86. The system of claim 82, further comprising:

means for receiving the multiplexed encoded bits with ACK DTX handling by default to decode joint ACK/NACK and CQI transmission.

87. The system of claim 82, further comprising:

means for receiving the multiplexed encoded bits to decode CQI bits only.

88. The system of claim 79, further comprising:

means for logically converting the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

89. The system of claim 82, further comprising:

means for logically converting the ACK/NACK information before the individually encoding, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

90. The system of claim 83, further comprising:

means for logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

91. The system of claim 84, further comprising:

means for logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.

92. The system of claim 86, further comprising:

means for logically converting the received ACK/NACK information, if the ACK is initially represented by logic 0 and the NACK is initially represented by logic 1.