Patent US4534040A successfully refreshed from Google Patents.
US4534040A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for coding a binary signal
Assignee: American Bell Inc
•
Filing: 1983-01-04
•
Granted: 1985-08-06
•
Expires: 2003-01-04
Abstract
Abstract An input bit sequence is encoded for transmission on a QAM carrier by dividing a scrambled version of the input sequence into groups of N consecutive bits. Each group is then subdivided into first and second subsets of r and r1 bits, where r+r1=N. At least one of the bits in the first subset is applied to a finite state machine (such as a convolution encoder) which is arranged to expand the applied bits by at least one additional bit, in accordance with a prescribed logic arrangement. At least one bit in the second subset is processed similarly but independently, using a different finite state machine, or by time sharing a single finite state encoder. The expanded bit subsets, which include at least r+1 and r1+1 bits, respectively, are then mapped into in-phase and quadrature symbols such that the minimum euclidean distance for an error event is larger than that obtained from an uncoded system. The symbols to be transmitted are then filtered and the filter output is modulated using conventional QAM methods.
Inventors
- 👤 Hemant K. Thapar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 12:03
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3416; H04L27/3427; H04L27/3433; H03; H03M; H03M13/00; H03M13/25; H04L27/3494
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
192 words
Apparatus for encoding a sequence of input bits for transmission via a quadrature amplitude modulated carrier signal, comprising: means responsive to first and second subsets of selected bits in each group of N consecutive ones of said input bits for forming first and second expanded versions of the bits in each of said first and second subsets, respectively, each of said expanded versions having at least one more bit than the subset from which it is formed, and means individually responsive to said first and second expanded versions for modulating in-phase and quadrature components of said carrier signal to generate an individual one of a predetermined constellation of signal points, wherein said forming means includes means for combining at least one bit in said first subset with at least one bit in the first subset of a preceding one of saidn N-bit groups and means for combining at least one bit in said second subset with at least one bit in the second subset of a preceding one of said N-bit groups, said combining and modulating means being arranged such that less than all possible sequences of said signal points is generated.
Claim 2
Dependent Claim
192 words
Apparatus for encoding a sequence of input bits for transmission via a quadrature amplitude modulated carrier signal, comprising: means responsive to first and second subsets of selected bits in each group of N consecutive ones of said input bits for forming first and second expanded versions of the bits in each of said first and second subsets, respectively, each of said expanded versions having at least one more bit than the subset from which it is formed, and means individually responsive to said first and second expanded versions for modulating in-phase and quadrature components of said carrier signal to generate an individual one of a predetermined constellation of signal points, wherein said forming means includes means for combining at least one bit in said first subset with at least one bit in the first subset of a preceding one of saidn N-bit groups and means for combining at least one bit in said second subset with at least one bit in the second subset of a preceding one of said N-bit groups, said combining and modulating means being arranged such that less than all possible sequences of said signal points is generated.
Claim 3
Dependent Claim
165 words
Apparatus for encoding a sequence of input bits by QAM modulation of a carrier signal, including: first means for forming successive groups of N=r+r 1 bits in response to a scrambled version of said input bits, a finite state machine responsive to the first r bits in each group and in at least one preceding group for forming a first r+1 bit code word and responsive to the second r 1 bits in each group and in at least one preceding group for forming a second r 1 +1 bit code word, and third means for modulating the in-phase and quadrature components of said carrier signal in accordance with amplitude levels that are assigned to said first and second code words, respectively, to generate an individual one of a predetermined constellation of signal points, said r+1 and r 1 +1 bit code words being formed, and said amplitude levels being assigned, such that the minimum euclidean distance between generated sequences of said points is maximized.
Claim 4
Dependent Claim
165 words
Apparatus for encoding a sequence of input bits by QAM modulation of a carrier signal, including: first means for forming successive groups of N=r+r 1 bits in response to a scrambled version of said input bits, a finite state machine responsive to the first r bits in each group and in at least one preceding group for forming a first r+1 bit code word and responsive to the second r 1 bits in each group and in at least one preceding group for forming a second r 1 +1 bit code word, and third means for modulating the in-phase and quadrature components of said carrier signal in accordance with amplitude levels that are assigned to said first and second code words, respectively, to generate an individual one of a predetermined constellation of signal points, said r+1 and r 1 +1 bit code words being formed, and said amplitude levels being assigned, such that the minimum euclidean distance between generated sequences of said points is maximized.
Claim 5
Dependent Claim
148 words
Apparatus for encoding an input bit sequence comprising: means responsive to said input sequence for providing groups of N output bits, each of said groups including a first subset of bits X 0 n and X 1 n and a second subset of bits X 0 m and X 1 m where n and m are indices of the group from which said subsets are derived, means including a convolutional encoder for expanding bits in each of said subsets as a specified function of bits in subsets of previous groups, to yield first and second multibit code words Y 0 n Y 1 n Y 2 n and Y 0 m Y 1 m Y 2 m , and means for modulating in-phase and quadrature components of a carrier signal in response to first and second symbols generated in response to said first and second multibit code words.
Claim 6
Dependent Claim
148 words
Apparatus for encoding an input bit sequence comprising: means responsive to said input sequence for providing groups of N output bits, each of said groups including a first subset of bits X 0 n and X 1 n and a second subset of bits X 0 m and X 1 m where n and m are indices of the group from which said subsets are derived, means including a convolutional encoder for expanding bits in each of said subsets as a specified function of bits in subsets of previous groups, to yield first and second multibit code words Y 0 n Y 1 n Y 2 n and Y 0 m Y 1 m Y 2 m , and means for modulating in-phase and quadrature components of a carrier signal in response to first and second symbols generated in response to said first and second multibit code words.
Claim 7
Dependent Claim
65 words
The invention defined in claim 3 wherein said first multibit code word is related to said first subset of bits such that: Y.sub.0.sup.n =X.sub.1.sup.n ⊕X.sub.1.sup.n-1 ⊕X.sub.1.sup.n-2 Y.sub.1.sup.n =X.sub.1.sup.n ⊕X.sub.1.sup.n-2 Y.sub.2.sup.n =X.sub.2.sup.n and said second multibit code word is related to said second set of bits such that Y.sub.0.sup.m =X.sub.1.sup.m ⊕X.sub.1.sup.m-1 ⊕X.sub.1.sup.m-2 Y.sub.1.sup.m =X.sub.1.sup.m ⊕X.sub.1.sup.m-2 Y.sub.2.sup.m =X.sub.2.sup.m where the symbol ⊕ represents the exclusive OR function.
Claim 8
Independent Claim
189 words
A method of encoding a sequence of input bits for transmission via a quadrature amplitude modulated carrier signal, comprising the steps of: forming, in response to first and second subsets of selected bits in each group of N consecutive ones of said input bits, first and second expanded versions of the bits in each of said first and second subsets, respectively, each of said expanded versions having at least one more bit than the subset from which it is formed, and modulating, in individual response to said first and second expanded versions, in-phase and quadrature components of said carrier signal to generate an individual one of a predetermined constellation of signal points, wherein said forming step includes combining at least one bit in said first subset with at least one bit in the first subset of a preceding one of said N-bit groups and combining at least one bit in said second subset with at least one bit in the second subset of a preceding one of said N-bit groups, said combining and modulating steps being such that less than all possible sequences of said signal points are generated.
Claim 9
Independent Claim
189 words
A method of encoding a sequence of input bits for transmission via a quadrature amplitude modulated carrier signal, comprising the steps of: forming, in response to first and second subsets of selected bits in each group of N consecutive ones of said input bits, first and second expanded versions of the bits in each of said first and second subsets, respectively, each of said expanded versions having at least one more bit than the subset from which it is formed, and modulating, in individual response to said first and second expanded versions, in-phase and quadrature components of said carrier signal to generate an individual one of a predetermined constellation of signal points, wherein said forming step includes combining at least one bit in said first subset with at least one bit in the first subset of a preceding one of said N-bit groups and combining at least one bit in said second subset with at least one bit in the second subset of a preceding one of said N-bit groups, said combining and modulating steps being such that less than all possible sequences of said signal points are generated.
Claim 10
Independent Claim
152 words
A method of encoding a sequence of input bits by QAM modulation of a carrier signal, including the steps of: forming successive groups of N=r+r 1 bits in response to a scrambled version of said input bits, forming, in response to the first r bits in each group and in at least one preceding group, a first r+1 bit code word and in response to the second r 1 bits in each group and in at least one preceding group, a second r 1 +1 bit code word, and modulating the in-phase and quadrature components of said carrier signal in accordance with said first and second code words, respectively, to generate an individual one of a predetermined constellation of signal points, said r+1 and r 1 +1 bit code words being formed, and said amplitude levels being assigned, such that the minimum euclidean distance between generated sequences of said points is maximized.
Claim 11
Independent Claim
152 words
A method of encoding a sequence of input bits by QAM modulation of a carrier signal, including the steps of: forming successive groups of N=r+r 1 bits in response to a scrambled version of said input bits, forming, in response to the first r bits in each group and in at least one preceding group, a first r+1 bit code word and in response to the second r 1 bits in each group and in at least one preceding group, a second r 1 +1 bit code word, and modulating the in-phase and quadrature components of said carrier signal in accordance with said first and second code words, respectively, to generate an individual one of a predetermined constellation of signal points, said r+1 and r 1 +1 bit code words being formed, and said amplitude levels being assigned, such that the minimum euclidean distance between generated sequences of said points is maximized.
Claim 12
Independent Claim
142 words
A method of encoding an input bit sequence comprising the steps of: forming groups of N output bits, each of said groups including a first subset of bits X 0 n and X 1 n and a second subset of bits X 0 m and X 1 m where n and m are indices of the group from which said subsets are derived. expanding bits in each of said subsets in a convolutional encoder as a specified function of bits in subsets of previous groups, to yield first and second multibit code words Y 0 n Y 1 n Y 2 n and Y 0 m Y 1 m Y 2 m , and modulating in-phase and quadrature components of a carrier signal in response to said first and second symbols generated in response to said first and second multibit code words.
Claim 13
Independent Claim
142 words
A method of encoding an input bit sequence comprising the steps of: forming groups of N output bits, each of said groups including a first subset of bits X 0 n and X 1 n and a second subset of bits X 0 m and X 1 m where n and m are indices of the group from which said subsets are derived. expanding bits in each of said subsets in a convolutional encoder as a specified function of bits in subsets of previous groups, to yield first and second multibit code words Y 0 n Y 1 n Y 2 n and Y 0 m Y 1 m Y 2 m , and modulating in-phase and quadrature components of a carrier signal in response to said first and second symbols generated in response to said first and second multibit code words.
Claim 14
Dependent Claim
66 words
The method defined in claim 7 wherein said first multibit code word is formed from said first subset of bits such that: Y.sub.0.sup.n =X.sub.1.sup.n ⊕X.sub.1.sup.n-1 ⊕X.sub.1.sup.n-2 Y.sub.1.sup.n =X.sub.1.sup.n ⊕X.sub.1.sup.n-2 Y.sub.2.sup.n =X.sub.2.sup.n and said second multibit code word is formed from said second set of bits such that Y.sub.0.sup.m =X.sub.1.sup.m ⊕X.sub.1.sup.m -1 ⊕X.sub.1.sup.m-2 Y.sub.1.sup.m =X.sub.1.sup.m ⊕X.sub.1.sup.m-2 Y.sub.2.sup.m =X.sub.2.sup.m where the symbol ⊕ represents the exclusive OR function.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-08-05 | 1989-02-04 | 1989-08-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-08-05 | 1993-02-04 | 1993-08-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-08-05 | 1997-02-04 | 1997-08-06 | $7700.00 | Window Closed / Lapsed |