Method for improved robust header compression with low signal energy

• US 20120201205A1
• Filed: 02/07/2011
• Published: 08/09/2012
• Est. Priority Date: 02/07/2011
• Status: Active Grant

• Current Assignee: Alcatel-Lucent SA (Nokia Corporation)
• Original Assignee: Alcatel-Lucent SA (Nokia Corporation)
• Inventors: Gopalakrishnan, Nandu, Rao, Anil M., Seymour, James Paul
• Granted Patent: US 8,730,885 B2
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04L 1/1816 with retransmission of the same, encoded, message
• CPC Class Codes: H04L 1/1887 Scheduling and prioritising arrangements
• CPC Class Codes: H04L 65/1016 IP multimedia subsystem [IMS]
• CPC Class Codes: H04L 65/70 Media network packetisation
• CPC Class Codes: H04L 69/04 Protocols for data compression, e.g. ROHC
• CPC Class Codes: H04W 28/06 Optimizing the usage of the radio link, e.g. header compression, information sizing , discarding information system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365
• CPC Class Codes: H04W 72/00 Local resource management

Abstract

A method is provided a wireless system for reliably transmitting context information in robust header compression at low signal energies. More particularly, the methodology of the invention provides an elongated virtual Transmission Time Interval (Super TTI) for the first few (in particular, the first) non-compressed packet (that includes upper layer headers) of a packet stream transmitted using ROHC compression. Improved reception reliability for the uncompressed packet, in particular to decode the headers, results by application to the Super TTI of a combination of TTI Bundling techniques, RLC segmentation and association with multiple HARQ processes and use of enough HARQ rounds.

Claims

1. A method for packet transmission in a wireless communication system comprising:

dividing a packet offered for transmission into Q equal portions; and

for each portion, scheduling transmission over multiple transmission time intervals.

2. The method of claim 1 wherein the multiple transmission time intervals are contiguous in time.

3. The method of claim 1 wherein, upon a successful decoding of all portions of a divided packet, the dividing step is ended.

4. The method of claim 3 wherein upon successful decoding of all portions of the divided packet, a context is provided for ROHC compression of subsequently offered packets.

5. The method of claim 3 wherein packets offered for transmission subsequent to the successful decoding of all portions of the divided packet are compressed using ROHC compression.

6. The method of claim 3 wherein upon successful decoding of all portions of the divided packet, one or more packets waiting in a transmission queue are scheduled together and acknowledged as having been received regardless of an actual outcome of reception/decoding.

7. The method of claim 3 wherein upon successful decoding of all portions of the divided packet, one or more packets waiting in a transmission queue are discarded prior to transmission based on expiry of a timer.

8. The method of claim 1 where a total transmission time over multiple transmission intervals exceeds a limit necessary for stable transmission queues.

9. The method of claim 1 wherein a counter is implemented to maintain a count of packets offered for transmission.

10. The method of claim 9 wherein, upon completion of the multiple transmission time intervals for each of the Q packet portions, if at least one of the packet portions has not been decoded successfully, a value of the counter is checked and, if that value is less than a predetermined maximum value, the method returns to the dividing step for a next packet waiting in a transmission queue.

11. The method of claim 10 wherein, if, upon completion of the multiple transmission time intervals for each of the Q packet portions, all packet portions have been decoded successfully, implementing ROHC compression for subsequent packets offered for transmission.

12. The method of claim 1 wherein the dividing step is implemented by dividing the offered packet size by Q and adding an overhead factor to each of the fractional packet increments so determined.

13. The method of claim 12 wherein a scheduling grant is issued by a serving base station for each of the Q packet portions.

14. The method of claim 12 wherein packets offered for transmission are provided from a voice over internet protocol (VoIP) application in an IP multimedia subsystem (IMS) network architecture.

15. The method of claim 14 wherein the IMS network architecture is implemented with Long Term Evolution (LTE) radio technology.

16. A method for packet transmission in a wireless communication system comprising:

receiving at a mobile station scheduling grants for a number Q of HARQ interlaces over multiple transmission time intervals;

segmenting an initial packet offered for transmission at the base station into Q equal fractional segments, wherein each segment is scheduled on its own HARQ interlace in successive transmission time intervals;

upon completion of L HARQ rounds for each of the Q packet segments, if any segment has not been successfully decoded, returning to the segmenting step with a next packet waiting in the base station'"'"'s transmission queue;

if all of the Q packet segments have been successfully decoded using no more than L HARQ rounds each, implementing ROHC compression for subsequent packets offered for transmission;

upon successful decoding of all packet segments for a given offered packet, discarding one or more stale packets waiting in a transmission queue; and

continuing to transmit remaining packets offered for transmission based on ROHC compression.

17. The method of claim 16 wherein the step of discarding stale packets is implemented by receiving a scheduling grant for the one or more stale packets, and upon transmission of the one or more stale packets, receiving a signal acknowledging receipt and decoding thereof regardless of an actual outcome of reception/decoding.

18. The method of claim 16 wherein the step of discarding stale packets is implemented by discarding the one or more stale packets based on expiry of a timer.

19. The method of claim 16 wherein the segmenting step is implemented by dividing the offered packet size by Q and adding an overhead factor to each of the fractional packet segments so determined.