US5040191A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Partial response channel signaling systems
Assignee: CIF LICENSING LLC
•
Filing: 1990-07-10
•
Granted: 1991-08-13
•
Expires: 2010-07-10
Abstract
Abstract Apparatus for generating a (running digital sum) sequence of digital signals X k and/or a (partial response coded) sequence of digital signals Y k , K=1, 2, . . . , such that Y k =X k ±X k-l , L and integer, in which the Y x signals are a sequence in a given modulation code. In one aspect, the signals Y k are chosen to be congruent to coset representatives specified in accordance with a modulation code, a plurality of code constellations are used, and at least one constellation includes both a point with a positive sum of coordinates and one with a negative sum of coordinates. In another aspect, the signals X k are chosen to be congruent to a sequence of alternate (precoded) coset representatives. In other aspects, the Y k alphabet signals are evenly spaced, and a selectable, e.g., an optimal, tradeoff between S x and S y is made. An N-dimentional modulation code is generated as a sequence of one-dimensional signals. A maximum likelihood sequence estimation decoder reconstructs the estimated running digital sum, and generates a signal whenever the estimated running digital sum is outside a permissible range. In another aspect, the decoder includes a modified maximum likelihood sequence estimator adapted to find MQ partial decoded sequences, where Q is the number of encoder states, and M is an integer.
Inventors
- 👤 G. D. Forney, Jr.
- 👤 Vedat M. Eyuboglu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 04:26
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3416; H04L27/3427; H04L27/3438; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/497
Claims Analysis
Total Claims: 43
Claim 1
Independent Claim
200 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , such that the sequence of y k signals is a partial-response-coded sequence derived from the sequence of x k signals, said signals y k being a sequence in a given modulation code, said apparatus comprising a coset selector for generating coset representatives c k in accordance with said given modulation code; and an encoder for selecting J said signals y k , J≧1, (y k , y k+1 , . . . , y k+J-1 ) to be congruent to a sequence of J coset representatives c k (modulo Λ N ), Λ N being an N-dimensional lattice, N being a positive integer, each of said J signals being chosen from a corresponding one of a plurality of J-dimensional constellations, said choice being based on a previous x k' , k'<k, at least one of said plurality of J-dimensional constellations comprising both a point with a positive sum of coordinates and another point with a negative sum of coordinates, said encoder being arranged so that said signals x k have finite variance S x .
Claim 2
Dependent Claim
200 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , such that the sequence of y k signals is a partial-response-coded sequence derived from the sequence of x k signals, said signals y k being a sequence in a given modulation code, said apparatus comprising a coset selector for generating coset representatives c k in accordance with said given modulation code; and an encoder for selecting J said signals y k , J≧1, (y k , y k+1 , . . . , y k+J-1 ) to be congruent to a sequence of J coset representatives c k (modulo Λ N ), Λ N being an N-dimensional lattice, N being a positive integer, each of said J signals being chosen from a corresponding one of a plurality of J-dimensional constellations, said choice being based on a previous x k' , k'<k, at least one of said plurality of J-dimensional constellations comprising both a point with a positive sum of coordinates and another point with a negative sum of coordinates, said encoder being arranged so that said signals x k have finite variance S x .
Claim 3
Dependent Claim
28 words
The apparatus of claim 1 wherein the relationship between the x k signals and y k signals is y k =x k ±x k-L , L an integer.
Claim 4
Dependent Claim
9 words
The apparatus of claim 2 wherein J is 1.
Claim 5
Dependent Claim
19 words
The apparatus of claim 2 wherein J is the same as number N of dimensions in said modulation code.
Claim 6
Dependent Claim
9 words
The apparatus of claim 2 wherein k' is k-1.
Claim 7
Dependent Claim
25 words
The apparatus of claim 2 wherein J is 1 and each said constellation is a one-dimensional range of values centered on βx k-1 , 0≦β<1.
Claim 8
Dependent Claim
7 words
The apparatus of claim 6 wherein β>0.
Claim 9
Dependent Claim
15 words
The apparatus of claim 2 wherein there are a finite set of said J-dimensional constellations.
Claim 10
Dependent Claim
12 words
The apparatus of claim 8 wherein there are two said J-dimensional constellations.
Claim 11
Dependent Claim
16 words
The apparatus of claim 2 wherein at least two of said J-dimensional constellations are not disjoint.
Claim 12
Dependent Claim
172 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , such that the sequence of y k signals is a partial-response-coded sequence derived from the sequence of x k signals, said signals y k being a sequence in a given modulation code, said apparatus comprising a coset selector for generating coset representatives c k in accordance with said given modulation code; a generator of a sequence of alternative coset representatives c k ' chosen so that the sequence of coset representatives c k is a partial-response-coded sequence derived from the sequence of c k ' signals, and an encoder for selecting said signals x k to be congruent to a sequence of alternative coset representatives c k ', where the congruence is modulo M if said coset representatives c k are real, M being an integer, and modulo Λ N if said c k signals are N-dimensional, Λ N being an N-dimensional lattice, N being an integer.
Claim 13
Dependent Claim
172 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , such that the sequence of y k signals is a partial-response-coded sequence derived from the sequence of x k signals, said signals y k being a sequence in a given modulation code, said apparatus comprising a coset selector for generating coset representatives c k in accordance with said given modulation code; a generator of a sequence of alternative coset representatives c k ' chosen so that the sequence of coset representatives c k is a partial-response-coded sequence derived from the sequence of c k ' signals, and an encoder for selecting said signals x k to be congruent to a sequence of alternative coset representatives c k ', where the congruence is modulo M if said coset representatives c k are real, M being an integer, and modulo Λ N if said c k signals are N-dimensional, Λ N being an N-dimensional lattice, N being an integer.
Claim 14
Dependent Claim
68 words
The apparatus of claim 11 wherein the relationship between the x k signals and y k signals is y k =x k ±x k-L , L an integer and wherein c k '=c k -c' k-L (modulo M), in the case when y k =x k +x k-L , c k '=c k +c' k-L (modulo M), in the case where y k =x k -x k-L .
Claim 15
Dependent Claim
184 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , capable of representing n bits per signal, such that the relationship between x k and y k is y k =x k ±x k-L , L an integer, said x k and y k signals having variances S x and S y , said y k signals falling within an alphabet of possible y k signals that are spaced apart within said alphabet evenly by a spacing Δ, said apparatus comprising means for receiving an input signal having n bits per signal; and an encoder responsive to said receiving means for generating said sequence y k and said sequence x k such that said sequence y k has a variance S y less than 2S 0 and said sequence x k has a variance S x not much greater than S y 2 /4(S y -S 0 ), S 0 being approximately equal to the minimum signal power required to represent n bits per signal with a Δ-spaced alphabet.
Claim 16
Dependent Claim
184 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , capable of representing n bits per signal, such that the relationship between x k and y k is y k =x k ±x k-L , L an integer, said x k and y k signals having variances S x and S y , said y k signals falling within an alphabet of possible y k signals that are spaced apart within said alphabet evenly by a spacing Δ, said apparatus comprising means for receiving an input signal having n bits per signal; and an encoder responsive to said receiving means for generating said sequence y k and said sequence x k such that said sequence y k has a variance S y less than 2S 0 and said sequence x k has a variance S x not much greater than S y 2 /4(S y -S 0 ), S 0 being approximately equal to the minimum signal power required to represent n bits per signal with a Δ-spaced alphabet.
Claim 17
Dependent Claim
18 words
The apparatus of claim 13 wherein said sequence y k is a sequence in a given modulation code.
Claim 18
Dependent Claim
116 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , such that the sequence of y k signals is a partial-response-coded sequence derived from the sequence of x k signals, said x k and y k sequences having variances S x and S y , said symbols y k being a sequence in a given modulation code, said apparatus comprising means for receiving an input signal; and an encoder responsive to said receiving means for generating said x k and/or y k signals such that the ratio of variance S y to variance S x is selectable within a predetermined range.
Claim 19
Dependent Claim
116 words
Apparatus for generating a sequence of digital signals x k and/or a sequence of digital signals y k , k=1, 2, . . . , such that the sequence of y k signals is a partial-response-coded sequence derived from the sequence of x k signals, said x k and y k sequences having variances S x and S y , said symbols y k being a sequence in a given modulation code, said apparatus comprising means for receiving an input signal; and an encoder responsive to said receiving means for generating said x k and/or y k signals such that the ratio of variance S y to variance S x is selectable within a predetermined range.
Claim 20
Dependent Claim
28 words
The apparatus of claim 15 wherein the relationship between the x k signals and y k signals is y k =x x ±x k-L , L an integer.
Claim 21
Dependent Claim
94 words
The apparatus of claim 16 wherein said x k and y k signal sequences are capable of representing n bits per signal, said y k signals fall within an alphabet of possible y k signals that are spaced evenly by an amount Δ, said predetermined range is controlled by a parameter β, and S x is approximately S o /(1-β 2 ), and S y is approximately 2S o /(1+β), S o being approximately the minimum signal power required to represent n bits per symbol with a Δ-spaced alphabet in accordance with said code.
Claim 22
Dependent Claim
166 words
Apparatus for generating a sequence in a given N-dimensional modulation code by generating a sequence of one-dimensional signals, N being a positive number, said modulation code being based on an N-dimensional constellation partitioned into subsets associated with said code, said subsets each containing N-dimensional signal points, the choice of said subset being based on coded bits and uncoded bits of said signal points, said apparatus comprising means for receiving an input signal and generating the coded bits and the uncoded bits therefrom; and an encoder for deriving from said coded and uncoded bits, for each said N-dimensional symbol, a set of N, M-valued one-dimensional coset representatives c k corresponding to congruence classes of each of the N coordinates (modulo M), M being a positive number, each coset representative designating a subset of one-dimensional values in a one-dimensional constellation of possible coordinate values for each of said N dimensions, each said one-dimensional signal in said sequence being selected from said possible coordinate values based on uncoded bits.
Claim 23
Dependent Claim
166 words
Apparatus for generating a sequence in a given N-dimensional modulation code by generating a sequence of one-dimensional signals, N being a positive number, said modulation code being based on an N-dimensional constellation partitioned into subsets associated with said code, said subsets each containing N-dimensional signal points, the choice of said subset being based on coded bits and uncoded bits of said signal points, said apparatus comprising means for receiving an input signal and generating the coded bits and the uncoded bits therefrom; and an encoder for deriving from said coded and uncoded bits, for each said N-dimensional symbol, a set of N, M-valued one-dimensional coset representatives c k corresponding to congruence classes of each of the N coordinates (modulo M), M being a positive number, each coset representative designating a subset of one-dimensional values in a one-dimensional constellation of possible coordinate values for each of said N dimensions, each said one-dimensional signal in said sequence being selected from said possible coordinate values based on uncoded bits.
Claim 24
Dependent Claim
21 words
The apparatus of claim 2, 12, 13, or 16 further comprising an output at which said sequence y k is delivered.
Claim 25
Dependent Claim
21 words
The apparatus of claim 2, 12, 13, or 16 further comprising an output at which said sequence x k is delivered.
Claim 26
Dependent Claim
13 words
The apparatus of claim 2, 12, 13, or 16 wherein L is 1.
Claim 27
Dependent Claim
32 words
The apparatus of claim 2, 12, 13, or 16 wherein the relationship between the x k signals and y k signals is y k =x k -x x-L , L an integer.
Claim 28
Dependent Claim
18 words
The apparatus of claim 2, 12, 14, 16, or 18 wherein said modulation code is a trellis code.
Claim 29
Dependent Claim
18 words
The apparatus of claim 2, 12, 14, 16, or 18 wherein said modulation code is a lattice code.
Claim 30
Dependent Claim
12 words
The apparatus of claim 2, 12, or 18 wherein M is 2.
Claim 31
Dependent Claim
12 words
The apparatus of claim 2, 12, or 18 wherein M is 4.
Claim 32
Dependent Claim
15 words
The apparatus of claim 2, 12, or 18 wherein M is a multiple of 4.
Claim 33
Dependent Claim
18 words
The apparatus of claim 2, 12, 13, or 16 wherein y k and x k are real valued.
Claim 34
Dependent Claim
18 words
The apparatus of claim 2, 12, 13, or 16 wherein y k and x k are complex valued.
Claim 35
Dependent Claim
22 words
The apparatus of claim 2 or 12 wherein y k and x k are complex valued and wherein M is 2+2i, i=√-1.
Claim 36
Dependent Claim
156 words
In a decoder for decoding a sequence z k =y k +n k , k=1, 2, . . . , into a decoded sequence y k , where the sequence of signals y k is such that (a) said sequence is from a given modulation code; (b) the running digital sum x k =y k-1 +y k-2 + . . . has finite variance S x ; (c) said signals y k fall in a predetermined permissible range dependent on x k' , k'<k; and the sequence n k represents noise, a range violation monitor comprising: a means for reconstructing the estimated running digital sum x k =y k +y k-1 + . . . , and a means for comparing said decoded sequence y k with said predetermined permissible range based on said estimated running digital sum x k' , k'<k, and for generating an indication when said y k is outside said permissible range.
Claim 37
Dependent Claim
156 words
In a decoder for decoding a sequence z k =y k +n k , k=1, 2, . . . , into a decoded sequence y k , where the sequence of signals y k is such that (a) said sequence is from a given modulation code; (b) the running digital sum x k =y k-1 +y k-2 + . . . has finite variance S x ; (c) said signals y k fall in a predetermined permissible range dependent on x k' , k'<k; and the sequence n k represents noise, a range violation monitor comprising: a means for reconstructing the estimated running digital sum x k =y k +y k-1 + . . . , and a means for comparing said decoded sequence y k with said predetermined permissible range based on said estimated running digital sum x k' , k'<k, and for generating an indication when said y k is outside said permissible range.
Claim 38
Dependent Claim
31 words
A decoder according to claim 31, in which said estimated running digital sum x k is adjusted based on said indication so that y k will be inside said permissible range.
Claim 39
Dependent Claim
25 words
A decoder according to claim 32, in which said adjustment is by the minimum possible amount such that y k falls inside said permissible range.
Claim 40
Dependent Claim
216 words
A decoder for decoding a sequence x k =y k +n k , k=1, 2, . . . , where sequence n k represents noise and the sequence of signals y k is such that (a) said sequence is from a given modulation code, said code being capable of being generated by an encoder with a finite number Q of states; (b) y k =x k ±x k-L , L an integer, where said sequence x k has finite variance S x , and the sequence n k represents noise, comprising a means for receiving the sequence z k ; and a modified maximum likelihood sequence estimator responsive to the receiving means, said estimator being adapted to find MQ partial decoded sequences, up to some time K, where M, Q, and K are positive finite numbers, one such said sequence for each combination of said finite number Q of states and each of a finite number M of integer-spaced values modulo M, such that each said sequence (a) is in said code up to said time K; (b) corresponds to said encoder being in a given said state at said time K; (c) corresponds to a value of x k at said time K that is congruent to a given one of said values, modulo M.
Claim 41
Dependent Claim
216 words
A decoder for decoding a sequence x k =y k +n k , k=1, 2, . . . , where sequence n k represents noise and the sequence of signals y k is such that (a) said sequence is from a given modulation code, said code being capable of being generated by an encoder with a finite number Q of states; (b) y k =x k ±x k-L , L an integer, where said sequence x k has finite variance S x , and the sequence n k represents noise, comprising a means for receiving the sequence z k ; and a modified maximum likelihood sequence estimator responsive to the receiving means, said estimator being adapted to find MQ partial decoded sequences, up to some time K, where M, Q, and K are positive finite numbers, one such said sequence for each combination of said finite number Q of states and each of a finite number M of integer-spaced values modulo M, such that each said sequence (a) is in said code up to said time K; (b) corresponds to said encoder being in a given said state at said time K; (c) corresponds to a value of x k at said time K that is congruent to a given one of said values, modulo M.
Claim 42
Dependent Claim
10 words
A decoder as in claim 34 wherein M is 2.
Claim 43
Dependent Claim
10 words
A decoder as in claim 34 wherein M is 4.
References Cited (Backward Citations)
US3887021A
Cited
US4077021A
Cited
US4439863A
Cited
US4553237A
Cited
US4597090A
Cited
US4646305A
Cited
US4601044A
Cited
US4630288A
Cited
US4620311A
Cited
US4700349A
Cited
US4581601A
Cited
US4631735A
Cited
US4713817A
Cited
US4698809A
Cited
US4720839A
Cited
US4788694A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-08-12 | 1995-02-11 | 1995-08-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-08-12 | 1999-02-11 | 1999-08-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-08-12 | 2003-02-11 | 2003-08-13 | $7700.00 | Window Closed / Lapsed |