WO2012083842A1 - 一种解压的方法及装置 - Google Patents

一种解压的方法及装置 Download PDF

Info

Publication number
WO2012083842A1
WO2012083842A1 PCT/CN2011/084293 CN2011084293W WO2012083842A1 WO 2012083842 A1 WO2012083842 A1 WO 2012083842A1 CN 2011084293 W CN2011084293 W CN 2011084293W WO 2012083842 A1 WO2012083842 A1 WO 2012083842A1
Authority
WO
WIPO (PCT)
Prior art keywords
data packet
sequence number
time
serial number
cached
Prior art date
Application number
PCT/CN2011/084293
Other languages
English (en)
French (fr)
Inventor
张忞琦
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP11852175.6A priority Critical patent/EP2637379B1/en
Priority to KR1020137015990A priority patent/KR101471482B1/ko
Publication of WO2012083842A1 publication Critical patent/WO2012083842A1/zh
Priority to US13/922,496 priority patent/US9350592B2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/28—Timers or timing mechanisms used in protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/04—Protocols for data compression, e.g. ROHC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5603—Access techniques

Definitions

  • the present invention claims the priority of the Chinese patent application filed on December 20, 2010, the Chinese Patent Application No. 201010602775.8, entitled “A Method and Apparatus for Decompression", the entire contents of which is hereby incorporated by reference. This is incorporated herein by reference.
  • the present invention relates to the field of wireless communication technologies, and in particular, to a method and an apparatus for decompressing.
  • RObust Header Compression is a mechanism for compressing various ten-headed headers to save transmission resources.
  • the sequence number (Sn) in the protocol header of each data packet is incrementally changed, so that only a few fields of the Sn of the adjacent data packet are different.
  • the compressor of the transmitting end Rohc compresses the Sn of a certain data packet, it compresses and encodes a part of the different data in the Sn of the adjacent data packet to obtain a Sn compressed code of the data packet, and the data packet is compressed.
  • the Sn compression code is sent to the receiving end.
  • the decompressor of the receiving end Rohc receives the Sn compression code of the data packet, and decompresses the Sn compression code of the data packet to obtain Sn of the data packet.
  • the Sn of the decompressed data packet is inconsistent with its original Sn, thereby reducing the accuracy of Sn of the decompressed data packet.
  • a method of decompressing comprising:
  • the cached reference sequence number is the sequence number of the most recently decompressed successful data packet, and the reference time is the received time of the compressed data packet and the data packet is the last successfully decompressed data packet.
  • a device for decompressing comprising:
  • a decompression module configured to receive the compressed data packet, and decompress the compressed data packet serial number compression code
  • An obtaining module configured to: when the decompression module fails to decompress the sequence number of the data packet due to the continuous loss of the packet, according to the received time of the compressed data packet, the cached reference sequence number, the reference time, and The time interval of the unit serial number is obtained, and a new reference serial number is obtained;
  • a re-decompression module configured to re-decompress the serial number compression code of the data packet according to the new reference sequence number obtained by the acquiring module, to obtain a sequence number of the data packet;
  • the cached reference sequence number is the sequence number of the most recently decompressed successful data packet, the reference time is the received time of the compressed data packet, and the data packet is the last successful decompressed data packet.
  • the compressed data packet sequence number compression code By receiving the compressed data packet, decompressing the compressed data packet sequence number compression code, if the packet is successfully decompressed due to continuous packet loss, according to the received time of the compressed data packet, the cached reference sequence number, and the reference time After the time interval with the unit serial number, a new reference sequence number is obtained, and the serial number compression code of the data packet is re-decompressed according to the new reference sequence number.
  • the obtained new reference sequence number is located in the same coding interval as the original sequence number of the data packet, so that the decompressed sequence number of the data packet and its original sequence The number is consistent, thereby improving the accuracy of the serial number of the decompressed data packet.
  • Embodiment 1 is a flow chart of a method for decompressing according to Embodiment 1 of the present invention
  • FIG. 2 is a flowchart of compressing Sn of a data packet by a compressor provided by Embodiment 2 of the present invention
  • FIG. 3 is a flowchart of another method for decompressing provided by Embodiment 2 of the present invention
  • Embodiment 4 is a schematic diagram of a device for decompressing provided in Embodiment 3 of the present invention.
  • FIG. An embodiment All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without departing from the inventive scope are the scope of the present invention.
  • the compressor of the transmitting end Rohc When the compressor of the transmitting end Rohc receives the data packet, the data packet is first compressed, and in the process of compression, the Sn of the data packet is also compression-coded to obtain a Sn compression code, where the compressed data packet is compressed. The Sn compression code of the data packet is included, and then the compressed data packet is sent to the receiving end.
  • the decompressor of the receiving end Rohc receives the compressed data packet sent by the compressor, and decompresses the Sn compression code of the data packet by using the decompression method provided by the present invention for the Sn compression code of the data packet in the compressed data packet. Specifically, the Sn of the last decompressed successful data packet is used as the reference Sn, and then the Sn compression code of the data packet is decompressed according to the reference Sn, and the Sn of the data packet is decompressed. For convenience of description, the Sn of the data packet before compression is referred to as the original Sn of the data packet.
  • the Sn of the decompressed data packet and its original Sn are If the original Sn of the data packet is in a different coding interval from the reference Sn, the Sn of the decompressed data packet is inconsistent with the original Sn, that is, the decompression fails.
  • the decompressor After the decompressor receives the data packet that has been successfully decompressed last time and before receiving the data packet, the compressed data packet continuously sent by the compressor is not received, that is, the decompressor continuously loses the data packet. phenomenon. When the decompressor has continuously lost the data packet, it may be that the original Sn of the data packet is in a different coding interval from the reference Sn, and the decompression fails. At this time, the decompressor needs to repair the Sn of the data packet to obtain the Sn of the data packet.
  • an embodiment of the present invention provides a method for decompressing, including:
  • Step 101 Receive the compressed data packet, and decompress the compressed data packet serial number compression code.
  • Step 102 When the sequence number of the data packet is not successfully decompressed due to the continuous loss of the packet, according to the received time of the compressed data packet, the reference sequence number of the buffer, the reference time, and the time interval of the unit serial number, a new one is obtained. Reference serial number.
  • Step 103 Re-decompress the serial number compression code of the data packet according to the new reference sequence number to obtain a sequence number of the data packet.
  • the cached reference sequence number is the sequence number of the last successfully decompressed data packet, and the reference time is the received time of the compressed data packet, and the data packet is the last successful decompressed data packet.
  • the compressed data packet sequence number compression code is decompressed by receiving the compressed data packet, and if the packet is successfully decompressed due to continuous packet loss, according to the received time of the compressed data packet, the cache The reference sequence number, the reference time, and the time interval of the unit serial number are obtained, a new reference sequence number is obtained, and the serial number compression code of the data packet is decompressed according to the new reference sequence number.
  • the obtained new reference sequence number is located in the same coding interval as the original sequence number of the data packet, so that the decompressed sequence number of the data packet and its original sequence The number is consistent, thereby improving the accuracy of the serial number of the decompressed data packet.
  • Another embodiment of the present invention provides a method of decompressing.
  • the compressor receives the data packet
  • the data packet is compressed, and the Sn of the data packet is compression-encoded in the process of compression to obtain the Sn compression code of the data packet, and compressed to obtain
  • the data packet includes a Sn compression code of the data packet, and then the compressed data packet is sent to the decompressor, and the decompressor receives the compressed data packet, and the compressed data packet is included in the compressed data packet by using the decompression method provided in this embodiment.
  • the Sn compression code of the data packet is decompressed, and when the decompressor fails to decompress the Sn of the data packet due to the continuous loss of the data packet, the Sn of the data packet can also be repaired.
  • the compressor when the compressor receives the data packet, the compressor compresses and encodes the Sn of the data packet in the process of compressing the data packet, and obtains the Sn compressed code of the data packet.
  • the compressor compresses the Sn of the data packet during the process of compressing the data packet.
  • the code flow is divided into the following steps 201-205, including:
  • Step 201 Receive a data packet, and obtain a Cyclic Redundancy Check (CRC) code of the data packet according to Sn of the data packet.
  • CRC Cyclic Redundancy Check
  • the Sn of the data packet received by the compressor is 101
  • the binary code of Sn of the data packet is "1100101”.
  • the CRC code of the data packet is obtained as "CRC1”.
  • Step 202 Calculate the Sn of the data packet and the first Sn of the most recently received data packet
  • the Sn difference value obtains the number of compressed bits according to the first Sn difference value.
  • the operation of obtaining the compressed bit number according to the first Sn difference value may include: counting the first Sn difference value including the number of the bit bits, and using the counted number as the compressed bit number.
  • the Sn of the most recently received data packet is cached by the compressor in advance.
  • the Sn difference is "2", where the binary code of the first Sn difference value "2" is "10", and the number of bits included in the first Sn difference value "2" is 2, and the number of statistics will be counted. As the number of compressed bits.
  • Step 203 Update Sn of the cached most recently received data packet to Sn of the data packet. For example, updating Sn "99" of the most recently received packet of the cache to the packet
  • Step 204 Select, from the bits included in the Sn of the data packet, a low compression bit number bit, and use the selected bit as the Sn compression code of the data packet.
  • the low compression bit number bits are selected, that is, the lower 2 bits “01” are selected, and the selected bit “01” is selected as The Sn compression code of the packet.
  • steps 203 and 204 are in no particular order, and may also be performed simultaneously.
  • the compression bit of 2 is the length of the coding interval, if two packets are
  • the Sns of the two data packets are considered to be in the same coding interval. For example, if the number of compressed bits is 2, the length of the corresponding coding interval is 4, wherein the difference between the Sn "101" of the data packet and the Sn "99" of the most recently received data packet is 2, so The Sn of the data packet is located in the same coding interval as the Sn of the most recently received data packet.
  • the compressor compresses the data packet, and the compressed data packet includes the data packet.
  • Step 205 Send the compressed data packet to the decompressor, and the compressed data packet includes a Sn compression code of the data packet and a CRC code of the data packet.
  • the decompressor receives the compressed data packet sent by the compressor, and uses the decompression method provided by the embodiment to apply the data packet to the compressed code of the data packet in the compressed data packet and the CRC code of the data packet.
  • the Sn compression code is decompressed. Referring to FIG. 3, the decompressor decompresses the Sn compression code of the received data packet into the following steps 301-310, including:
  • Step 301 Receive a compressed data packet sent by the compressor, and include the Sn compression code of the data packet and the CRC code of the data packet in the compressed data packet, and obtain a receiving time of the compressed data packet.
  • the Sn compression code of the data packet sent by the receiving compressor is "01" and the CRC code is
  • Step 302 Decode the Sn compression code of the data packet according to the buffered reference Sn, and obtain the Sn of the data packet, and obtain the CRC code of the data packet according to the Sn of the data packet.
  • the number of compressed bits is determined according to the number of bits included in the Sn compression code of the data packet, and the length of the coding interval is calculated according to the number of compressed bits, and the reference Sn of the cache is used as a starting point and the reference Sn of the buffer is determined.
  • the difference between the Sn and the length of the coding interval is smaller than the low compression bit number of the buffered reference Sn and the determined low compression bit number of each Sn.
  • the same Sn is matched, wherein the matched Sn is the decompressed Sn of the data packet, and the CRC code is obtained according to the decompressed Sn of the data packet.
  • the difference between the determined Sn and the buffered reference Sn is smaller than the length of the coding interval, so each of the determined Sn is located in the same coding interval as the reference Sn of the buffer, and the buffered reference Sn is the latest decompression of the decompressor.
  • the decompressor also buffers the reference time and the interval time of the unit Sn, and the reference time is the time of receiving the last successful decompression of the data packet. It is assumed that in the present embodiment, the reference time of the cache is "354 seconds", and the interval time of the unit Sn is "2 seconds".
  • the unit Sn is the difference between two adjacent Sns, for example, Sn m+1 is two adjacent Sns, and the unit Sn is a difference between Sn m+1 and Sn.
  • the last decompressed packet of the decompressor buffer has a Sn of "87", that is, the cached reference Sn is "87", and its binary code is "1010111", according to the Sn compression code "01" of the packet.
  • determining that the number of compressed bits is 2 wherein the number of compressed bits of 2 is the number of The length of the code interval, so the length of the coding interval is calculated according to the number of compressed bits 2, so that the buffer reference Sn "87” is used as the starting point to determine the reference of Sn "88", "89” and "90” with the cache.
  • the difference of Sn "87” is smaller than the length 4 of the encoding interval, wherein the buffered reference Sn “87” and the determined Sn “88", “89” and “90” are in the same coding interval, and "88"
  • the binary codes of "89” and “90” are "1011000”, “1011001” and “1011010”respectively; the cached reference Sn “87” and the identified Sn “88", “89” and “90” are included.
  • the lower 2 bits are "11", “00", “01” and “10”, respectively, and the Sn compression code "01" of the packet is respectively associated with the cached reference Sn "87” and the determined Sn".
  • Step 303 Comparing the received CRC code of the data packet with the obtained CRC code of the data packet, if the two are the same, the decompression is successful, and step 304 is performed; if the two are not the same, the decompression fails, and step 305 is performed. .
  • the CRC code is obtained according to Sn. If the CRC codes of the two Sns are different, the two Sns are different.
  • step 305 is performed.
  • Step 304 Calculate the interval time of the unit Sn, and update the interval time of the buffered reference Sn, the reference time, and the unit Sn to the Sn of the data packet, the receiving time of the compressed data packet, and the interval time of the calculated unit Sn. End.
  • the operation of calculating the interval time of the unit Sn is specifically: calculating a first time difference between the received time of the compressed data packet and the reference time, and calculating the second Sn difference between the decompressed Sn of the data packet and the buffered reference Sn
  • the value calculates the time interval of the unit Sn according to the calculated first time difference and the second Sn difference.
  • Step 305 Calculate a second time difference between the received time of the compressed data packet and the reference time.
  • the compressed packet receives 400 seconds and the reference time is 354 seconds.
  • the second time difference between the received time of the compressed packet and the reference time is 46.
  • Step 306 Determine, according to the second time difference, the time interval between the buffered reference Sn and the unit Sn, whether the reason for the unsuccessful decompression is that the decompressor continuously loses a large number of packets, and if yes, step 307 is performed. Specifically, calculating a third Sn difference of the decompressed Sn of the data packet and the buffered reference Sn, and calculating a third time difference according to a time interval between the third Sn difference value and the unit Sn, if the second time difference and the third time difference If the difference exceeds the preset threshold, it is judged that the reason for the decompression failure is that the decompressor continuously loses a large number of packets.
  • the preset threshold is 20.
  • the third Sn difference is calculated to be 2
  • the third interval is calculated according to the third Sn difference value 2 and the unit Sn interval 2
  • the three time difference is 4, wherein the difference between the second time difference 46 and the third time difference 4 exceeds a preset threshold value 20, and it is determined that the decompressor does not receive the compressor in the period from the 354th to the 400th second.
  • a large number of data packets are continuously sent, that is, the decompressor has a continuous loss of data packets.
  • the preset threshold is an empirical value obtained according to an experiment.
  • Step 307 Calculate the Sn increment value according to the calculated time difference between the second time difference and the unit Sn.
  • the second time difference calculated and the time interval of the unit Sn are divided to obtain a Sn increment value.
  • a division operation is performed on the calculated second time difference 46 and the time interval 2 of the unit Sn to obtain a Sn increment value of 23.
  • Step 308 Calculate a new reference according to the cached reference Sn and the calculated Sn increment value.
  • the buffered reference Sn and the calculated Sn increment value are added to obtain a new reference Sn.
  • the cached reference Sn "87” and the calculated Sn increment value "23" are added to obtain a new reference Sn of "100", wherein the new reference Sn "100” has a binary code of "1100100”. "
  • the new reference Sn obtained in this step is located in the same coding interval as the original Sn of the data packet.
  • Step 309 According to the new reference Sn, the Sn compression code of the data packet is decompressed again to obtain Sn of the data packet.
  • the Sn compression code of the data packet is respectively associated with each of the coding intervals in which the new reference Sn is located.
  • the low compression bit number of bits of Sn is matched to match the same Sn.
  • the matched Sn is the Sn of the re-decompressed data packet.
  • the length of the coding interval is 4, and according to the length 4 of the coding interval, it is determined that the new reference Sn "100" is the starting point and the difference from the new reference Sn "100” is smaller than the length of the coding interval.
  • the Sn of 4 is "101", “102” and "103", respectively, wherein the new reference Sn "100” and the determined “101", “102” and “103” are in the same coding interval, and " The binary codes for 101", “102” and “103” are "1100101", “1100110” and “1100111” respectively; the new reference Sn "100” and the identified Sn "101", "102” and “103” The lower 2 bits included are “00", "01", “10", and "11", respectively.
  • the Sn compression code "01” is matched with the lower 2 bits included in the four Sns in the coding interval in which the new reference Sn "100” is located, and the same Sn "101” is matched, and the matched Sn” will be matched. 101" as the Sn of the packet.
  • Step 310 Calculate the interval time of the unit Sn, update the interval time of the buffered reference Sn, the reference time, and the unit Sn to the re-decompressed Sn of the data packet, the reception time of the compressed data packet, and the calculated unit Sn. At the end of the time, the operation ends.
  • the operation of calculating the interval time of the unit Sn is specifically: calculating a fourth Sn difference between the Sn of the data packet and the reference Sn of the buffer, according to the second time difference and the fourth time
  • the difference in Sn is calculated as the interval time of the unit Sn.
  • the fourth Sn difference between Sn "101" and the reference Sn "87” of the re-extracted data is "24", according to the second time difference "46" and the calculated fourth Sn difference” 24", calculate the interval time of the unit Sn as "1.9167 seconds,,; update the buffered reference Sn "87", the reference time "354 seconds” and the interval time of the unit Sn "2 seconds” to the data that is decompressed separately.
  • the CRC code may be obtained according to the re-decompressed Sn of the data packet, and the obtained CRC code and the received CRC code of the data packet are compared. If the two are the same, the decompression is successful, if the two are different. , the re-extraction is unsuccessful, and the operation ends.
  • the decompressor receives the compressed data packet, and decompresses the compressed data packet sequence number compression code. If the packet is successfully decompressed due to continuous packet loss, according to the received time of the compressed data packet, The previously buffered reference Sn, the reference time, and the time interval of the unit Sn are used to acquire a new reference Sn, and the Sn compression code of the data packet is decompressed according to the new reference Sn.
  • an embodiment of the present invention provides a device for decompressing, including:
  • the decompression module 401 is configured to receive the compressed data packet, and decompress the compressed data packet serial number compression code.
  • the obtaining module 402 is configured to: when the decompression module 401 fails to decompress the serial number of the data packet due to the continuous loss of the packet, according to the received time of the compressed data packet, the cached reference sequence number, the reference time, and the unit serial number At intervals, get a new reference serial number.
  • the re-decompression module 403 is configured to re-decompress the serial number compression code of the data packet according to the new reference sequence number acquired by the obtaining module 402, to obtain the sequence number of the data packet.
  • the cached reference sequence number is the sequence number of the most recently decompressed successful data packet, and the reference time is the received time of the compressed data packet, and the data packet is the last successfully decompressed data packet.
  • the obtaining module 402 is configured to calculate a time difference between the received time of the compressed data packet and the reference time; calculate the serial number increment value according to the calculated time difference and the interval time of the unit serial number; according to the reference serial number and the serial number Incremental value, the new reference serial number is calculated.
  • the device further includes:
  • a first updating module configured to obtain, according to the calculated time difference, the sequence number of the data packet, and the reference sequence number, the time interval of the unit serial number; and update the interval time of the buffered unit serial number to the time interval of obtaining the unit serial number.
  • the first update module is specifically configured to calculate a sequence number difference according to the sequence number and the reference sequence number of the data packet; and calculate a time interval of the unit sequence number according to the calculated time difference and the calculated sequence number difference value; The time interval of the cached unit serial number is updated to the time interval of the obtained unit serial number.
  • the device further includes:
  • the second update module is configured to update the cached reference sequence number to the sequence number of the data packet, and update the reference time to the receiving time of the compressed data packet.
  • the compressed data packet sequence number compression code is decompressed by receiving the compressed data packet, and if the packet is successfully decompressed due to continuous packet loss, according to the received time of the compressed data packet, the cache When the reference serial number, reference time, and unit serial number are separated In between, obtain a new reference sequence number, and decompress the serial number compression code of the data packet according to the new reference sequence number.
  • the obtained new reference sequence number is located in the same coding interval as the original sequence number of the data packet, so that the decompressed sequence number of the data packet and its original sequence The number is consistent, thereby improving the accuracy of the serial number of the decompressed data packet.
  • the decompression device of the foregoing embodiment when the serial number compression code of the data packet is decompressed, only the division of the above functional modules is illustrated. In practical applications, the foregoing function may be allocated according to requirements. It is completed by different functional modules, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.
  • the foregoing embodiment provides a decompression device and the decompression method embodiment are the same concept, and the specific implementation process is described in detail in the method embodiment, and details are not described herein again.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)

Description

一种解压的方法及装置 本申请要求于 2010 年 12 月 20 日提交中国专利局、 申请号为 201010602775.8、发明名称为 "一种解压的方法及装置"的中国专利申请的优 先权， 其全部内容通过引用结合在本申请中。 技术领域 本发明涉及无线通讯技术领域， 具体涉及一种一种解压的方法及装置。
背景技术 头压缩（ RObust Header Compression, Rohc )是一种对各种十办议头进行 压缩从而达到节省传输资源的机制。 其中， 发送端在连续发送数据包时， 每个数据包的协议头中的序列号 （ Series number, Sn )是递增变化的， 因 而， 使得相邻的数据包的 Sn中只有少数字段不相同。 发送端 Rohc的压缩 器在对某个数据包的 Sn进行压缩时， 对与其相邻数据包的 Sn中部分不同 的字段进行压缩编码， 得到该数据包的 Sn压缩码， 并将该数据包的 Sn压 缩码发送给接收端。
接收端 Rohc的解压器接收该数据包的 Sn压缩码， 并对该数据包的 Sn 压缩码进行解压， 从而得到该数据包的 Sn。 当连续丟失的数据包过多时， 使得解压出的数据包的 Sn与其原 Sn不一致，从而降低解压数据包的 Sn的 准确性。 发明内容 本发明提供了一种解压的方法及装置， 能够提高解压缩数据包的序列 号的正确性。
一方面， 提供了一种解压的方法， 所述方法包括：
接收压缩后的数据包， 对所述压缩后的数据包序列号压缩码进行解压； 当因连续丟失包而未成功解压出所述数据包的序列号时， 根据所述压 缩后的数据包的接收时间、 緩存的参考序列号、 参考时间和单位序列号的 相隔时间， 获取新的参考序列号；
根据所述新的参考序列号对所述数据包的序列号压缩码进行重新解 压， 得到所述数据包的序列号；
其中， 所述緩存的参考序列号为最近一次解压成功数据包的序列号， 所述参考时间为压缩后的数据包的接收时间且所述数据包为最近一次解压 成功的数据包。
另一方面， 提供了一种解压的装置， 所述装置包括：
解压模块， 用于接收压缩后的数据包， 对所述压缩后的数据包序列号 压缩码进行解压；
获取模块， 用于当因连续丟失包而使所述解压模块未成功解压出所述 数据包的序列号时， 根据所述压缩后的数据包的接收时间、 緩存的参考序 列号、 参考时间和单位序列号的相隔时间， 获取新的参考序列号；
重新解压模块， 用于根据所述获取模块获取的新的参考序列号对所述 数据包的序列号压缩码进行重新解压， 得到所述数据包的序列号；
其中， 所述緩存的参考序列号为最近一次解压成功数据包的序列号， 所述参考时间为压缩后的数据包的接收时间， 且所述数据包为最近一次解 压成功的数据包。
通过接收压缩后的数据包， 对压缩后的数据包序列号压缩码进行解压， 如果因连续丟失包而未解压成功， 则根据压缩后的数据包的接收时间、 緩 存的参考序列号、 参考时间和单位序列号的相隔时间， 获取新的参考序列 号， 根据新的参考序列号对数据包的序列号压缩码进行重新解压。 其中， 即使解压器连续丟失的过多的数据包时， 获取的新的参考序列号与该数据 包的原序列号还位于相同的编码区间， 使得解压出的该数据包的序列号与 其原序列号一致， 从而提高解压数据包的序列号的准确性。
附图说明 为了更清楚地说明本发明实施例中的技术方案， 下面将对实施例描述 中所需要使用的附图作简要介绍， 显而易见地， 下面描述中的附图仅仅是 本发明的一些实施例， 对于本领域的普通技术人员来讲， 在不付出创造性 劳动性的前提下， 还可以根据这些附图获得其他的附图。
图 1是本发明实施例 1提供的一种解压的方法流程图；
图 2是本发明实施例 2提供的压缩器对数据包的 Sn进行压缩的流程图； 图 3是本发明实施例 2提供的另一种解压的方法流程图；
图 4是本发明实施例 3提供的一种解压的装置示意图。
具体实施方式 为了使本发明的目的、 技术方案和优点更加清楚， 下面将结合附图对 本发明作进一步地详细描述， 显然， 所描述的实施例仅仅是本发明一部份 实施例， 而不是全部的实施例。 基于本发明中的实施例， 本领域普通技术 人员在没有做出创造性劳动前提下所获得的所有其它实施例， 都属于本发 明保护的范围。
当发送端 Rohc的压缩器接收到数据包时， 先对该数据包进行压缩， 且 在压缩的过程中也对该数据包的 Sn进行压缩编码得到 Sn压缩码， 其中， 压缩后的该数据包中包括该数据包的 Sn压缩码， 然后再将压缩后的数据包 发送给接收端。
接收端 Rohc的解压器接收压缩器发送的压缩后的数据包，针对压缩后 的数据包中的该数据包的 Sn压缩码， 利用本发明提供的解压方法对该数据 包的 Sn压缩码进行解压， 具体为： 将最近一次解压成功数据包的 Sn作为 参考 Sn, 再根据参考 Sn对该数据包的 Sn压缩码进行解压， 解压出该数据 包的 Sn。 其中， 为了便于说明， 将压缩前的数据包的 Sn称为数据包的原 Sn, 如果该数据包的原 Sn与参考 Sn位于同一个编码区间， 则解压出的该 数据包的 Sn与其原 Sn—致， 即解压成功； 如果该数据包的原 Sn与参考 Sn位于不同的编码区间， 则解压出的该数据包的 Sn与其原 Sn不一致， 即 解压失败。
其中， 当解压器在接收最近一次解压成功的数据包之后以及在接收该 数据包之前的一段时间内， 未接收到压缩器连续发送的压缩后的数据包， 即解压器发生连续丟失数据包的现象。 当解压器发生了连续丟失数据包时 , 就可能使该数据包的原 Sn与参考 Sn位于不同的编码区间，从而解压失败， 此时解压器需要对该数据包的 Sn进行修复， 得到该数据包的 Sn。
如图 1所示， 本发明实施例提供了一种解压的方法， 包括：
步骤 101 : 接收压缩后的数据包， 对压缩后的数据包序列号压缩码进行 解压。
步骤 102: 当因连续丟失包而未成功解压出该数据包的序列号时，根据 压缩后的数据包的接收时间、 緩存的参考序列号、 参考时间和单位序列号 的相隔时间， 获取新的参考序列号。
步骤 103:根据新的参考序列号对该数据包的序列号压缩码进行重新解 压， 得到该数据包的序列号。
其中， 緩存的参考序列号为最近一次解压成功的数据包的序列号， 参 考时间为压缩后的数据包的接收时间， 且该数据包为最近一次解压成功的 数据包。
在本发明实施例中， 通过接收压缩后的数据包， 对压缩后的数据包序 列号压缩码进行解压， 如果因连续丟失包而未解压成功， 则根据压缩后的 数据包的接收时间、 緩存的参考序列号、 参考时间和单位序列号的相隔时 间， 获取新的参考序列号， 根据新的参考序列号对数据包的序列号压缩码 进行解压。 其中， 即使解压器连续丟失的过多的数据包时， 获取的新的参 考序列号与该数据包的原序列号还位于相同的编码区间， 使得解压出的该 数据包的序列号与其原序列号一致， 从而提高解压数据包的序列号的准确 性。 本发明实施例提供了另一种解压的方法。 在本实施例中， 当压缩器接 收到数据包时， 对该数据包进行压缩， 且在压缩的过程中对该数据包的 Sn 进行压缩编码得到该数据包的 Sn压缩码， 且压缩后得到的数据包中包括该 数据包的 Sn压缩码， 然后将压缩后的数据包发送给解压器， 解压器接收压 缩后的数据包， 利用本实施例提供的解压方法对压缩后的数据包中包括该 数据包的 Sn压缩码进行解压， 当解压器因发生连续丟失数据包的原因而未 能成功地解压出该数据包的 Sn时， 还可以修复该数据包的 Sn。
首先， 在本实施例中， 压缩器当接收到数据包， 在对该数据包进行压 缩的过程中， 对该数据包的 Sn进行压缩编码， 得到的该数据包的 Sn压缩 码。 参见图 2, 压缩器在压缩数据包的过程中对该数据包的 Sn进行压缩编 码的流程分为如下的 201-205的步骤， 包括：
步骤 201 : 接收数据包， 根据该数据包的 Sn, 获取该数据包的循环冗 余校验 （ Cyclic Redundancy Check, CRC )码。
例如，假设压缩器接收的数据包的 Sn为 101 ,该数据包的 Sn的二进制 编码为 "1100101 " , 根据该数据包的 Sn " 1100101 " , 获取该数据包的 CRC 码为 "CRC1"。
步骤 202: 计算该数据包的 Sn与最近一次接收的数据包的 Sn的第一
Sn差值， 根据第一 Sn差值获取压缩比特数。
其中， 根据第一 Sn差值获取压缩比特数的操作可以包括统计第一 Sn 差值包括比特位的个数， 将统计的个数作为压缩比特数。
其中， 最近一次接收的数据包的 Sn是压缩器事先緩存的。
例如， 假设压缩器緩存最近一次接收数据包的 Sn为 "99" , 则计算接 收的该数据包的 Sn " 101" 与最近一次接收数据包的 Sn "99" 之间的第一
Sn差值为 "2" , 其中， 第一 Sn差值 "2" 的二进制编码为 " 10" , 统计第一 Sn差值 "2" 包括的比特位的个数为 2, 将统计的个数作为压缩比特数。
步骤 203:将緩存的最近一次接收的数据包的 Sn更新为该数据包的 Sn。 例如， 将緩存的最近一次接收的数据包的 Sn "99" 更新为该数据包的
Sn "101"。
步骤 204: 从该数据包的 Sn包括的比特位中， 选择低压缩比特数位个 比特位， 将选择的比特位作为该数据包的 Sn压缩码。
例如， 从该数据包的 Sn "101 " 包括的比特位 "1100101" 中， 选择低 压缩比特数位个比特位，即选择低 2位个比特位" 01" ,将选择的比特位" 01 " 作为该数据包的 Sn压缩码。
其中， 步骤 203和 204的执行顺序不分先后， 也可以同时进行。
其中， 2 的压缩比特数次方即为编码区间的长度， 如果两个数据包的
Sn的差值小于编码区间的长度，则认为该两个数据包的 Sn位于同一个编码 区间。 例如， 对于压缩比特数为 2, 则对应的编码区间的长度为 4, 其中， 该数据包的 Sn " 101"与最近一次接收的数据包的 Sn "99"之间的差值为 2, 所以该数据包的 Sn与最近一次接收的数据包的 Sn位于同一个编码区间内。
其中， 压缩器压缩完该数据包， 得到压缩后的数据包包括该数据包的
Sn压缩码和 CRC码。 步骤 205: 发送压缩后的数据包给解压器， 且压缩后的数据包中包括该 数据包的 Sn压缩码和该数据包的 CRC码。
然后， 解压器接收压缩器发送的压缩后的数据包， 针对压缩后的数据 包中的该数据包的 Sn压缩码和该数据包的 CRC码， 利用本实施例提供的 解压方法对该数据包的 Sn压缩码进行解压。 参见图 3 , 解压器对接收的数 据包的 Sn压缩码进行解压的流程分为如下 301-310的步骤， 包括：
步骤 301 : 接收压缩器发送的压缩后的数据包， 且该压缩后的数据包中 包括该数据包的 Sn压缩码和该数据包的 CRC码， 并获取压缩后的数据包 的接收时间。
例如， 接收压缩器发送的数据包的 Sn压缩码为 "01" 以及 CRC码为
"CRC1" , 以及获取压缩后的数据包的接收时间为 "400秒"， 即在时间为 第 400秒时接收该数据包的 Sn压缩码。
步骤 302: 根据緩存的参考 Sn, 对该数据包的 Sn压缩码进行解码得到 该数据包的 Sn, 根据该数据包的 Sn获取该数据包的 CRC码。
具体地， 根据该数据包的 Sn压缩码包括的比特位的数目， 确定出压缩 比特数， 根据压缩比特数计算出编码区间的长度， 确定出以緩存的参考 Sn 为起点且与緩存的参考 Sn的差值小于编码区间的长度的 Sn,将该数据包的 Sn压缩码分别与緩存的参考 Sn的低压缩比特数位个比特位以及确定的每 个 Sn的低压缩比特数位个比特位进行匹配， 匹配出相同的 Sn, 其中， 匹配 出的 Sn为解压出的该数据包的 Sn,根据解压出的该数据包的 Sn获取 CRC 码。
其中， 确定出的 Sn与緩存的参考 Sn的差值都小于编码区间的长度， 所以确定出的每个 Sn与緩存的参考 Sn位于同一个编码区间， 緩存的参考 Sn为解压器最近一次解压成功的数据包的 Sn。 另外， 解压器还緩存参考时 间以及单位 Sn的相隔时间， 参考时间为接收最近一次解压成功的数据包的 时间。 假设， 在本实施例中， 緩存的参考时间为 "354秒"， 单位 Sn的相隔 时间为 "2秒"。 其中， 单位 Sn为相邻两个 Sn的差值， 例如，
Figure imgf000008_0001
Snm+1 为相邻的两个 Sn, 单位 Sn为 Snm+1与 Sn„^ 差值。
例如， 假设解压器緩存的最近一次解压成功的数据包的 Sn为 "87" , 即緩存的参考 Sn为 "87" , 其二进制编码为 "1010111" , 根据该数据包的 Sn压缩码 "01" , 确定出压缩比特数为 2, 其中， 2的压缩比特数次方为编 码区间的长度， 所以根据压缩比特数 2计算出编码区间的长度为 4, 从而以 緩存的参考 Sn "87" 为起点， 确定 Sn "88"、 "89" 和 "90" 都与緩存的参 考 Sn "87" 的差值小于编码区间的长度 4, 其中， 緩存的参考 Sn "87" 以 及确定出的 Sn "88"、 "89"和 "90"位于同一个编码区间内，且 "88"、 "89" 和 "90" 的二进制编码分别为 " 1011000"、 "1011001" 和 " 1011010" ; 緩存 的参考 Sn "87" 以及确定出的 Sn "88"、 "89" 和 "90" 包括的低 2位个比 特位分别为 " 11 "、 "00"、 "01 " 和 "10" , 将该数据包的 Sn压缩码 "01" 分别与緩存的参考 Sn "87" 以及确定出的 Sn "88"、 "89"、 "90" 包括的低 2位个比特位进行匹配,即将该数据包的 Sn压缩码 "01 "分别与 " 11"、 "00"、 "01" 和 "10" 进行匹配， 匹配出相同的 Sn "89" , 将匹配出的 Sn "89" 作为该数据包的 Sn, 根据该数据包的 Sn "89" , 获取 CRC码为 "CRC2"。
步骤 303:对接收的该数据包的 CRC码和获取的该数据包的 CRC码进 行比较， 如果两者相同， 则解压成功， 执行步骤 304; 如果两者不相同， 则 解压失败， 执行步骤 305。
其中， CRC码是根据 Sn获取的， 如果两个 Sn的 CRC码不相同， 则该 两个 Sn不相同。
例如， 接收的该数据包的 "CRC1 " 与获取的 "CRC2" 进行比较， 比 较出两者不相同， 则解压出的该数据包的 Sn与其原 Sn不相同， 即解压失 败， 执行步骤 305。
步骤 304: 计算单位 Sn的相隔时间， 将緩存的参考 Sn、 参考时间和单 位 Sn的相隔时间更新为该数据包的 Sn、压缩后的数据包的接收时间以及计 算的单位 Sn的相隔时间， 操作结束。
其中， 计算单位 Sn的相隔时间的操作， 具体为： 计算压缩后的数据包 的接收时间与参考时间的第一时间差， 计算解压出的该数据包的 Sn与緩存 的参考 Sn的第二 Sn差值，根据计算的第一时间差和第二 Sn差值计算出单 位 Sn的相隔时间。
步骤 305： 计算压缩后的数据包的接收时间与参考时间的第二时间差。 例如， 压缩后的数据包的接收时间为 400秒， 以及参考时间为 354秒， 计算压缩后的数据包的接收时间与参考时间的第二时间差为 46。
步骤 306: 根据第二时间差、緩存的参考 Sn和单位 Sn的相隔时间， 判 断解压未成功的原因是否为解压器连续丟失大量包，如果是，执行步骤 307。 具体地，计算解压出的该数据包的 Sn与緩存的参考 Sn的第三 Sn差值， 根据第三 Sn差值和单位 Sn的相隔时间计算出第三时间差， 如果第二时间 差与第三时间差的差值超过预设的阈值， 则判断出解压失败的原因为解压 器连续丟失大量包。
假设， 预设的阈值为 20。 例如， 根据解压的该数据包的 Sn "89" 与緩 存的参考 Sn "87" , 计算出第三 Sn差值为 2, 根据第三 Sn差值 2和单位 Sn的相隔时间 2, 计算出第三时间差为 4, 其中， 第二时间差 46与第三时 间差 4之间的差值超过预设的阈值 20,则判断出解压器在第 354秒到第 400 秒的时间段内未接收到压缩器连续发送的大量数据包， 即解压器发生了连 续丟失数据包的现象。
其中， 预设的阈值是根据实验得到的经验值。
步骤 307: 根据计算的第二时间差与单位 Sn的相隔时间， 计算出 Sn 增量值。
具体地， 对计算的第二时间差与单位 Sn的相隔时间做除法运算， 得到 Sn增量值。
例如， 对计算的第二时间差 46与单位 Sn的相隔时间 2做除法运算， 得到 Sn增量值为 23。
步骤 308:根据緩存的参考 Sn和计算出的 Sn增量值，计算出新的参考
Sn。
具体地， 对緩存的参考 Sn和计算出的 Sn增量值做加法运算， 得到新 的参考 Sn。
例如，对緩存的参考 Sn "87"和计算出的 Sn增量值 "23"做加法运算， 得到新的参考 Sn为 "100" , 其中， 新的参考 Sn " 100" 的二进制编码为 " 1100100"„
其中， 在本步骤中得到的新的参考 Sn与该数据包的原 Sn位于同一个 编码区间内。
步骤 309: 根据新的参考 Sn, 对该数据包的 Sn压缩码重新进行解压， 得到该数据包的 Sn。
具体地， 确定出以新的参考 Sn为起点且与新的参考 Sn的差值小于编 码区间长度的 Sn, 将该数据包的 Sn压缩码分别与新的参考 Sn所在的编码 区间内的每个 Sn的低压缩比特数位个比特位进行匹配， 匹配出相同的 Sn, 其中， 匹配出的 Sn为重新解压出的该数据包的 Sn。
例如，在步骤 202中得到编码区间的长度为 4,根据编码区间的长度 4, 确定出以新的参考 Sn " 100" 为起点且与新的参考 Sn "100" 的差值小于编 码区间的长度 4的 Sn分别为 " 101"、 "102" 和 " 103" , 其中， 新的参考 Sn "100" 以及确定出的 "101"、 "102" 和 " 103" 位于同一个编码区间内， 且 "101"、 "102" 和 " 103" 的二进制编码分别为 " 1100101"、 " 1100110" 和 "1100111" ;新的参考 Sn "100"以及确定出的 Sn " 101"、 " 102"和 " 103" 包括的低 2位个比特位分别为 "00"、 "01"、 "10" 和 "11 " , 将该数据包的
Sn压缩码 "01" 分别与新的参考 Sn " 100" 所在的编码区间内的四个 Sn包 括的低 2位个比特位进行匹配，匹配出相同的 Sn" 101" ,将匹配出的 Sn"101" 作为该数据包的 Sn。
步骤 310: 计算单位 Sn的相隔时间， 将緩存的参考 Sn、 参考时间和单 位 Sn的相隔时间更新为重新解压出的该数据包的 Sn、压缩后的数据包的接 收时间以及计算的单位 Sn的相隔时间， 操作结束。
其中， 计算单位 Sn的相隔时间的操作， 具体为： 计算重新解压出该数 据包的 Sn与緩存的参考 Sn之间的第四 Sn差值， 根据第二时间差和第四
Sn差值， 计算出单位 Sn的相隔时间。
例如， 计算重新解压出的该数据的 Sn " 101" 与参考 Sn "87" 之间的 第四 Sn差值为 "24" ,根据第二时间差 "46"与计算出的第四 Sn差值 "24" , 计算出单位 Sn的相隔时间为 "1.9167秒，，； 将緩存的参考 Sn "87"、 参考时 间 "354秒" 和单位 Sn的相隔时间 "2秒" 分别更新为重新解压的该数据 包的 Sn "101"、 压缩后的数据包的接收时间 "400秒" 和计算的单位 Sn的 相隔时间 "1.9167秒"。
进一步地， 还可以根据重新解压出的该数据包的 Sn, 获取 CRC码， 比 较获取的 CRC码和接收的该数据包的 CRC码， 如果两者相同， 则重新解 压成功， 如果两者不相同， 则重新解压不成功， 操作结束。
在本发明实施例中， 解压器接收压缩后的数据包， 对压缩后的数据包 序列号压缩码进行解压， 如果因连续丟失包而未解压成功， 则根据压缩后 的数据包的接收时间、事先緩存的参考 Sn、参考时间和单位 Sn的相隔时间， 获取新的参考 Sn,根据新的参考 Sn对数据包的 Sn压缩码进行解压。其中， 即使解压器发生连续丟失的过多的数据包时， 获取的新的参考 Sn与该数据 包的原 Sn还位于相同的编码区间， 使得解压出的该数据包的 Sn与其原 Sn 一致， 从而提高解压数据包的 Sn的准确性。 如图 4所示， 本发明实施例提供了一种解压的装置， 包括：
解压模块 401 , 用于接收压缩后的数据包， 对压缩后的数据包序列号压 缩码进行解压。
获取模块 402,用于当因连续丟失包而使解压模块 401未成功解压出该 数据包的序列号时， 根据压缩后的数据包的接收时间、 緩存的参考序列号、 参考时间和单位序列号的相隔时间， 获取新的参考序列号。
重新解压模块 403 ,用于根据获取模块 402获取的新的参考序列号对该 数据包的序列号压缩码进行重新解压， 得到该数据包的序列号。
其中， 緩存的参考序列号为最近一次解压成功数据包的序列号， 参考 时间为压缩后的数据包的接收时间， 且该数据包为最近一次解压成功的数 据包。
其中， 获取模块 402, 用于计算压缩后的数据包的接收时间与参考时间 的时间差； 根据计算的时间差和单位序列号的相隔时间， 计算出序列号增 量值； 根据参考序列号和序列号增量值， 计算出新的参考序列号。
进一步地， 该装置还包括：
第一更新模块， 用于根据计算的时间差、 该数据包的序列号和参考序 列号， 获得单位序列号的相隔时间； 将緩存的单位序列号的相隔时间更新 为获取单位序列号的相隔时间。
其中， 第一更新模块具体用于根据该数据包的序列号和参考序列号， 计算出序列号差值； 根据计算的时间差和计算的序列号差值， 计算出单位 序列号的相隔时间； 将緩存的单位序列号的相隔时间更新为获取的单位序 列号的相隔时间。
进一步地， 装置还包括：
第二更新模块， 用于将緩存的参考序列号更新为该数据包的序列号， 将参考时间更新为压缩后的数据包的接收时间。
在本发明实施例中， 通过接收压缩后的数据包， 对压缩后的数据包序 列号压缩码进行解压， 如果因连续丟失包而未解压成功， 则根据压缩后的 数据包的接收时间、 緩存的参考序列号、 参考时间和单位序列号的相隔时 间， 获取新的参考序列号， 根据新的参考序列号对数据包的序列号压缩码 进行解压。 其中， 即使解压器连续丟失的过多的数据包时， 获取的新的参 考序列号与该数据包的原序列号还位于相同的编码区间， 使得解压出的该 数据包的序列号与其原序列号一致， 从而提高解压数据包的序列号的准确 性。 需要说明的是： 上述实施例提供的一种解压的装置在解压数据包的序 列号压缩码时， 仅以上述各功能模块的划分进行举例说明， 实际应用中， 可以根据需要而将上述功能分配由不同的功能模块完成， 即将装置的内部 结构划分成不同的功能模块， 以完成以上描述的全部或者部分功能。 另夕卜， 上述实施例提供解压的装置与解压的方法实施例属于同一构思， 其具体实 现过程详见方法实施例， 这里不再贅述。 以上实施例提供的技术方案中的全部或部分内容可以通过软件编程实 现， 其软件程序存储在可读取的存储介质中， 存储介质例如： 计算机中的 硬盘、 光盘或软盘。 以上所述仅为本发明的较佳实施例， 并不用以限制本发明， 凡在本发 明的精神和原则之内， 所作的任何修改、 等同替换、 改进等， 均应包含在 本发明的保护范围之内。

Claims

权利要求书
1、 一种解压的方法， 其特征在于， 所述方法包括：
接收压缩后的数据包， 对所述压缩后的数据包序列号压缩码进行解压； 当因连续丟失包而未成功解压出所述数据包序列号时， 根据所述压缩 后的数据包的接收时间、 緩存的参考序列号、 参考时间和单位序列号的相 隔时间， 获取新的参考序列号；
根据所述新的参考序列号对所述数据包序列号的压缩码进行重新解 压， 获取所述数据包的序列号；
其中， 所述緩存的参考序列号为最近一次解压成功数据包的序列号， 所述参考时间为压缩后的数据包的接收时间且所述数据包为最近一次解压 成功的数据包。
2、 如权利要求 1所述的方法， 其特征在于， 所述根据压缩后的数据包 的接收时间、 緩存的参考序列号、 参考时间和单位序列号的相隔时间， 获 取新的参考序列号， 包括：
计算所述压缩后的数据包的接收时间与所述参考时间的时间差； 根据所述时间差和所述单位序列号的相隔时间， 计算出序列号增量值； 根据所述緩存的参考序列号和所述序列号增量值， 计算出所述新的参 考序列号。
3、 如权利要求 2所述的方法， 其特征在于， 所述根据新的参考序列号 对所述数据包的序列号压缩码进行重新解压， 获取所述数据包的序列号之 后， 还包括：
根据所述时间差、 所述数据包的序列号和所述緩存的参考序列号， 获 得单位序列号的相隔时间；
将所述緩存的单位序列号的相隔时间更新为所述获取单位序列号的相 隔时间。
4、 如权利要求 3所述的方法， 其特征在于， 所述根据所述时间差、 所 述数据包的序列号和所述緩存的参考序列号获得单位序列号的相隔时间， 包括：
根据所述数据包的序列号和所述緩存的参考序列号， 计算出序列号差 值；
根据所述时间差和所述序列号差值， 计算出单位序列号的相隔时间。
5、 如权利要求 1-4任一项权利要求所述的方法， 其特征在于， 所述根 据所述新的参考序列号对所述数据包的序列号压缩码进行重新解压， 获取 所述数据包的序列号之后， 还包括：
将所述緩存的参考序列号更新为所述数据包的序列号， 将所述参考时 间更新为所述压缩后的数据包的接收时间。
6、 一种解压的装置， 其特征在于， 所述装置包括：
解压模块， 用于接收压缩后的数据包， 对所述压缩后的数据包的序列 号压缩码进行解压；
获取模块， 用于当因连续丟失包而使所述解压模块未成功解压出所述 数据包的序列号时， 根据所述压缩后的数据包的接收时间、 緩存的参考序 列号、 参考时间和单位序列号的相隔时间， 获取新的参考序列号；
重新解压模块， 用于根据所述获取模块获取的新的参考序列号对所述 数据包的序列号压缩码进行重新解压， 得到所述数据包的序列号；
其中， 所述緩存的参考序列号为最近一次解压成功数据包的序列号， 所述参考时间为压缩后的数据包的接收时间， 且所述数据包为最近一次解 压成功的数据包。
7、 如权利要求 6所述的装置， 其特征在于，
所述获取模块具体用于计算所述压缩后的数据包的接收时间与所述緩 存的参考时间的时间差， 根据所述时间差和所述单位序列号的相隔时间， 计算出序列号增量值， 根据所述緩存的参考序列号和所述序列号增量值， 计算出所述新的参考序列号。
8、 如权利要求 7所述的装置， 其特征在于， 所述所述装置还包括： 第一更新模块， 用于根据所述时间差、 所述数据包的序列号和所述緩 存的参考序列号， 获得单位序列号的相隔时间， 将所述緩存的单位序列号 的相隔时间更新为所述获取单位序列号的相隔时间。
9、 如权利要求 8所述的装置， 其特征在于，
所述第一更新模块具体用于根据所述数据包的序列号和所述緩存的参 考序列号， 计算出序列号差值， 根据所述时间差和所述序列号差值， 计算 出单位序列号的相隔时间， 将所述緩存的单位序列号的相隔时间更新为所 述获取的单位序列号的相隔时间。
10、如权利要求 6-9任一项权利要求所述的装置， 其特征在于， 所述装 置还包括：
第二更新模块， 用于将所述緩存的参考序列号更新为所述数据包的序 列号， 将所述参考时间更新为所述压缩后的数据包的接收时间。
PCT/CN2011/084293 2010-12-20 2011-12-20 一种解压的方法及装置 WO2012083842A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP11852175.6A EP2637379B1 (en) 2010-12-20 2011-12-20 Method and apparatus for decompression
KR1020137015990A KR101471482B1 (ko) 2010-12-20 2011-12-20 압축해제 방법 및 장치
US13/922,496 US9350592B2 (en) 2010-12-20 2013-06-20 Decompressing method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010602775.8 2010-12-20
CN201010602775.8A CN102571540B (zh) 2010-12-20 2010-12-20 一种解压的方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/922,496 Continuation US9350592B2 (en) 2010-12-20 2013-06-20 Decompressing method and apparatus

Publications (1)

Publication Number Publication Date
WO2012083842A1 true WO2012083842A1 (zh) 2012-06-28

Family

ID=46313170

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/084293 WO2012083842A1 (zh) 2010-12-20 2011-12-20 一种解压的方法及装置

Country Status (5)

Country Link
US (1) US9350592B2 (zh)
EP (1) EP2637379B1 (zh)
KR (1) KR101471482B1 (zh)
CN (1) CN102571540B (zh)
WO (1) WO2012083842A1 (zh)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10194348B2 (en) 2016-05-27 2019-01-29 Qualcomm Incorporated Techniques and apparatuses for improved robust header compression (ROHC) decompression
CN108574684B (zh) * 2017-03-14 2020-08-28 大唐移动通信设备有限公司 一种解压缩的方法和装置
CN109962896A (zh) * 2017-12-26 2019-07-02 大唐移动通信设备有限公司 数据包的处理方法、基站、电子设备和存储介质
CN110602745A (zh) * 2018-06-12 2019-12-20 大唐移动通信设备有限公司 一种数据包解压方法及装置
CN111328104B (zh) * 2018-12-14 2022-03-04 华为技术有限公司 数据包的解压缩方法和装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002094553A (ja) * 2000-09-12 2002-03-29 Matsushita Electric Ind Co Ltd パケット伝送装置およびパケット伝送方法
WO2002028017A2 (en) * 2000-09-28 2002-04-04 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for maintaining sequence numbering in header compressed packets
CN1489845A (zh) * 2001-09-28 2004-04-14 ���µ�����ҵ��ʽ���� 报头压缩分组接收装置和方法
CN101107829A (zh) * 2004-12-08 2008-01-16 高通股份有限公司 用于在稳健报头压缩中增强本地修复的方法和系统
US20080151901A1 (en) * 2006-12-26 2008-06-26 Yang Tomas S Header compression in a wireless communication network
CN101411157A (zh) * 2006-05-04 2009-04-15 高通股份有限公司 用于在稳健标头压缩中加强局部修复的方法和系统

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI250724B (en) * 2002-10-11 2006-03-01 Ericsson Telefon Ab L M Method and communication system for packeting messaging, and header compressor unit

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002094553A (ja) * 2000-09-12 2002-03-29 Matsushita Electric Ind Co Ltd パケット伝送装置およびパケット伝送方法
WO2002028017A2 (en) * 2000-09-28 2002-04-04 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for maintaining sequence numbering in header compressed packets
CN1489845A (zh) * 2001-09-28 2004-04-14 ���µ�����ҵ��ʽ���� 报头压缩分组接收装置和方法
CN101107829A (zh) * 2004-12-08 2008-01-16 高通股份有限公司 用于在稳健报头压缩中增强本地修复的方法和系统
CN101411157A (zh) * 2006-05-04 2009-04-15 高通股份有限公司 用于在稳健标头压缩中加强局部修复的方法和系统
US20080151901A1 (en) * 2006-12-26 2008-06-26 Yang Tomas S Header compression in a wireless communication network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2637379A4 *

Also Published As

Publication number Publication date
KR101471482B1 (ko) 2014-12-10
KR20130098409A (ko) 2013-09-04
US20130279522A1 (en) 2013-10-24
EP2637379A4 (en) 2013-10-23
EP2637379B1 (en) 2016-04-06
EP2637379A1 (en) 2013-09-11
CN102571540B (zh) 2015-12-16
CN102571540A (zh) 2012-07-11
US9350592B2 (en) 2016-05-24

Similar Documents

Publication Publication Date Title
US8718098B2 (en) Method for compressing and decompressing time stamp and equipment thereof
CN1223134C (zh) 对无线信道上的信头解码的方法和系统
US9166931B2 (en) Method and device for improving robustness of context update message in robust header compression
US8817821B2 (en) Method and device for user datagram protocol packet compression and decompression
CN103684680B (zh) 解码经编码的数据块
WO2012083842A1 (zh) 一种解压的方法及装置
RU2008147706A (ru) Способы и системы для усовершенствования локального восстановления при надежном сжатии заголовка
JP2018536317A5 (zh)
WO2018171401A1 (zh) 一种信息处理方法、装置及设备
CN103152359A (zh) 一种端到端无线传输控制协议线性网络编码的改进方法
EP2971721B1 (en) Data compression for priority-based data traffic, on an aggregate traffic level, in a multi-stream communications system
WO2014139454A1 (en) System and method for multi-stream compression and decompression
CN111328104B (zh) 数据包的解压缩方法和装置
JP2015534770A5 (zh)
CN107209713B (zh) 按需文件修复的方法和系统
CN108574684B (zh) 一种解压缩的方法和装置
CN108737349B (zh) 一种语音数据包的处理方法及装置
CN114285528A (zh) 传输报文的方法及通信装置
WO2015137854A1 (en) Method and devices for providing feedback in a communication system
KR102086457B1 (ko) 중복 단편화와 점진적 디코딩을 이용한 메모리 제한 환경에서의 소프트웨어 모뎀의 디코딩 방법
WO2021258773A1 (zh) 数据处理方法及装置、存储介质、电子装置
Levy et al. General all-Layers combined with Efficient WLAN MAC Layer Headers Compression
CN118353966A (zh) 一种数据传输方法、数据传输设备和相关设备
CN118101126A (zh) 一种基于随身WiFi网络的数据传输方法及系统
JP2008016981A (ja) データ通信装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11852175

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2011852175

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20137015990

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE