Patent US6170076B1 successfully refreshed from Google Patents.
US6170076B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Systematic punctured convolutional encoding method
Assignee: Samsung Electronics Co Ltd
•
Filing: 1998-06-25
•
Granted: 2001-01-02
•
Expires: 2018-06-25
Abstract
Abstract A rate-l/n or rate-k/n convolutional encoding method, in a digital communications system having a non-systematic convolutional encoder, includes the steps of: obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; and generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder.
Inventors
- 👤 Min-goo Kim
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 16:01
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0067; H04L1/0068; H04L1/0069; H03; H03M; H03M13/00; H03M13/03; H03M13/23; H03M13/29; H03M13/31; H04L1/0041; H04L1/0045; H04L1/0054; H04L1/0059; H04L1/08; H04L1/0071
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
171 words
A method of rate-1/2 convolutional encoding in a digital communications system, comprising the steps of: obtaining first and second block code words by multiplying an input information word by first and second convolutional code generating polynomials, respectively; and generating a convolutional code word by interleaving the first and second code words with an interleaving depth (λ) of n; wherein the input information word exists in a systematic form in the second block code word C 2 (x) expressed as C 2 ( x )= r 2 ( x )+ x m I ( x ) = I n ( x ) g 2 ( x ) = C s ( x ) where I(x) is the input word r 2 (x) is a remainder after dividing x m I(x) by g 2 (x), m is the number of shifters, I n (x) is an information word polynomial, g 2 (x) is a code word generating polynomial for the second block code word, and C s (x) is a systematic code word.
Claim 2
Independent Claim
171 words
A method of rate-1/2 convolutional encoding in a digital communications system, comprising the steps of: obtaining first and second block code words by multiplying an input information word by first and second convolutional code generating polynomials, respectively; and generating a convolutional code word by interleaving the first and second code words with an interleaving depth (λ) of n; wherein the input information word exists in a systematic form in the second block code word C 2 (x) expressed as C 2 ( x )= r 2 ( x )+ x m I ( x ) = I n ( x ) g 2 ( x ) = C s ( x ) where I(x) is the input word r 2 (x) is a remainder after dividing x m I(x) by g 2 (x), m is the number of shifters, I n (x) is an information word polynomial, g 2 (x) is a code word generating polynomial for the second block code word, and C s (x) is a systematic code word.
Claim 3
Independent Claim
193 words
A method of rate-1/n convolutional encoding in a digital communications system having a non-systematic convolutional encoder, comprising the steps of: (a) obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; (b) converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; and (c) generating a convolutional code by encoding the new information word in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word in accordance with the following relationship: C s ( x )= r q ( x )+ x m I ( x ) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
Claim 4
Independent Claim
193 words
A method of rate-1/n convolutional encoding in a digital communications system having a non-systematic convolutional encoder, comprising the steps of: (a) obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; (b) converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; and (c) generating a convolutional code by encoding the new information word in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word in accordance with the following relationship: C s ( x )= r q ( x )+ x m I ( x ) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
Claim 5
Independent Claim
115 words
A method of rate-k/n convolutional encoding in a digital communications system having a non-systematic convolutional encoder, comprising the steps of: obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; generating a convolutional code by encoding the new information word in the non-systematic convolutional encoder; and systematically puncturing the convolutional code by use of a predetermined puncturing matrix; wherein all elements in a row vector of the predetermined puncturing matrix are 1s.
Claim 6
Independent Claim
115 words
A method of rate-k/n convolutional encoding in a digital communications system having a non-systematic convolutional encoder, comprising the steps of: obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; generating a convolutional code by encoding the new information word in the non-systematic convolutional encoder; and systematically puncturing the convolutional code by use of a predetermined puncturing matrix; wherein all elements in a row vector of the predetermined puncturing matrix are 1s.
Claim 7
Dependent Claim
19 words
The method of claim 3 , wherein a convolutional code generated according to the predetermined puncturing matrix is non-catastrophic.
Claim 8
Dependent Claim
34 words
The method of claim 4 , wherein the generated convolutional code according to the predetermined puncturing matrix has a largest value of minimum free distance (d-free) and a minimum information code error after decoding.
Claim 9
Dependent Claim
38 words
The method of claim 5 , wherein the puncturing matrix is selected from given matrices according to a corresponding code rate, and the convolutional code is punctured according to a weight spectrum corresponding to the selected puncturing matrix.
Claim 10
Dependent Claim
280 words
The method of claim 6 , wherein the given puncturing matrix and corresponding weight spectrum are selected from one of a following puncturing matrices: [ 1 0 1 1 ] where a constraint length (k) is 3, a first generating polynomial (G 1 ) is 101, a second generating polynomial (G 2 ) is 111, and d-free is 5; [ 1 1 0 1 ] where a constraint length (k) is 4, a first generating polynomial (G 1 ) is 1101, a second generating polynomial (G 2 ) is 1111, and d-free is 6; [ 1 1 0 1 ] where a constraint length (k) is 5, a first generating polynomial (G 1 ) is 10011, a second generating polynomial (G 2 ) is 11101, and d-free is 7; [ 1 0 1 1 ] where a constraint length (k) is 6, a first generating polynomial (G 1 ) is 101011, a second generating polynomial (G 2 ) is 111101, and d-free is 8; and [ 1 1 1 0 ] where a constraint length (k) is 7, a first generating polynomial (G 1 ) is 1011011, a second generating polynomial (G 2 ) is 1111001, and d-free is 10 input information constraint first generating second generating puncturing length (k) polynomial (G 1 ) polynomial (G 2 ) d-free matrix 3 101 111 5 [ 1 0 1 1 ] 4 1101 1111 6 [ 1 1 0 1 ] 5 10011 11101 7 [ 1 1 0 1 ] 6 101011 111101 8 [ 1 0 1 1 ] 7 1011011 1111001 10 [ 1 1 0 1 ]
Claim 11
Dependent Claim
171 words
A rate-1/2 convolutional encoding system for a digital communication system, comprising: means for obtaining first and second block code words by multiplying an input information word by first and second convolutional code generating polynomials, respectively; and means for generating a convolutional code word by interleaving the first and second code words with an interleaving depth (λ) of n; wherein the input information word exists in a systematic form in the second block code word C 2 (x) expressed as C 2 ( x )= r 2 ( x )+ x m I ( x ) = I n ( x ) g 2 ( x ) = C s ( x ) where I(x) is the input word, r 2 (x) is a remainder after dividing x m I(x) by g 2 (x), m is the number of shifters, I n (x) is an information word polynomial, g 2 (x) is a code word generating polynomial for the second block code word, and C s (x) is a systematic code word.
Claim 12
Dependent Claim
171 words
A rate-1/2 convolutional encoding system for a digital communication system, comprising: means for obtaining first and second block code words by multiplying an input information word by first and second convolutional code generating polynomials, respectively; and means for generating a convolutional code word by interleaving the first and second code words with an interleaving depth (λ) of n; wherein the input information word exists in a systematic form in the second block code word C 2 (x) expressed as C 2 ( x )= r 2 ( x )+ x m I ( x ) = I n ( x ) g 2 ( x ) = C s ( x ) where I(x) is the input word, r 2 (x) is a remainder after dividing x m I(x) by g 2 (x), m is the number of shifters, I n (x) is an information word polynomial, g 2 (x) is a code word generating polynomial for the second block code word, and C s (x) is a systematic code word.
Claim 13
Dependent Claim
232 words
A rate-1/n convolutional encoding system for a digital communication system having a non-systematic convolutional encoder, comprising: (a) means for obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; (b) means for converting one of the first to n-th block code words to a systematic code word and obtaining a new information word, I n (x), corresponding to the systematic code word; and (c) means for generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word using equation (1), and the new information word corresponding to the systematic code word is obtained using equation (2), in the converting means (b): C s ( x )= r q ( x )+x m I ( x ) (1) I n ( x )= C s ( x )/ g s ( x ) (2) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
Claim 14
Dependent Claim
232 words
A rate-1/n convolutional encoding system for a digital communication system having a non-systematic convolutional encoder, comprising: (a) means for obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; (b) means for converting one of the first to n-th block code words to a systematic code word and obtaining a new information word, I n (x), corresponding to the systematic code word; and (c) means for generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word using equation (1), and the new information word corresponding to the systematic code word is obtained using equation (2), in the converting means (b): C s ( x )= r q ( x )+x m I ( x ) (1) I n ( x )= C s ( x )/ g s ( x ) (2) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
Claim 15
Dependent Claim
120 words
A rate-k/n convolutional encoding system for a digital communication system having a non-systematic convolutional encoder, comprising: means for obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; means for converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; means for generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder; and means for systematically puncturing the convolutional code using a predetermined puncturing matrix wherein the predetermined puncturing matrix satisfies the condition that all elements of one row vector are 1s.
Claim 16
Dependent Claim
120 words
A rate-k/n convolutional encoding system for a digital communication system having a non-systematic convolutional encoder, comprising: means for obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; means for converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; means for generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder; and means for systematically puncturing the convolutional code using a predetermined puncturing matrix wherein the predetermined puncturing matrix satisfies the condition that all elements of one row vector are 1s.
Claim 17
Dependent Claim
46 words
A system as claimed in claim 10 , wherein the predetermined puncturing matrix further satisfies the following conditions: a convolutional code generated is non-catastrophic; and the generated convolutional code has the largest value of minimum free distance (d-free) and a minimum information code error after decoding.
Claim 18
Dependent Claim
40 words
A system as claimed in claim 11 , wherein the puncturing matrix is selected from given matrices according to a corresponding code rate, and the convolutional code is punctured according to a weight spectrum corresponding to the selected puncturing matrix.
Claim 19
Independent Claim
190 words
A method of rate-k/n convolutional encoding in a digital communications system having a non-systematic convolutional encoder, comprising the steps of: obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; and generating a convolutional code by encoding the new information word in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word in accordance with the following relationship: C s ( x )= r q ( x )+ x m I ( x ) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
Claim 20
Independent Claim
190 words
A method of rate-k/n convolutional encoding in a digital communications system having a non-systematic convolutional encoder, comprising the steps of: obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; and generating a convolutional code by encoding the new information word in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word in accordance with the following relationship: C s ( x )= r q ( x )+ x m I ( x ) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
Claim 21
Dependent Claim
232 words
A rate-k/n convolutional encoding system for a digital communication system having a non-systematic convolutional encoder, comprising: (a) means for obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; (b) means for converting one of the first to n-th block code words to a systematic code word and obtaining a new information word, I n (x), corresponding to the systematic code word; and (c) means for generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word using equation (1), and the new information word corresponding to the systematic code word is obtained using equation (2), in the converting means (b): C s ( x )= r q ( x )+x m I ( x ) (1) I n ( x )= C s ( x )/ g s ( x ) (2) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
Claim 22
Dependent Claim
232 words
A rate-k/n convolutional encoding system for a digital communication system having a non-systematic convolutional encoder, comprising: (a) means for obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; (b) means for converting one of the first to n-th block code words to a systematic code word and obtaining a new information word, I n (x), corresponding to the systematic code word; and (c) means for generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder; wherein one of the first to n-th block code words is selected and converted to the systematic code word using equation (1), and the new information word corresponding to the systematic code word is obtained using equation (2), in the converting means (b): C s ( x )= r q ( x )+x m I ( x ) (1) I n ( x )= C s ( x )/ g s ( x ) (2) where C s (x) is a code word of the sth block (s being one of 1, . . . , n), I(x) is an input information word, r q (x) is a remainder after dividing x m I(x) by g s (x), g s (x) being an sth code word generating polynomial, and m is the number of shifters.
References Cited (Backward Citations)
US4312070A
Cited
US4547887A
Cited
US5042033A
Cited
US5446747A
Cited
US5408502A
Cited
US5610908A
Cited
US5473727A
Cited
US5465267A
Cited
US5627538A
Cited
US5535220A
Cited
US5633881A
Cited
US5396518A
Cited
US5438590A
Cited
US5473601A
Cited
US5572532A
Cited
US5486825A
Cited
US5537420A
Cited
US5511082A
Cited
US5592492A
Cited
US5745497A
Cited
US5497401A
Cited
US5621761A
Cited
US5668820A
Cited
US5742622A
Cited
US5721745A
Cited
US5719875A
Cited
US5734962A
Cited
US5996104A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-01-02 | 2004-07-03 | 2005-01-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-01-02 | 2008-07-03 | 2009-01-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-01-02 | 2012-07-03 | 2013-01-02 | $7700.00 | Window Closed / Lapsed |