US6308294B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive hybrid ARQ using turbo code structure
Assignee: Google Technology Holdings LLC
•
Filing: 2000-06-26
•
Granted: 2001-10-23
•
Expires: 2020-06-26
Abstract
Abstract A generic structure of Hybrid ARQ using Turbo Codes is provided which requires the function of a) channel coding, b) redundancy selection, c) buffering and max-ratio diversity combining, d) channel decoding, e) error detection and f) sending back an acknowledgement to the transmitter. The functions (a) and (b) are performed at the transmitter while functions (c) to (f) are performed at the receiver. The initial code rate can be explicitly communicated to the receiver or blindly detected.
Inventors
- 👤 Amitava Ghosh
- 👤 Brian K. Classon
- 👤 Mark C. Cudak
- 👤 Louay Jalloul
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 18:41
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/12; H04L1/16; H04L1/18; H03; H03M; H03M13/00; H03M13/63; H03M13/6306; H04L1/004; H04L1/0041; H04L1/0045; H04L1/0047; H04L1/005; H04L1/0056; H04L1/0064; H04L1/0066; H04L1/1812; H04L1/1819; H04L1/1829; H04L1/1835; H04L1/1845; H03M13/29; H03M13/2957; H03M13/35; H03M13/353; H03M13/37; H03M13/3761; H04L1/1867; H04L1/1874
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
95 words
A method for transmitting data packets, the method comprising the steps of: receiving an incoming data packet; determining an initial turbo code rate based on a channel condition; turbo encoding the data packet to produce encoded bits comprising a plurality of systematic bits and a plurality of parity bits; transmitting a first portion of the encoded bits based on the initial turbo code rate; determining if an acknowledgment has been received for the transmitted first portion; and based on the acknowledgment and the initial turbo code rate, transmitting a second portion of the encoded bits.
Claim 2
Independent Claim
95 words
A method for transmitting data packets, the method comprising the steps of: receiving an incoming data packet; determining an initial turbo code rate based on a channel condition; turbo encoding the data packet to produce encoded bits comprising a plurality of systematic bits and a plurality of parity bits; transmitting a first portion of the encoded bits based on the initial turbo code rate; determining if an acknowledgment has been received for the transmitted first portion; and based on the acknowledgment and the initial turbo code rate, transmitting a second portion of the encoded bits.
Claim 3
Dependent Claim
21 words
The method of claim 1 where the second portion of encoded bits is smaller than the first portion of encoded bits.
Claim 4
Dependent Claim
19 words
The method of claim 1 where the a plurality of systematic and a plurality of parity bits are stored.
Claim 5
Dependent Claim
21 words
The method of claim 1 where the channel condition used to determine the initial turbo code rate is a carrier-to-interference ratio.
Claim 6
Dependent Claim
22 words
The method of claim 1 where the channel conditions used to determine the initial turbo code rate are determined by the transmitter.
Claim 7
Dependent Claim
22 words
The method of claim 1 where the channel conditions used to determine the initial turbo code rate are reported by the receiver.
Claim 8
Dependent Claim
24 words
The method of claim 1 where the initial turbo code rate is N/M, with N=1,2,3. . . , M=1,2,3. . . , and N<=M.
Claim 9
Dependent Claim
39 words
The method of claim 1 further comprising the steps of: determine if a second acknowledgment has been received for the transmitted second portion; and based on the second acknowledgment being received, transmitting a third portion of the encoded bits.
Claim 10
Dependent Claim
39 words
The method of claim 8 further comprising the steps of: determining if a third acknowledgment has been received for the transmitted third portion; and based on the third acknowledgment being received, transmitting a fourth portion of the encoded bits.
Claim 11
Dependent Claim
25 words
The method of claim 1 wherein the step of transmitting the first portion of the encoded bits comprises the step of transmitting systematic encoded bits.
Claim 12
Dependent Claim
32 words
The method of claim 1 wherein the step of transmitting the first portion of the encoded bits comprises the step of transmitting systematic encoded bits and a portion of the parity bits.
Claim 13
Dependent Claim
24 words
The method of claim 1 where a subsequent portion of the encoded bits, but not all subsequent portions of the encoded bits, are self-decodable.
Claim 14
Dependent Claim
18 words
The method of claim 12 wherein the subsequent portion of the encoded bits includes interleaved systematic encoded bits.
Claim 15
Dependent Claim
25 words
The method of claim 12 wherein the subsequent portion of the encoded bits includes interleaved systematic encoded bits and a portion of the parity bits.
Claim 16
Independent Claim
123 words
A method for receiving data packets, the method comprising the steps of: receiving a portion of an encoded data packet; determining the content of information and parity symbols in the received portion based on an initial code rate for a first received portion of the encoded data packet; self-decoding the received portion; determining whether the self-decoding successfully decoded the received portion; when the self-decoding of the received portion is not successful, combining the received portion of the encoded data packet with a previously combined portion of the encoded data packet to produce a new combined portion; storing the new combined portion; joint turbo decoding the new combined portion to produce decoded bits; and acknowledging if no error is present in the decoded bits.
Claim 17
Independent Claim
123 words
A method for receiving data packets, the method comprising the steps of: receiving a portion of an encoded data packet; determining the content of information and parity symbols in the received portion based on an initial code rate for a first received portion of the encoded data packet; self-decoding the received portion; determining whether the self-decoding successfully decoded the received portion; when the self-decoding of the received portion is not successful, combining the received portion of the encoded data packet with a previously combined portion of the encoded data packet to produce a new combined portion; storing the new combined portion; joint turbo decoding the new combined portion to produce decoded bits; and acknowledging if no error is present in the decoded bits.
Claim 18
Dependent Claim
26 words
The method of claim 15 where the received portion of the encoded data packet is weighted with a block signal to noise ratio (SNR) before combining.
Claim 19
Dependent Claim
18 words
The method of claim 15 where the combining step comprises symbol combining interleaved systematic symbols with systematic symbols.
Claim 20
Dependent Claim
31 words
The method of claim 15 where the combining step comprises symbol combining overlapping symbols and concatenating non-overlapping symbols of the received portion of the encoded packet with the previous combined portion.
Claim 21
Dependent Claim
17 words
The method of claim 15 where the combining step comprises replacing systematic symbols with interleaved systematic symbols.
References Cited (Backward Citations)
US5983384A
Cited
US5978365A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-10-22 | 2005-04-23 | 2005-10-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-10-22 | 2009-04-23 | 2009-10-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-10-22 | 2013-04-23 | 2013-10-23 | $7700.00 | Window Closed / Lapsed |