US5583889A — Trellis coded modulation system for HDTV

Claim 1

Independent Claim 129 words

A data receiver comprising: means for developing a received data signal comprising a plurality of regularly spaced symbols each representing 3 or more bits Z 0 , Z 1 , Z 2 --Z N produced by coding 2 or more data bits X 1 , X 2 --X N with a coder comprising a multi-state convolution encoder; a multi-state linear filter for reducing co-channel interference characterizing said received data signal; and decoding means including a Viterbi decoder for estimating data bits X 1 , X 2 --X N from the linearly filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution encoder and at least a partial representation of the states of said linear filter.

Claim 2

Dependent Claim 129 words

A data receiver comprising: means for developing a received data signal comprising a plurality of regularly spaced symbols each representing 3 or more bits Z 0 , Z 1 , Z 2 --Z N produced by coding 2 or more data bits X 1 , X 2 --X N with a coder comprising a multi-state convolution encoder; a multi-state linear filter for reducing co-channel interference characterizing said received data signal; and decoding means including a Viterbi decoder for estimating data bits X 1 , X 2 --X N from the linearly filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution encoder and at least a partial representation of the states of said linear filter.

Claim 3

Dependent Claim 23 words

The receiver of claim 1 wherein said linear filter comprises a comb filter for reducing NTSC co-channel interference characterizing said received data signal.

Claim 4

Dependent Claim 55 words

The receiver of claim 1 wherein said linear filter comprises an M-state linear filter and said received data signal comprises M groups of individually coded interleaved symbols, said receiver comprising M of said decoding means and means for applying each of said M groups of symbols to a respective one of said M decoding means.

Claim 5

Dependent Claim 11 words

The receiver of claim 3 wherein M is equal to 12.

Claim 6

Dependent Claim 46 words

The receiver of claim 1 including a second Viterbi decoder means for estimating data bits X 1 , X 2 --X N from said received data signal in response to a determination of the most likely sequence of transitions between the states of said convolution encoder.

Claim 7

Dependent Claim 48 words

The receiver of claim 5 wherein said received data signal comprises M groups of individually coded interleaved symbols, said receiver comprising M of said second decoding means and means for applying each of said M groups of symbols to a respective one of said M second decoding means.

Claim 8

Dependent Claim 11 words

The receiver of claim 6 wherein M is equal to 12.

Claim 9

Dependent Claim 55 words

The receiver of claim 1 wherein said 3 or more bits Z 0 , Z 1 , Z 2 -Z N comprise bits Z 0 , Z 1 , Z 2 produced by coding data bits X 1 , X 2 and wherein said decoding means estimates data bits X 1 , X 2 .

Claim 10

Dependent Claim 25 words

The receiver of claim 8 including means comprising a 4-level slicer for estimating said data bits X 1 , X 2 from said received signal.

Claim 11

Dependent Claim 59 words

The receiver of claim 8 wherein said decoding means comprises means for estimating said data bits X 1 , X 2 from the linear filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution encoder and a subset of the states of said linear filter.

Claim 12

Dependent Claim 31 words

The receiver of claim 10 wherein the states of said linear filter are representable by a 3-bit value and wherein said subset comprises one of the bits of said 3-bit value.

Claim 13

Dependent Claim 42 words

The receiver of claim 10 wherein said decoding means comprises a Viterbi decoder for estimating data bit X 1 and for identifying one of a plurality of cosets of discrete values representing a predetermined number of anticipated outputs of said linear filter.

Claim 14

Dependent Claim 28 words

The receiver of claim 12 including means responsive to said linearly filtered signal and to said identified coset of discrete values for estimating data bit X 2 .

Claim 15

Dependent Claim 84 words

The receiver of claim 13 wherein the output of said linear filter is representable by 15 different discrete values and wherein each of said plurality of cosets comprises a different combination of 3 of said 15 different discrete values, said means for estimating data bit X 2 comprising means for determining whether the signal level at the output of said linear filter is closer to the intermediate value or to one of the outer values of the 3 discrete values of the identified coset.

Claim 16

Dependent Claim 27 words

The receiver of claim 1 including means comprising a multi-level slicer for estimating data bits X 1 , X 2 --X N from said received data signal.

Claim 17

Dependent Claim 153 words

A data receiver comprising: means for developing a received data signal comprising M groups of independently coded interleaved symbols, each of said groups including a plurality of regularly spaced symbols each representing 3 or more bits Z 0 , Z 1 , Z 2 --Z N produced by coding 2 or more data bits X 1 , X 2 --X N with a coder comprising a multi-state convolution encoder; an M-state linear filter for reducing co-channel interference characterizing said received data signal; and a decoder comprising M Viterbi decoder means each operable for estimating data bits X 1 , X 2 --X N of a respective one of said groups of symbols from the linearly filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution encoder and at least a partial representation of the states of said linear filter.

Claim 18

Dependent Claim 153 words

A data receiver comprising: means for developing a received data signal comprising M groups of independently coded interleaved symbols, each of said groups including a plurality of regularly spaced symbols each representing 3 or more bits Z 0 , Z 1 , Z 2 --Z N produced by coding 2 or more data bits X 1 , X 2 --X N with a coder comprising a multi-state convolution encoder; an M-state linear filter for reducing co-channel interference characterizing said received data signal; and a decoder comprising M Viterbi decoder means each operable for estimating data bits X 1 , X 2 --X N of a respective one of said groups of symbols from the linearly filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution encoder and at least a partial representation of the states of said linear filter.

Claim 19

Dependent Claim 24 words

The receiver of claim 16 wherein said linear filter comprises a 12-state comb filter for reducing NTSC co-channel interference characterizing said received data signal.

Claim 20

Dependent Claim 61 words

The receiver of claim 16 including a second decoder comprising M second Viterbi decoder means each operable for estimating data bits X 1 , X 2 --X N of a respective one of said groups of symbols from said received data signal in response to a determination of the most likely sequence of transitions between the states of said convolution encoder.

Claim 21

Dependent Claim 63 words

The receiver of claim 16 wherein each of said Veterbi decoder means comprises means for estimating data bits X 1 , X 2 -X N from the linear filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution encoder and a subset of the states of said linear filter.

Claim 22

Dependent Claim 31 words

The receiver of claim 19 wherein the states of said linear filter are representable by a 3-bit value and wherein said subset comprises one of the bits of said 3-bit value.

Claim 23

Dependent Claim 43 words

The receiver of claim 19 wherein each of said Veterbi decoder means comprises means for estimating data bit X 1 and for identifying one of a plurality of cosets of discrete values representing a predetermined number of anticipated outputs of said linear filter.

Claim 24

Dependent Claim 28 words

The receiver of claim 21 including means responsive to said linearly filtered signal and to said identified coset of discrete values for estimating data bit X 2 .

Claim 25

Dependent Claim 84 words

The receiver of claim 22 wherein the output of said linear filter is representable by 15 different discrete values and wherein each of said plurality of cosets comprises a different combination of 3 of said 15 different discrete values, said means for estimating data bit X 2 comprising means for determining whether the signal level at the output of said linear filter is closer to the intermediate value or to one of the outer values of the 3 discrete values of the identified coset.

Claim 26

Dependent Claim 190 words

A data receiver comprising: means for developing a received data signal comprising a plurality of regularly spaced symbols, each of said symbols representing 3-bits Z 0 , Z 1 , Z 2 produced by coding a first data bit X 1 using a multi-state convolution coder to derive bits Z 0 , Z 1 and a second data bit X 2 using a modulo-2 precoder to derive bit Z 2 , wherein bits Z 0 , Z 1 identify respective subsets (a-d) of said symbols, each of said subsets (a-d) comprising two equally spaced symbol values, and bits Z 1 , Z 2 identify respective pairs of said symbols each comprising two adjacent symbol values; a multi-state linear filter for reducing NTSC co-channel interference characterizing said received data signal; first decoder means for estimating data bits X 1 , X 2 from said linearly filtered data signal; second decoder means for estimating data bits X 1 , X 2 from said received data signal; and selection means for selecting said first decoder means or said second decoder means for providing said estimated data bits X 1 , X 2 .

Claim 27

Dependent Claim 190 words

A data receiver comprising: means for developing a received data signal comprising a plurality of regularly spaced symbols, each of said symbols representing 3-bits Z 0 , Z 1 , Z 2 produced by coding a first data bit X 1 using a multi-state convolution coder to derive bits Z 0 , Z 1 and a second data bit X 2 using a modulo-2 precoder to derive bit Z 2 , wherein bits Z 0 , Z 1 identify respective subsets (a-d) of said symbols, each of said subsets (a-d) comprising two equally spaced symbol values, and bits Z 1 , Z 2 identify respective pairs of said symbols each comprising two adjacent symbol values; a multi-state linear filter for reducing NTSC co-channel interference characterizing said received data signal; first decoder means for estimating data bits X 1 , X 2 from said linearly filtered data signal; second decoder means for estimating data bits X 1 , X 2 from said received data signal; and selection means for selecting said first decoder means or said second decoder means for providing said estimated data bits X 1 , X 2 .

Claim 28

Dependent Claim 86 words

The receiver of claim 24 wherein said first decoder means comprises a Viterbi decoder for estimating data bit X 1 and a bit Y 2 from the linearly filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution coder and at least a partial representation of the states of said linear filter and a postcoder for generating an estimation of data bit X 2 in response to estimated bit Y 2 .

Claim 29

Dependent Claim 60 words

The receiver of claim 24 wherein said first decoder comprises a Viterbi decoder for estimating data bits X 1 , X 2 from said linearly filtered data signal in response to a determination of the most likely sequence of transitions between a combination of the states of said convolution coder and a subset of the states of said linear filter.

Claim 30

Dependent Claim 62 words

The receiver of claim 26 wherein said Viterbi decoder comprises a branch metric generator for generating a plurality of branch metrics each representing the distance between the output of the linear filter and the closest value of a respective coset of 3 values, each of said cosets representing the linear difference between the values of the symbols of two of said subsets.

Claim 31

Dependent Claim 26 words

The receiver of claim 27 wherein said Viterbi decoder comprises means for estimating data bit X 1 and for identifying an associated one of said cosets.

Claim 32

Dependent Claim 25 words

The receiver of claim 28 including means responsive to said linearly filtered signal and to said identified coset for estimating data bit X 2 .

Claim 33

Dependent Claim 50 words

The receiver of claim 29 wherein said means for estimating data bit X 2 comprises means for determining whether the signal level at the output of said linear filter is closer to the intermediate value or to one of the outer values of the 3 values of said identified coset.

Claim 34

Dependent Claim 38 words

The receiver of claim 26 wherein the states of said linear filter are represented by a 3-bit value V 0 , V 1 , V 2 and wherein said subset comprises bit V 1 of said 3-bit value.

Claim 35

Dependent Claim 72 words

The receiver of claim 24 wherein said second decoder means comprises a second Viterbi decoder for estimating data bit X 1 and a bit Y 2 from said received data signal in response to a determination of the most likely sequence of transitions between the states of said convolution coder and further including a modulo-2 postcoder for converting said estimated bit Y 2 into an estimation of data bit X 2 .

Claim 36

Dependent Claim 48 words

The receiver of claim 24 wherein said second decoder comprises a four-level slicer for estimating data bit X 2 and bit Y 2 from said received data signal and a modulo-2 postcoder for converting said estimated bit Y 2 into an estimation of data bit X 2 .

Claim 37

Dependent Claim 47 words

The receiver of claim 24 wherein said first and second decoder means comprise a Viterbi decoder means responsive to said selection means for assuming a configuration for performing the function of said first decoder means or a configuration for performing the function of said second decoder means.

Claim 38

Dependent Claim 73 words

A Viterbi decoder for decoding a signal generated by a multi-state convolution encoder and received over a multi-state channel, said Viterbi decoder comprising: a branch metric generator responsive to said received signal for generating a plurality of branch metrics; and means responsive to said branch metrics for determining the most likely sequence of transitions between a combination of the states of said convolution encoder and a subset of the states of said channel.

Claim 39

Dependent Claim 73 words

A Viterbi decoder for decoding a signal generated by a multi-state convolution encoder and received over a multi-state channel, said Viterbi decoder comprising: a branch metric generator responsive to said received signal for generating a plurality of branch metrics; and means responsive to said branch metrics for determining the most likely sequence of transitions between a combination of the states of said convolution encoder and a subset of the states of said channel.

Claim 40

Dependent Claim 32 words

The decoder of claim 35 wherein each of said branch metrics represents the distance between the value of said received signal and the closest value of a respective coset of N values.

Claim 41

Dependent Claim 31 words

The decoder of claim 36 wherein said determining means comprises means for directly estimating a first data component of said received signal and for identifying an associated one of said cosets.

Claim 42

Dependent Claim 24 words

The decoder of claim 37 including means responsive to said received signal and to said identified coset for estimating a second data component thereof.

Claim 43

Dependent Claim 56 words

The decoder of claim 38 wherein each of said cosets comprises 3 data values and wherein said means for estimating said second data component comprises means for determining whether the level of said received signal is closer to the intermediate value or to one of the outer values of the 3 values of said identified coset.

Claim 44

Dependent Claim 30 words

The decoder of claim 35 wherein the states of said channel are represented by a multibit value and wherein said subset comprises one bit V 1 of said multibit value.

Claim 45

Dependent Claim 48 words

The decoder of claim 40 wherein the states of said convolution encoder are represented by a pair of bits Q 0 , Q 1 and wherein said combined state of said convolution encoder and channel are represented by bits Q 0 , Q 1 , V 1 .

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1999-12-10	2000-06-10	2000-12-10	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2003-12-10	2004-06-10	2004-12-10	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2007-12-10	2008-06-10	2008-12-10	$7700.00	Window Closed / Lapsed

Trellis coded modulation system for HDTV

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag