Patent US5691992A successfully refreshed from Google Patents.
US5691992A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Punctured coding system for providing unequal error protection in a digital communication system
Assignee: Ericsson Inc
•
Filing: 1995-10-12
•
Granted: 1997-11-25
•
Expires: 2015-10-12
Abstract
Abstract A coding system for error protecting both insignificant and significant symbols of a digital message to be transmitted from a transmitter to a receiver of a digital system. Error protection for both insignificant and significant symbols is provided by coding at the transmitter both significant and insignificant symbols of message blocks forming the digital message. The symbol rate of the coded signal to be transmitted is reduced and unequal error protection is provided to the significant symbols by puncturing a selected number of insignificant symbols of each codeword of the coded signal. At the receiver, a correction determination is made for each received codeword as to whether the erasures and errors of the received codeword are correctable. The correction determination is a function of the number of errors, number of erasures, and the minimum distance of the code. Based on this correction determination, the received codeword is depunctured and decoded.
Inventors
- 👤 Barbara Davis Molnar
- 👤 Stanley Lynn Reinhold
- 👤 Amer Aref Hassan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 21:54
CPC Classifications
H; H03; H03M; H03M13/00; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0067; H04L1/0068; H03M13/35; H04L2001/0098
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
134 words
A coding method for error protecting a digital message to be transmitted from a transmitter to a receiver over a channel, comprising: a) coding the digital message according to a predetermined code prior to transmission to produce codewords having significant message symbols, insignificant message symbols, and redundancy symbols, wherein the redundancy symbols error protect both the significant and insignificant message symbols; b) puncturing τ insignificant symbols of each codeword prior to transmission so as to produce erasures in the codewords; c) depuncturing the punctured codewords after transmission to produce depunctured codewords, the step of depuncturing received punctured codewords including: 1) determining for each received punctured codeword if the punctured codeword is correctable, and 2) correcting the punctured codewords determined to be correctable so as to produce corrected depunctured codewords; d) decoding the depunctured codewords.
Claim 2
Dependent Claim
134 words
A coding method for error protecting a digital message to be transmitted from a transmitter to a receiver over a channel, comprising: a) coding the digital message according to a predetermined code prior to transmission to produce codewords having significant message symbols, insignificant message symbols, and redundancy symbols, wherein the redundancy symbols error protect both the significant and insignificant message symbols; b) puncturing τ insignificant symbols of each codeword prior to transmission so as to produce erasures in the codewords; c) depuncturing the punctured codewords after transmission to produce depunctured codewords, the step of depuncturing received punctured codewords including: 1) determining for each received punctured codeword if the punctured codeword is correctable, and 2) correcting the punctured codewords determined to be correctable so as to produce corrected depunctured codewords; d) decoding the depunctured codewords.
Claim 3
Dependent Claim
109 words
The coding method of claim 1, wherein when a received punctured codeword is determined to be correctable the erasures in the received punctured codeword are filled with the corresponding τ punctured symbols and error symbols are corrected such that the message symbols of the corrected depunctured codeword is equivalent to the message symbols of the corresponding transmitted codeword, and when a received punctured codeword is determined not to be correctable the erasures in the received punctured codeword are filled with substitute symbols and errors are not corrected such that the message symbols of the non-corrected depunctured codeword is not equivalent to the message symbols of the corresponding transmitted codeword.
Claim 4
Dependent Claim
14 words
The coding method of claim 1, wherein the predetermined code is a systematic code.
Claim 5
Dependent Claim
29 words
The coding method of claim 1, wherein the step of determining if the punctured codeword is correctable includes determining the number of error symbols e s in the codeword.
Claim 6
Dependent Claim
44 words
The coding method of claim 4, wherein the step of determining if the punctured codeword is correctable is a function of the number of error symbols e s , the number of τ erasures, and the minimum distance d min of the predetermined code.
Claim 7
Dependent Claim
65 words
The coding method of claim 5, wherein the step of determining if the punctured codeword is correctable includes comparing the number of error symbols e to a maximum threshold, wherein the maximum threshold is determined as a function of a maximum threshold equation: ##EQU3## where d min is the minimum distance of the predetermined code and τ is the number of erasures in the codeword.
Claim 8
Dependent Claim
13 words
The coding method of claim 6, wherein the codeword is correctable if ##EQU4##
Claim 9
Dependent Claim
154 words
A coding system for error protecting a digital message to be transmitted from a transmitter to a receiver over a channel, comprising: a) a coding circuit for coding the digital message according to a predetermined code prior to transmission to produce codewords having significant message symbols, insignificant message symbols, and redundancy symbols, wherein the redundancy symbols error protect both the significant and insignificant message symbols; b) a puncturing circuit for puncturing τ insignificant symbols of each codeword prior to transmission so as to produce erasures in the codewords; c) a depuncturing circuit for depuncturing the punctured codewords after transmission to produce depunctured codewords, the depuncturing circuit including: 1) correction determination means for determining for each received punctured codeword if the punctured codeword is correctable, and 2) correction means for correcting the punctured codewords determined to be correctable so as to produce corrected depunctured codewords; and d) a decoding circuit for decoding the depunctured codewords.
Claim 10
Dependent Claim
154 words
A coding system for error protecting a digital message to be transmitted from a transmitter to a receiver over a channel, comprising: a) a coding circuit for coding the digital message according to a predetermined code prior to transmission to produce codewords having significant message symbols, insignificant message symbols, and redundancy symbols, wherein the redundancy symbols error protect both the significant and insignificant message symbols; b) a puncturing circuit for puncturing τ insignificant symbols of each codeword prior to transmission so as to produce erasures in the codewords; c) a depuncturing circuit for depuncturing the punctured codewords after transmission to produce depunctured codewords, the depuncturing circuit including: 1) correction determination means for determining for each received punctured codeword if the punctured codeword is correctable, and 2) correction means for correcting the punctured codewords determined to be correctable so as to produce corrected depunctured codewords; and d) a decoding circuit for decoding the depunctured codewords.
Claim 11
Dependent Claim
108 words
The coding system of claim 8, wherein when a received punctured codeword is determined to be correctable the erasures in the received punctured codeword are filled with the τ punctured symbols and error symbols are corrected such that the message symbols of the corrected depunctured codeword is equivalent to the message symbols of the corresponding transmitted codeword, and when a received punctured codeword is determined not to be correctable the erasures in the received punctured codeword are filled with substitute symbols and errors are not corrected such that the message symbols of the non-corrected depunctured codeword is not equivalent to the message symbols of the corresponding transmitted codeword.
Claim 12
Dependent Claim
14 words
The coding system of claim 8, wherein the predetermined code is a systematic code.
Claim 13
Dependent Claim
25 words
The coding system of claim 8, wherein the correction determination means includes means for determining the number of error symbols e s in the codeword.
Claim 14
Dependent Claim
46 words
The coding system of claim 11, wherein the correction determination means for determining if the punctured codeword is correctable is a function of the number of error symbols e s , the number of τ erasures, and the minimum distance d min of the predetermined code.
Claim 15
Dependent Claim
68 words
The coding system of claim 12, wherein the correction determination means for determining if the punctured codeword is correctable includes comparing the number of error symbols e s to a maximum threshold, wherein the maximum threshold is determined as a function of a maximum threshold equation: ##EQU5## where d min is the minimum distance of the predetermined code and τ is the number of erasures in the codeword.
Claim 16
Dependent Claim
13 words
The coding system of claim 13, wherein the codeword is correctable if ##EQU6##
Claim 17
Dependent Claim
142 words
A digital communication method comprising: a) receiving a digital message including message blocks of k message symbols where the message blocks have significant message symbols and insignificant message symbols; b) coding the digital message to produce code words corresponding to the message blocks, the code words having n code symbols, where n>k and each code word includes the message symbols of the corresponding message block and redundancy symbols; c) puncturing τ insignificant symbols of each code word to produce a punctured signal including punctured code words with each punctured codeword having τ erasures; d) transmitting the punctured signal over a channel; e) receiving the punctured signal transmitted over the channel, the received punctured signal including received punctured code words; f) determining for each received punctured code word if the code word is correctable; g) correcting the code words determined to be correctable.
Claim 18
Dependent Claim
142 words
A digital communication method comprising: a) receiving a digital message including message blocks of k message symbols where the message blocks have significant message symbols and insignificant message symbols; b) coding the digital message to produce code words corresponding to the message blocks, the code words having n code symbols, where n>k and each code word includes the message symbols of the corresponding message block and redundancy symbols; c) puncturing τ insignificant symbols of each code word to produce a punctured signal including punctured code words with each punctured codeword having τ erasures; d) transmitting the punctured signal over a channel; e) receiving the punctured signal transmitted over the channel, the received punctured signal including received punctured code words; f) determining for each received punctured code word if the code word is correctable; g) correcting the code words determined to be correctable.
Claim 19
Dependent Claim
108 words
The coding method of claim 15, wherein when a received punctured codeword is determined to be correctable the erasures in the received punctured codeword are filled with the τ punctured symbols and error symbols are corrected such that the message symbols of the corrected depunctured codeword is equivalent to the message symbols of the corresponding transmitted codeword, and when a received punctured codeword is determined not to be correctable the erasures in the received punctured codeword are filled with substitute symbols and errors are not corrected such that the message symbols of the non-corrected depunctured codeword is not equivalent to the message symbols of the corresponding transmitted codeword.
Claim 20
Dependent Claim
14 words
The coding method of claim 15, wherein the predetermined code is a systematic code.
Claim 21
Dependent Claim
29 words
The coding method of claim 15, wherein the step of determining if the punctured codeword is correctable includes determining the number of error symbols e s in the codeword.
Claim 22
Dependent Claim
44 words
The coding method of claim 18, wherein the step of determining if the punctured codeword is correctable is a function of the number of error symbols e s , the number of τ erasures, and the minimum distance d min of the predetermined code.
Claim 23
Dependent Claim
66 words
The coding method of claim 19, wherein the step of determining if the punctured codeword is correctable includes comparing the number of error symbols e s to a maximum threshold, wherein the maximum threshold is determined as a function of a maximum threshold equation: ##EQU7## where d min is the minimum distance of the predetermined code and τ is the number of erasures in the codeword.
Claim 24
Dependent Claim
13 words
The coding method of claim 18, wherein the codeword is correctable if ##EQU8##
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) | 2000-11-24 | 2001-05-26 | 2001-11-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-11-24 | 2005-05-26 | 2005-11-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-11-24 | 2009-05-26 | 2009-11-25 | $7700.00 | Window Closed / Lapsed |