Trellis coded modulation employing lower dimensionality convolutional encoder

• US 5,706,312 A
• Filed: 03/31/1997
• Issued: 01/06/1998
• Est. Priority Date: 10/11/1994
• Status: Expired due to Term

• Current Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Wei, Lee-Fang
• Primary Examiner(s): TSE, YOUNG TOI
• Application Number:
  US08/840,438
• Time in Patent Office: 281 Days
• Field of Search: 375/262, 375/264, 375/265, 375/286, 375/295, 375/298, 375/340-341, 371/37.5, 371/37.8, 371/43
• US Class Current: 375/298
• CPC Class Codes: H03M 13/1515 Reed-Solomon codes
• CPC Class Codes: H03M 13/253 with concatenated codes
• CPC Class Codes: H03M 13/2936 comprising an outer Reed-Solomon code and an inner convolutional code
• CPC Class Codes: H04L 1/006 Trellis-coded modulation
• CPC Class Codes: H04N 21/2383 Channel coding or modulation of digital bit-stream, e.g. QPSK modulation arrangements for detecting or preventing errors in the information received by adapting the channel coding H04L1/0009; analogue front ends or means for connecting modulators, demodulators or transceivers to a transmission line H04L27/0002
• CPC Class Codes: H04N 21/426 Internal components of the client ; Characteristics thereof H04N5/44 takes precedence
• CPC Class Codes: H04N 21/4382 Demodulation or channel decoding, e.g. QPSK demodulation analog front ends or means for connecting modulators, demodulators or transceivers to a transmission line H04L27/0002

Abstract

Coding gain is improved by employing an N-dimensional trellis encoder incorporating an N'"'"'-dimensional convolutional encoder where N'"'"' is less than N. The additional coding gain is realized as a shaping gain. This unique modulator encodes a digital signal by generating a sequence of N-dimensional symbols as a function of the digital signal using an N'"'"'-dimensional convolutional encoder within the trellis encoder more than once (integer N/N'"'"' times) during each N-dimensional symbol interval. This allows the trellis encoder to produce an output of higher dimensionality than would normally be expected from the lower dimensionality convolutional encoder. The trellis encoder is applicable to television transmission.

Claims

1. A method of N-dimensional trellis coded modulation for encoding a digital signal, the method comprising the step of:

generating a sequence of N-dimensional symbols as a function of the digital signal using an N'"'"'-dimensional convolutional encoder, where N>

N'"'"'≧

1, said encoder being used to generate for each of a plurality of N-dimensional signal intervals, a plurality of groups of outputs, each said group of outputs being a function of a respective different group of inputs, the N-dimensional symbols comprising J P-dimensional signal points and the digital signal having an integer number of bits per each P-dimensional signal point.

2. The method as defined in claim 1 wherein for each N-dimensional signaling interval, the digital signal is arranged into first and second portions and said first portion is divided into (N/N'"'"') groups of bits, the step of generating further including the steps of:

applying each of said groups of bits sequentially to the N'"'"'-dimensional convolutional encoder;

using output bits from convolutional encoding of all groups of bits included in said first portion to identify an N-dimensional subset of an N-dimensional constellation; and

using said second portion to specify, jointly and interdependently, the J signal points of an N-dimensional symbol from the N-dimensional subset.

3. The method as defined in claim 2 wherein said subset of said N-dimensional constellation consists of a sequence of (N/N'"'"') N'"'"'-dimensional subsets, wherein each N'"'"'-dimensional subset is identified by the convolutional encoder output for a particular group of bits.

47. The invention as defined in any one of claims 1, 6, 19 or 34, wherein said plurality of groups of outputs is comprised of N/N'"'"' groups of outputs and said respective different group of inputs is one of N/N'"'"' groups of inputs.

4. A method of concatenated encoding a digital signal, the method comprising the steps of:

Reed-Solomon encoding the digital signal;

generating a sequence of N-dimensional symbols as a function of the Reed-Solomon encoded signal using an N'"'"'-dimensional convolutional encoder, said encoder including a finite state machine which advances multiple states for each of a plurality of hi-dimensional signaling intervals, where N>

N'"'"'≧

1, the N-dimensional symbols comprising J P-dimensional signal points and the Reed-Solomon encoded signal having an integer number of bits per each P-dimensional signal point.

5. The method as defined in claim 4 wherein the step of generating symbols includes the step of interleaving the Reed-Solomon encoded signal.

6. A method of transmitting a digital signal over a television channel, the method comprising the steps of:

Reed-Solomon encoding the digital signal;

generating a sequence of N-dimensional symbols as a function of the Reed-Solomon encoded signal using an N'"'"'-dimensional convolutional code within an N-dimensional trellis code, where N>

N'"'"'≧

1, said convolutional code being used to generate for each of a plurality of N-dimensional signaling intervals a plurality of groups of outputs each said group of outputs being a function of a respective different group of inputs;

representing each of said symbols as a sequence of J P-dimensional signal points of a P-dimensional M-ary transmitter constellation, where J×

P=N and the number of bits in the Reed-Solomon encoded digital signal per each P-dimensional signal point is integral;

generating a modulated signal which represents the resulting sequence of signal point representations; and

applying said modulated signal to said television channel.

7. The method as defined in claim 6 wherein the step of generating symbols includes the steps of interleaving the Reed-Solomon encoded signal and trellis encoding the resulting interleaved signal.

8. The method as defined in claim 6 wherein the trellis code is a four-dimensional trellis code and the convolutional code is a two-dimensional convolutional code.

9. The method as defined in claim 8 wherein the convolutional code is a K-state, rate 1/2 code and K is selected from the group consisting of 4, 8, 16, 32, and 64.

10. The method as defined in claim 6 wherein the television channel is an over-the-air channel and wherein P equals 1.

11. The method as defined in claim 10 wherein the trellis code is a four dimensional trellis code and the convolutional code is a two-dimensional convolutional code.

12. The method as defined in claim 11 wherein the convolutional code is a K-state, rate 1/2 code and K is selected from the group consisting of 4, 8, 16, 32, and 64.

13. The method as defined in claim 6 wherein the television channel is an over-the-air channel and wherein P equals 2.

14. The method as defined in claim 13 wherein the trellis code is a four dimensional trellis code and the convolutional codeis a two-dimensional convolutional code.

15. The method as defined in claim 14 wherein the convolutional code is a K-state, rate 1/2 code and K is selected from the group consisting of 4, 8, 16, 32, and 64.

16. An N-dimensional trellis coded modulator comprising

means for receiving a digital signal, and

an N'"'"'-dimensional convolutional encoder for generating a sequence of N-dimensional symbols as a function of the digital signal, where N>

N'"'"'≧

1, said encoder including a finite state machine which advances multiple states for each of a plurality of N-dimensional signaling intervals, the N-dimensional symbols comprising J P-dimensional signal points and the digital signal having an integer number of bits per each P-dimensional signal point.

17. The modulator as defined in claim 16 wherein for each N-dimensional signaling interval, the digital signal is arranged into first and second portions and said first portion is divided into (N/N'"'"') groups of bits, wherein the modulator further includes:

means for applying each of said groups of bits sequentially to the N'"'"'-dimensional convolutional encoder;

means responsive to output bits from convolutional encoding of all groups of bits included in said first portion for identifying an N-dimensional subset of an N-dimensional constellation; and

means responsive to said second portion for specifying, jointly and interdependently, the J signal points of an N-dimensional symbol from the N-dimensional subset.

18. The modulator as defined in claim 17 wherein said subset of said N-dimensional constellation consists of a sequence of (N/N'"'"')N'"'"'-dimensional subsets, wherein each N'"'"'-dimensional subset is identified by the convolutional encoder output for a particular group of bits.

46. The invention as defined in any one of claims 4, 16, 21, 31 or 35, wherein said finite state machine that advances N/N'"'"' states for each of the plurality of N-dimensional signaling intervals.

19. Apparatus for concatenated encoding a digital signal, the apparatus comprising:

means for Reed-Solomon encoding the digital signal, and

means for generating a sequence of N-dimensional symbols as a function of the Reed-Solomon encoded signal using an N'"'"'-dimensional convolutional encoder, said encoder being used to generate for each N-dimensional signaling interval a plurality of groups of outputs, each said group of outputs being a function of a respective different group of inputs, where N>

N'"'"'≧

1, the N-dimensional symbols comprising J P-dimensional signal points and the Reed-Solomon encoded signal having an integer number of bits per each P-dimensional signal point.

20. The apparatus as defined in claim 19 wherein the means for generating symbols includes means for interleaving the Reed-Solomon encoded signal.

21. Apparatus for transmitting a digital signal over a television channel, the apparatus comprising:

means for Reed-Solomon encoding the digital signal;

means for generating a sequence of N-dimensional symbols as a function of the Reed-Solomon encoded signal using an N'"'"'-dimensional convolutional encoder within an N-dimensional trellis encoder, said convolutional coder including a finite state machine which advances multiple states for each of a plurality of N-dimensional signaling intervals, where N>

N'"'"'≧

1;

means for representing each of said symbols as a sequence of J P-dimensional signal points of a P-dimensional M-ary transmitter constellation, where J×

P=N and the number of bits in the Reed-Solomon encoded digital signal per each P-dimensional signal point is integral;

means for generating a modulated signal which represents the resulting sequence of signal point representations; and

means for applying said modulated signal to said television channel.

22. The apparatus as defined in claim 21 wherein means for generating symbols includes means for interleaving the Reed-Solomon encoded signal and means for trellis encoding the resulting interleaved signal.

23. The apparatus as defined in claim 21 wherein the trellis encoder is a four-dimensional trellis encoder and the convolutional encoder is a two-dimensional convolutional encoder.

24. The apparatus as defined in claim 23 wherein the convolutional encoder is a K-state, rate 1/2 encoder and K is selected from the group consisting of 4, 8, 16, 32, and 64.

25. The apparatus as defined in claim 21 wherein the television channel is an over-the-air channel and wherein P is equal to 1.

26. The apparatus as defined in claim 25 wherein the trellis encoder is a four dimensional trellis encoder and the convolutional encoder is a two-dimensional convolutional encoder.

27. The apparatus as defined in claim 26 wherein the convolutional encoder is a K-state, rate 1/2 encoder and K is selected from the group consisting of 4, 8, 16, 32, and 64.

28. The apparatus as defined in claim 21 wherein the television channel is an over-the-air channel and wherein P is equal to 2.

29. The apparatus as defined in claim 28 wherein the trellis encoder is a four dimensional trellis encoder and the convolutional encoder is a two-dimensional convolutional encoder.

30. The apparatus as defined in claim 29 wherein the convolutional encoder is a K-state, rate 1/2 code and K is selected from the group consisting of 4, 8, 16, 32, and 64.

31. A method of processing a signal from a communication channel, said signal having been generated by encoding a digital signal using N-dimensional trellis coded modulation, wherein the encoding comprised the step of generating a sequence of N-dimensional symbols as a function of the digital signal using an N'"'"'-dimensional convolutional encoder, said encoder including a finite state machine which advances multiple states for each of a plurality of N-dimensional signaling intervals, where N>

N'"'"'≧

1, the N-dimensional symbols comprising J P-dimensional signal points and the digital signal having an integer number of bits per each P-dimensional signal point, the method including the steps of;

receiving said signal from said communication channel, and

recovering said digital signal from said received communication channel signal.

32. The method as defined in claim 31 wherein the recovering step includes the steps of:

demodulating said received communication channel signal to generate a demodulated signal;

processing the demodulated signal to recover said digital signal.

33. The method as defined in claim 32 wherein the processing step includes the step of Viterbi decoding said demodulated signal by using an N'"'"'-dimensional Viterbi decoder.

34. The method as defined in any one of claims 31 through 33 wherein for each N-dimensional signaling interval, the digital signal is arranged into first and second portions and said first portion is divided into (N/N'"'"') groups of bits, the step of generating said sequence of N-dimensional symbols further included the steps of:

applying each of said groups of bits sequentially to the N'"'"'-dimensional convolutional encoder;

using output bits from convolutional encoding of all groups of bits included in said first portion to identify an N-dimensional subset of an N-dimensional constellation; and

using said second portion to specify, jointly and interdependently, the J signal points of an N-dimensional symbol from the N-dimensional subset.

45. The method as defined in any one of claims 34-36 wherein for each N-dimensional signaling interval, the Reed-Solomon encoded signal is arranged into first and second portions and said first portion is divided into (N/N'"'"') groups of bits, the step of generating further including the steps of:

applying each of said groups of bits sequentially to the N'"'"'-dimensional convolutional encoder;

using output bits from convolutional encoding of all groups of bits included in said first portion to identify an N-dimensional subset of an N-dimensional constellation; and

using said second portion to specify, jointly and interdependently, the J signal points of an N-dimensional symbol from the N-dimensional subset.

35. A method of processing a signal from a television channel, said signal having been generated by Reed-Solomon encoding a digital signal, generating a sequence of N-dimensional symbols as a function of the Reed-Solomon encoded signal using an N'"'"'-dimensional convolutional encoder within an N-dimensional trellis encoder, said convolutional coder including a finite state machine which advances multiple states for each N-dimensional symbol interval, where N>

N'"'"'≧

1, representing each of said symbols as a sequence of J P-dimensional signal points of a P-dimensional M-ary transmitter constellation, where J×

P=N and the number of bits in the Reed-Solomon encoded digital signal per each P-dimensional signal point is integral, generating a modulated signal which represents the resulting sequence of signal point representations, and applying said modulated signal to said television channel, the method including the steps of;

receiving said signal from said television channel, and

recovering said digital signal from said received television channel signal.

36. The method as defined in claim 35 wherein the trellis encoder is a four-dimensional trellis encoder and the convolutional encoder is a two-dimensional convolutional encoder.

37. The method as defined in claim 36 wherein the convolutional encoder is a K-state, rate 1/2 encoder and K is selected from the group consisting of 4, 8, 16, 32, and 64.

38. The method as defined in claim 35 wherein the television channel is an over-the-air channel and wherein P equals 1.

39. The method as defined in claim 38 wherein the trellis encoder is a four dimensional trellis encoder and the convolutional encoder is a two-dimensional convolutional encoder.

40. The method as defined in claim 39 wherein the convolutional encoder is a K-state, rate 1/2 encoder and K is selected from the group consisting of 4, 8, 16, 32, and 64.

41. The method as defined in claim 35 wherein the television channel is an over-the-air channel and wherein P equals 2.

42. The method as defined in claim 41 wherein the trellis encoder is a four dimensional trellis encoder and the convolutional encoder is a two-dimensional convolutional encoder.

43. The method as defined in claim 42 wherein the convolutional encoder is a K-state, rate 1/2 encoder and K is selected from the group consisting of 4, 8, 16, 32, and 64.

44. A method of processing a signal from a communication channel, said signal having been generated by concatenated encoding a digital signal using N-dimensional trellis coded modulation, wherein the encoding comprised the steps of Reed-Solomon encoding the digital signal and generating a sequence of N-dimensional symbols as a function of the Reed-Solomon encoded signal using an N'"'"'-dimensional convolutional encoder, where N>

N'"'"'≧

1, said encoder being used to generate for each N-dimensional symbol interval a plurality of groups of outputs, each said group of outputs being a function of a respective different group of inputs, the N-dimensional symbols comprising J P-dimensional signal points and the Reed-Solomon encoded signal having an integer number of bits per each P-dimensional signal point, the method including the steps of;

receiving said signal from said communication channel, and

recovering said digital signal from said received communication channel signal.