Patent US525807A successfully refreshed from Google Patents.
US5983384A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Turbo-coding with staged data transmission and processing
Assignee: General Electric Co
•
Filing: 1997-04-21
•
Granted: 1999-11-09
•
Expires: 2017-04-21
Abstract
Abstract Turbo-coding in a communications system involves coding/decoding information in stages in order to avoid retransmission of a full L-bit packet upon occurrence of a packet error. In addition to a set of code bits generated by an encoder using a turbo-coding scheme, a punctured set of code bits is generated and stored in transmitter memory. The original set of code bits is transmitted as an L-bit data packet to a receiver which stores received data samples corresponding to the original set of code bits. The receiver decodes the data packet using a turbo-decoder and determines whether the data packet has been received in error. If so, the received data samples are maintained in memory, and a request for more information is made. Some or all of the punctured information is then forwarded from the transmitter to the receiver. A second stage of turbo-decoding combines the new data samples with the stored original received data samples such that there is a high likelihood that decoding is correct at this point, but additional stages of decoding may be used.
Inventors
- 👤 John Anderson Fergus Ross
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 12:14
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0064; H04L1/0066; H03; H03M; H03M13/00; H03M13/29; H03M13/2957; H03M13/2975; H03M13/37; H03M13/3761; H03M13/63; H03M13/635; H03M13/6362; H03M7/00; H03M7/30; H04L1/0067; H04L1/0068; H04L1/0069; H04L1/12; H04L1/16; H04L1/18; H04L1/1812; H04L1/1819; H04L1/1829; H04L1/1835; H04L1/1845; H03M13/6306; H04L1/0045; H04L1/0047; H04L1/005
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
237 words
A method for turbo-coding in a communications system, comprising: turbo-encoding source information using a parallel concatenation of first and second convolutional codes, the step of turbo-encoding comprising first and second encoding steps, the first encoding step applying the first convolutional code to the source information to provide a first group of code bits, the second encoding step applying the second convolutional code to the source information after interleaving the source information to provide a second group of code bits; puncturing the first and second groups of code bits; storing the punctured first and second groups of code bits in memory; transmitting the first and second groups of non-punctured code bits to a receiver via a channel; storing data samples corresponding to the first and second groups of non-punctured code bits in memory; turbo-decoding the data samples corresponding to the first and second groups of code bits in at least two decoding stages and determining whether the transmitted code bits have been received in error; if a transmission error is detected, maintaining the data samples corresponding to the first and second groups of non-punctured code bits in memory and transmitting at least a predetermined portion of the stored punctured code bits to the receiver, and then turbo-decoding in at least two stages by combining the data samples corresponding to the first and second groups of non-punctured code bits with data samples corresponding to the transmitted punctured code bits.
Claim 2
Independent Claim
237 words
A method for turbo-coding in a communications system, comprising: turbo-encoding source information using a parallel concatenation of first and second convolutional codes, the step of turbo-encoding comprising first and second encoding steps, the first encoding step applying the first convolutional code to the source information to provide a first group of code bits, the second encoding step applying the second convolutional code to the source information after interleaving the source information to provide a second group of code bits; puncturing the first and second groups of code bits; storing the punctured first and second groups of code bits in memory; transmitting the first and second groups of non-punctured code bits to a receiver via a channel; storing data samples corresponding to the first and second groups of non-punctured code bits in memory; turbo-decoding the data samples corresponding to the first and second groups of code bits in at least two decoding stages and determining whether the transmitted code bits have been received in error; if a transmission error is detected, maintaining the data samples corresponding to the first and second groups of non-punctured code bits in memory and transmitting at least a predetermined portion of the stored punctured code bits to the receiver, and then turbo-decoding in at least two stages by combining the data samples corresponding to the first and second groups of non-punctured code bits with data samples corresponding to the transmitted punctured code bits.
Claim 3
Dependent Claim
37 words
The method of claim 1 wherein the step of puncturing comprises deleting code bits according to a predetermined puncturing pattern, and the step of turbo-decoding comprises a depuncturing function for inserting neutral values for the punctured bits.
Claim 4
Dependent Claim
16 words
The method of claim 1 wherein the first and second convolutional codes comprise systematic convolutional codes.
Claim 5
Dependent Claim
30 words
The method of claim 3 wherein the step of puncturing comprises transmitting a single copy of the first and second code bits, which copy is used in each turbo-decoding stage.
Claim 6
Dependent Claim
26 words
The method of claim 1 wherein the step of determining whether the code bits have been received in error comprises a 16-bit cyclic redundancy check code.
Claim 7
Dependent Claim
242 words
A communications system, comprising: a transmitter comprising: a turbo-encoder for turbo-encoding source information, said turbo-encoder comprising a parallel concatenation of first and second convolutional codes, the turbo-encoder applying the first convolutional code to the source information to provide a first group of code bits, and applying the second convolutional code to the source information after interleaving the source information to provide a second group of code bits; a puncturing unit for puncturing the first and second groups of code bits; memory for storing the punctured first and second groups of code bits; said transmitter transmitting the first and second groups of non-punctured code bits via a channel to a receiver; the receiver comprising: memory for storing data samples corresponding to the first and second groups of non-punctured code bits; a turbo-decoder for turbo-decoding the data samples corresponding to the first and second groups of code bits in at least two decoding stages and determining whether the transmitted code bits have been received in error; upon detection of a transmission error, the turbo-decoder maintaining the data samples corresponding to the first and second groups of non-punctured code bits in memory and requesting transmission of at least a predetermined portion of the stored punctured code bits to the receiver, the turbo-decoder then turbo-decoding in at least two stages by combining the data samples corresponding to the first and second groups of non-punctured code bits with data samples corresponding to the transmitted punctured code bits.
Claim 8
Dependent Claim
242 words
A communications system, comprising: a transmitter comprising: a turbo-encoder for turbo-encoding source information, said turbo-encoder comprising a parallel concatenation of first and second convolutional codes, the turbo-encoder applying the first convolutional code to the source information to provide a first group of code bits, and applying the second convolutional code to the source information after interleaving the source information to provide a second group of code bits; a puncturing unit for puncturing the first and second groups of code bits; memory for storing the punctured first and second groups of code bits; said transmitter transmitting the first and second groups of non-punctured code bits via a channel to a receiver; the receiver comprising: memory for storing data samples corresponding to the first and second groups of non-punctured code bits; a turbo-decoder for turbo-decoding the data samples corresponding to the first and second groups of code bits in at least two decoding stages and determining whether the transmitted code bits have been received in error; upon detection of a transmission error, the turbo-decoder maintaining the data samples corresponding to the first and second groups of non-punctured code bits in memory and requesting transmission of at least a predetermined portion of the stored punctured code bits to the receiver, the turbo-decoder then turbo-decoding in at least two stages by combining the data samples corresponding to the first and second groups of non-punctured code bits with data samples corresponding to the transmitted punctured code bits.
Claim 9
Dependent Claim
28 words
The system of claim 6 wherein the puncturing unit deletes code bits according to a predetermined puncturing pattern, and the decoder inserts neutral values for the punctured bits.
Claim 10
Dependent Claim
16 words
The system of claim 6 wherein the first and second convolutional codes comprise systematic convolutional codes.
Claim 11
Dependent Claim
28 words
The system of claim 6 wherein the puncturing unit transmits a single copy of the first and second code bits, which copy is used in each turbo-decoding stage.
Claim 12
Dependent Claim
26 words
The system of claim 6 wherein the decoder determines whether the code bits have been received in error by using a 16-bit cyclic redundancy check code.
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) | 2002-11-08 | 2003-05-10 | 2003-11-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-11-08 | 2007-05-10 | 2007-11-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-11-08 | 2011-05-10 | 2011-11-09 | $7700.00 | Window Closed / Lapsed |