Patent US4089313A successfully refreshed from Google Patents.
Patent US4900546A successfully refreshed from Google Patents.
Patent US5699367A successfully refreshed from Google Patents.
US5699367A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Concatenated error detection coding and packet numbering for hierarchical ARQ schemes
Assignee: Telefonaktiebolaget LM Ericsson AB
•
Filing: 1995-12-29
•
Granted: 1997-12-16
•
Expires: 2015-12-29
Abstract
Abstract A retransmission method is disclosed wherein retransmissions over the sensitive link of the connection only involves packets that were actually disturbed in the sensitive link. At the same time, required storage capacity in the relay stations connecting the sensitive link to the nonsensitive link is reduced. Errors occurring in the sensitive part of the connection will cause retransmission over nonsensitive links of the connection as well, but this is considered to be of less importance since the nonsensitive links have a high throughput and/or low costs.
Inventors
- 👤 Jacobus Haartsen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 20:56
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L1/00; H04L1/12; H04L1/16; H04L1/18; H04L1/1809; H04L9/00; H04L9/40; H04L1/1867; H04L1/188; H04L2001/0092
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
121 words
A method for minimizing retransmissions of packets between two end stations, comprising the steps of: dividing information into numbered packets; error detection coding said packets using a first code at a first end station; transmitting said packets to a relay station using a sensitive link; storing said coded packets in a memory in said relay station; local error detection coding and numbering said received packets; transmitting said packets to a second end station using a non-sensitive link; decoding the local error detection code of said packet and acknowledging receipt if the local coding is correctly decoded; and decoding said first error detection code and sending an acknowledgement to said first end station when the first error detection code is correctly decoded.
Claim 2
Independent Claim
121 words
A method for minimizing retransmissions of packets between two end stations, comprising the steps of: dividing information into numbered packets; error detection coding said packets using a first code at a first end station; transmitting said packets to a relay station using a sensitive link; storing said coded packets in a memory in said relay station; local error detection coding and numbering said received packets; transmitting said packets to a second end station using a non-sensitive link; decoding the local error detection code of said packet and acknowledging receipt if the local coding is correctly decoded; and decoding said first error detection code and sending an acknowledgement to said first end station when the first error detection code is correctly decoded.
Claim 3
Dependent Claim
51 words
A method for minimizing retransmissions of packets between two end stations according to claim 1, further comprising the step of: retransmitting said packet from said relay station to said second end station when said relay station does not receive an acknowledgement within a predetermined period of time after transmitting said packet.
Claim 4
Dependent Claim
48 words
A method for minimizing retransmissions of packets between two end stations according to claim 1, further comprising the step of: retransmitting said packet from said first end station when said first end station does not receive an acknowledgement within a predetermined period of time after transmitting said packet.
Claim 5
Dependent Claim
45 words
A method for minimizing retransmissions of packets between two end stations according to claim 1, further comprising the step of: decoding the first error detection code at said relay station and acknowledging receipt of the packet when the first error detection code is correctly decoded.
Claim 6
Dependent Claim
21 words
A method for minimizing retransmissions of packets between two end stations according to claim 1, wherein said acknowledgements use said numbering.
Claim 7
Independent Claim
139 words
A method for minimizing retransmission of packets between two end stations, comprising the steps of: dividing information into at least one numbered packet; error detection coding said packet using a first code at a first end station; error detection coding said packet using a local code and numbering said packet using a local number; transmitting said coded packet to a relay station over a non-sensitive link; decoding said local error detection coding of said received packet and acknowledging receipt of said packet if the local error detection code is correctly decoded; stripping off said local error detection coding and said local number from said decoded packet; transmitting said stripped packet to a second end-station over a sensitive link; decoding said first error detection code and acknowledging receipt of said packet if the first error detection code is correctly decoded.
Claim 8
Independent Claim
139 words
A method for minimizing retransmission of packets between two end stations, comprising the steps of: dividing information into at least one numbered packet; error detection coding said packet using a first code at a first end station; error detection coding said packet using a local code and numbering said packet using a local number; transmitting said coded packet to a relay station over a non-sensitive link; decoding said local error detection coding of said received packet and acknowledging receipt of said packet if the local error detection code is correctly decoded; stripping off said local error detection coding and said local number from said decoded packet; transmitting said stripped packet to a second end-station over a sensitive link; decoding said first error detection code and acknowledging receipt of said packet if the first error detection code is correctly decoded.
Claim 9
Dependent Claim
52 words
A method for minimizing retransmission of packets between two end stations according to claim 6, further comprising the step of: retransmitting said packet from said first end station to said relay station when said first end station does not receive an acknowledgement within a predetermined period of time after transmitting said packet.
Claim 10
Dependent Claim
21 words
A method for minimizing retransmission of packets between two end stations according to claim 6, wherein said acknowledgements use said numbering.
Claim 11
Independent Claim
185 words
A method for minimizing retransmission of packets between two end stations over a plurality of links and a plurality of intermediate relay stations, comprising the steps of: dividing information into numbered packets; error detection coding said packets using a first code at a first end station; transmitting said packets to a second end station over a plurality of links connected by a plurality of intermediate relay stations, wherein each relay station adds a different local error detection coding and numbering to the received packet, and each relay station decodes a local error detection code and strips off the decoded error detection code from the received packet and sends an acknowledgement to the relay station which last sent the packet when the local detection code is correctly decoded for only packets received over a non-sensitive link; decoding local error detection codes of said packet and acknowledging receipt to the appropriate relay station when the local error detection code is correctly decoded; and decoding said first error detection code and sending an acknowledgement to said first end station when the first error detection code is correctly decoded.
Claim 12
Independent Claim
185 words
A method for minimizing retransmission of packets between two end stations over a plurality of links and a plurality of intermediate relay stations, comprising the steps of: dividing information into numbered packets; error detection coding said packets using a first code at a first end station; transmitting said packets to a second end station over a plurality of links connected by a plurality of intermediate relay stations, wherein each relay station adds a different local error detection coding and numbering to the received packet, and each relay station decodes a local error detection code and strips off the decoded error detection code from the received packet and sends an acknowledgement to the relay station which last sent the packet when the local detection code is correctly decoded for only packets received over a non-sensitive link; decoding local error detection codes of said packet and acknowledging receipt to the appropriate relay station when the local error detection code is correctly decoded; and decoding said first error detection code and sending an acknowledgement to said first end station when the first error detection code is correctly decoded.
Claim 13
Dependent Claim
53 words
A method for minimizing retransmissions of packets between two end stations according to claim 9, further comprising the step of: retransmitting said packet from one of said relay stations to said second end station when said relay station does not receive an acknowledgement within a predetermined period of time after transmitting said packet.
Claim 14
Dependent Claim
48 words
A method for minimizing retransmissions of packets between two end stations according to claim 9, further comprising the step of: retransmitting said packet from said first end station when said first end station does not receive an acknowledgement within a predetermined period of time after transmitting said packet.
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-12-15 | 2001-06-16 | 2001-12-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-12-15 | 2005-06-16 | 2005-12-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-12-15 | 2009-06-16 | 2009-12-16 | $7700.00 | Window Closed / Lapsed |