Timestamp repair mechanism in case of decompression failure

Patent metadata

Field	Value
Publication number	US-10037240-B2
Application number	US-201514864685-A
Country	US
Kind code	B2
Filing date	Sep 24, 2015
Priority date	Sep 24, 2015
Publication date	Jul 31, 2018
Grant date	Jul 31, 2018

Abstract

Methods, systems, and devices may implement a header repair mechanism to deal with a loss of successive compressed headers (e.g., due to radio interface). The present methods and apparatus exploit the fact that once a correct timestamp (TS) from a previous decompression success (called “last successfully decomp_TS”) is known, another (e.g., a subsequent) TS should be in the form: last successfully decomp_TS+n*min_TS_STRIDE, where n is a positive integer if the estimated sequence number (SN) is higher than the last successfully decompressed SN, and a negative integer if the estimated SN is lower than the last successfully decompressed SN, and min_TS_STRIDE is the expected minimum TS increment, which is known and directly related to the medium sample rate and frame rate, for example.

First claim

What is claimed is:

1. A method of wireless communication performed by a wireless communication device, comprising:
achieving synchronization with a base station via received uncompressed headers and subsequently receiving, by a receiver of the wireless communication device, a compressed header;
determining that a decompression failure has occurred for the received compressed header;
determining that a decompressed timestamp (TS) associated with the decompression failure is outside of a predetermined interpretation interval; and
attempting to repair the decompressed TS based at least in part on the determination that the decompressed TS is outside of the predetermined interpretation interval so as to maintain synchronization with the base station.

2. The method of claim 1 , wherein determining that the decompressed TS is outside of the predetermined interpretation interval comprises:
determining that the decompressed TS is outside of the predetermined interpretation interval based at least on a TS value of a most recent successfully decompressed header and a number of bits in the received compressed header for a compressed unscaled TS value.

3. The method of claim 1 , wherein determining that the decompressed TS is outside of the predetermined interpretation interval comprises:
determining that the decompressed TS conforms to a predetermined format.

4. The method of claim 3 , wherein determining that the decompressed TS conforms to the predetermined format comprises:
determining that the decompressed TS is equal to a last successfully decompressed TS plus an integer multiple of a minimum TS unit (TS_STRIDE).

5. The method of claim 4 , wherein
the integer multiple of the minimum TS_STRIDE is a positive or negative integer times the minimum TS_STRIDE.

6. The method of claim 1 , wherein attempting to repair the decompressed TS comprises:
obtaining a first candidate TS that conforms to a predetermined format and has least significant bits that match those associated with the received compressed header.

7. The method of claim 6 , wherein obtaining the first candidate TS that conforms to the predetermined format comprises:
obtaining the first candidate TS equal to a last successfully decompressed TS plus an integer multiple of a minimum TS unit (TS_STRIDE).

8. The method of claim 7 , wherein
the integer multiple of the minimum TS_STRIDE is a positive or negative integer times the minimum TS_STRIDE.

9. The method of claim 6 , further comprising:
attempting to decompress the received compressed header using the first candidate TS.

10. The method of claim 9 , further comprising:
determining a successful decompression of the received compressed header using the first candidate TS; and
updating a last successfully decompressed TS with the first candidate TS.

11. The method of claim 10 , wherein determining the successful decompression of the received compressed header using the first candidate TS comprises:
determining that a cyclic redundancy check (CRC) of at least the received compressed header using the first candidate TS is satisfied.

12. The method of claim 9 , further comprising:
determining an unsuccessful decompression of the received compressed header using the first candidate TS;
determining that no other candidate TSs exist that conform to the predetermined format and have least significant bits that match those associated with the received compressed header or a threshold number of repair attempts have been satisfied; and
transmitting a negative acknowledgement (NACK) in response to receiving the compressed header.

13. The method of claim 9 , further comprising:
determining an unsuccessful decompression of the received compressed header using the first candidate TS;
obtaining a second candidate TS that conforms to the predetermined format and has least significant bits that match those associated with the received compressed header; and
attempting to decompress the received compressed header using the second candidate TS.

14. The method of claim 13 , further comprising:
determining a successful decompression of the received compressed header using the second candidate TS; and
updating a last successfully decompressed TS with the second candidate TS.

15. An apparatus for wireless communication comprising:
means for achieving synchronization with a base station via received uncompressed headers;
means for receiving a compressed header after achieving synchronization;
means for determining that a decompression failure has occurred for the received compressed header;
means for determining that a decompressed timestamp (TS) associated with the decompression failure is outside of a predetermined interpretation interval; and
means for attempting to repair the decompressed TS based at least in part on the determination that the decompressed TS is outside of the predetermined interpretation interval so as to maintain synchronization with the base station.

16. The apparatus of claim 15 , wherein the means for determining that the decompressed TS is outside of the predetermined interpretation interval comprises:
means for determining that the decompressed TS is outside of the predetermined interpretation interval based at least on a TS value of a most recent successfully decompressed header and a number of bits in the received compressed header for a compressed unscaled TS value.

17. The apparatus of claim 15 , wherein the means for determining that the decompressed TS is outside of the predetermined interpretation interval comprises:
means for determining that the decompressed TS conforms to a predetermined format.

18. The apparatus of claim 17 , wherein the means for determining that the decompressed TS conforms to the predetermined format comprises:
means for determining that the decompressed TS is equal to a last successfully decompressed TS plus an integer multiple of a minimum TS unit (TS_STRIDE).

19. The apparatus of claim 18 , wherein
the integer multiple of the minimum TS_STRIDE is a positive or negative integer times the minimum TS_STRIDE.

20. The apparatus of claim 15 , wherein the means for attempting to repair the decompressed TS comprises:
means for obtaining a first candidate TS that conforms to a predetermined format and has least significant bits that match those associated with the received compressed header.

21. The apparatus of claim 20 , wherein the means for obtaining the first candidate TS that conforms to the predetermined format comprises:
means for obtaining the first candidate TS equal to a last successfully decompressed TS plus an integer multiple of a minimum TS unit (TS_STRIDE).

22. The apparatus of claim 21 , wherein
the integer multiple of the minimum TS_STRIDE is a positive or negative integer times the minimum TS_STRIDE.

23. The apparatus of claim 20 , further comprising:
means for attempting to decompress the received compressed header using the first candidate TS.

24. The apparatus of claim 23 , further comprising:
means for determining a successful decompression of the received compressed header using the first candidate TS; and
means for updating a last successfully decompressed TS with the first candidate TS.

25. The apparatus of claim 24 , wherein the means for determining the successful decompression of the received compressed header using the first candidate TS comprises:
means for determining that a cyclic re

Assignees

• Qualcomm Inc

Inventors

• Bressanelli Dominique Francois
• Bathwal Saket
• Sah Deepak

Classifications

• G06F11/0709

  in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems · CPC title

• H04W8/30

  Network data restoration; {Network data reliability; Network data fault tolerance} · CPC title

• G06F11/0793 Primary

  Remedial or corrective actions (recovery from an exception in an instruction pipeline G06F9/3861; by retry G06F11/1402; for recovering from a failure of a protocol instance or entity H04L69/40) · CPC title

• H04L69/04 Primary

  Protocols for data compression, e.g. ROHC · CPC title

• H04W28/06 Primary

  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 title