US5844922A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High rate trellis coding and decoding method and apparatus
Assignee: Qualcomm Inc
•
Filing: 1997-01-07
•
Granted: 1998-12-01
•
Expires: 2017-01-07
Abstract
Abstract A method and apparatus for constructing high rate trellis codes for PSK modulation that can be encoded and decoded using the encoder and decoder for a rate 1/2 punctured convolutional code. In particular, the design of trellis encoders and decoders for 2 k -PSK modulation for rates (km-1)/km for k≧3 and m≧1 is provided.
Inventors
- 👤 Jack Keil Wolf
- 👤 Ephraim Zehavi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 22:56
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0059; H04L1/006; H03; H03M; H03M13/00; H03M13/25; H03M13/256; H03M13/37; H03M13/3776; H03M13/39; H03M13/41; H03M13/63; H03M13/635; H03M13/6362; H04L1/0041; H04L1/0045; H04L1/0054; H04L1/0067; H04L1/0068
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
88 words
A method for trellis encoding for transmission using M-ary modulation comprising: receiving n input data bits; encoding according to a first punctured convolutional encoding format a subset of k bits of said n input data bits to provide a first set of code bits; and combining said first set of coded bits and remaining n-k input data bits to provide transmission sets, in accordance with a predetermined combining format; wherein each of said transmission sets comprises log 2 M members and k is an integer greater than one.
Claim 2
Independent Claim
88 words
A method for trellis encoding for transmission using M-ary modulation comprising: receiving n input data bits; encoding according to a first punctured convolutional encoding format a subset of k bits of said n input data bits to provide a first set of code bits; and combining said first set of coded bits and remaining n-k input data bits to provide transmission sets, in accordance with a predetermined combining format; wherein each of said transmission sets comprises log 2 M members and k is an integer greater than one.
Claim 3
Dependent Claim
24 words
The method of claim 1 wherein said punctured convolutional encoding is a punctured convolutional encoding rate k/k+1 using a rate 1/2 convolutional encoding format.
Claim 4
Dependent Claim
18 words
The method of claim 2 wherein said rate 1/2 convolutional encoding format has a constraint length of seven.
Claim 5
Dependent Claim
40 words
The method of claim 3 wherein said input data bits comprise five data bits, said subset of data bits comprises three data bits, and said convolutional encoding comprises a rate 3/4 encoding based upon a punctured rate 1/2 convolutional encoding.
Claim 6
Dependent Claim
40 words
The method of claim 3 wherein said input data bits comprise seven data bits, said subset of data bits comprises three data bits, and said convolutional encoding comprises a rate 3/4 encoding based upon a punctured rate 1/2 convolutional encoding.
Claim 7
Dependent Claim
40 words
The method of claim 3 wherein said input data bits comprise eight data bits, said subset of data bits comprises five data bits, and said convolutional encoding comprises a rate 5/6 encoding based upon a punctured rate 1/2 convolutional encoding.
Claim 8
Dependent Claim
40 words
The method of claim 3 wherein said input data bits comprise eleven data bits, said subset of data bits comprises five data bits, and said convolutional encoding comprises a rate 5/6 encoding based upon a punctured rate 1/2 convolutional encoding.
Claim 9
Dependent Claim
36 words
The method of claim 1 wherein said input data bits comprise five data bits and wherein said subset of data bits comprises three data bits to be encoded according to said first punctured convolutional encoding format.
Claim 10
Dependent Claim
25 words
The method of claim 8 wherein said first punctured convolutional encoding format comprises a rate 3/4 encoding based upon a puncture rate 1/2 convolutional encoding.
Claim 11
Dependent Claim
36 words
The method of claim 1 wherein said input data bits comprise seven data bits and wherein said subset of data bits comprises three data bits to be encoded according to said first punctured convolutional encoding format.
Claim 12
Dependent Claim
25 words
The method of claim 10 wherein said first punctured convolutional encoding format comprises a rate 3/4 encoding based upon a puncture rate 1/2 convolutional encoding.
Claim 13
Dependent Claim
36 words
The method of claim 1 wherein said input data bits comprise eight data bits and wherein said subset of data bits comprises five data bits to be encoded according to said first punctured convolutional encoding format.
Claim 14
Dependent Claim
25 words
The method of claim 12 wherein said first punctured convolutional encoding format comprises a rate 5/6 encoding based upon a puncture rate 1/2 convolutional encoding.
Claim 15
Dependent Claim
36 words
The method of claim 1 wherein said input data bits comprise eleven data bits and wherein said subset of data bits comprises five data bits to be encoded according to said first punctured convolutional encoding format.
Claim 16
Dependent Claim
25 words
The method of claim 14 wherein said first punctured convolutional encoding format comprises a rate 5/6 encoding based upon a puncture rate 1/2 convolutional encoding.
Claim 17
Dependent Claim
22 words
The method of claim 1 wherein said convolutional coding comprises a rate 3/4 encoding based upon a puncture rate 1/2 convolutional encoding.
Claim 18
Dependent Claim
22 words
The method of claim 1 wherein said convolutional coding comprises a rate 5/6 encoding based upon a puncture rate 1/2 convolutional encoding.
Claim 19
Dependent Claim
28 words
The method of claim 1 further comprising a differential encoder means for differentially encoding said remaining data bits responsive to the values of said first set of symbols.
Claim 20
Independent Claim
204 words
A method for decoding M-ary trellis modulated data encoded according to an encoding format wherein k bits of n input data bits are encoded according to a first encoding format to provide a first set of symbols and combining said first set of symbols and remaining n-k input data bits to provide transmission sets, in accordance with a predetermined combining format, and wherein each of said transmission sets comprises log 2 M members, a method comprising: receiving said trellis modulated data; decoding according to a first decoding format said trellis modulated data to provide a first estimate of said transmission set; decoding according to a second decoding format to provide a corrected first estimate of said k bits of n input data bits; encoding according to said first encoding format corrected first estimate of said k bits to provide a second set of symbols; decoding according to a third decoding format said first estimate of transmission set responsive to said second set of symbols to provide a corrected estimate of said remaining input data bits; combining said corrected estimate of said remaining input data bits and said corrected first estimate of said k bits to provide an estimate of said n input data bits.
Claim 21
Independent Claim
204 words
A method for decoding M-ary trellis modulated data encoded according to an encoding format wherein k bits of n input data bits are encoded according to a first encoding format to provide a first set of symbols and combining said first set of symbols and remaining n-k input data bits to provide transmission sets, in accordance with a predetermined combining format, and wherein each of said transmission sets comprises log 2 M members, a method comprising: receiving said trellis modulated data; decoding according to a first decoding format said trellis modulated data to provide a first estimate of said transmission set; decoding according to a second decoding format to provide a corrected first estimate of said k bits of n input data bits; encoding according to said first encoding format corrected first estimate of said k bits to provide a second set of symbols; decoding according to a third decoding format said first estimate of transmission set responsive to said second set of symbols to provide a corrected estimate of said remaining input data bits; combining said corrected estimate of said remaining input data bits and said corrected first estimate of said k bits to provide an estimate of said n input data bits.
References Cited (Backward Citations)
US3789360A
Cited
US4447908A
Cited
US4462101A
Cited
US4586182A
Cited
US4777636A
Cited
US4823346A
Cited
US4807253A
Cited
US4939749A
Cited
US4993046A
Cited
US5115453A
Cited
US5113400A
Cited
US5233630A
Cited
US5233629A
Cited
US5195170A
Cited
US5544328A
Cited
US5289501A
Cited
US5258987A
Cited
US5408502A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-11-30 | 2002-06-01 | 2002-12-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-30 | 2006-06-01 | 2006-12-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-30 | 2010-06-01 | 2010-12-01 | $7700.00 | Window Closed / Lapsed |