阅读说明：本技术 基于健壮性头压缩的压缩端与解压缩端及其数据处理方法 (Compression end and decompression end based on robust header compression and data processing method thereof ) 是由 程瑾 马晓璐 黄夷芯 魏润润 宫能安 于 2019-01-31 设计创作，主要内容包括：本发明公开了基于健壮性头压缩的压缩端与解压缩端及其数据处理方法。压缩端数据处理方法应用于收发器的压缩端。该压缩端包含一处理器及一存储器,该存储器存储多个文本。该方法包含：接收一标头讯流；当该存储器的存储空间不足时,释放所述文本中的至少其中之一；压缩该标头讯流；以及传送经压缩的该标头讯流。(The invention discloses a compression end and a decompression end based on robust header compression and a data processing method thereof. The compression-end data processing method is applied to the compression end of the transceiver. The compression end comprises a processor and a memory, and the memory stores a plurality of texts. The method comprises the following steps: receiving a header stream; when the storage space of the memory is insufficient, releasing at least one of the texts; compressing the header stream; and transmitting the compressed header stream.)

1. A compression end data processing method based on robust header compression is applied to a compression end of a transceiver, the compression end comprises a processor and a memory, the memory stores a plurality of texts, and the method comprises the following steps:

receiving a header stream;

when the storage space of the memory is insufficient, releasing at least one of the texts;

compressing the header stream; and

transmitting the compressed header stream.

2. The method of claim 1, wherein the text is stored in a linked list, the step of releasing at least one of the text comprising:

the text corresponding to the first node of the linked list is released.

3. A decompression end data processing method based on robust header compression is applied to a decompression end of a transceiver, the decompression end comprises a processor and a memory, the memory stores a plurality of texts, the method comprises:

receiving a compressed header stream;

when the memory space allocated to the decompressing end in the memory is insufficient, a static receiving failure feedback signal is transmitted for a target text in the texts;

releasing the target text; and

the data of the header stream is decompressed and stored.

4. A compression end data processing method based on robust header compression is applied to a compression end of a transceiver, the compression end comprises a processor and a memory, the memory stores a plurality of texts, and the method comprises the following steps:

receiving a feedback signal with a rejection option for a first text;

receiving a header stream; and

when a second text corresponding to the header stream exists in the memory and the second text is not equal to the first text, the header stream is compressed by the second text.

5. The method of claim 4, further comprising:

when the second text corresponding to the header stream exists in the memory and the second text is equal to the first text, transmitting the data of the header stream in an uncompressed specification.

6. A compression end of robust header compression, comprising:

a memory for storing a plurality of program codes or program instructions and a plurality of texts; and

a processor, coupled to the memory, for executing the program codes or program instructions to implement the following steps:

receiving a header stream;

when the storage space of the memory is insufficient, releasing at least one of the texts;

compressing the header stream; and

transmitting the compressed header stream.

7. The compression end of claim 6, wherein the text is stored in a linked list, the step of releasing at least one of the texts comprises:

the text corresponding to the first node of the linked list is released.

8. A decompression end of robust header compression, comprising:

a memory for storing a plurality of program codes or program instructions and a plurality of texts; and

a processor, coupled to the memory, for executing the program codes or program instructions to implement the following steps:

receiving a compressed header stream;

when the storage space of the memory is insufficient, transmitting a static receiving failure feedback signal aiming at a target text in the texts;

releasing the target text; and

the data of the header stream is decompressed and stored.

9. A compression end of robust header compression, comprising:

a memory for storing a plurality of program codes or program instructions and a plurality of texts; and

a processor, coupled to the memory, for executing the program codes or program instructions to implement the following steps:

receiving a feedback signal with a rejection option for a first text;

receiving a header stream; and

when a second text corresponding to the header stream exists in the memory and the second text is not equal to the first text, the header stream is compressed by the second text.

10. The compression end of claim 9, further comprising:

when the second text corresponding to the header stream exists in the memory and the second text is equal to the first text, transmitting the data of the header stream in an uncompressed specification.

Technical Field

The present invention relates to Robust Header Compression (RoHC), and more particularly, to processing memory shortage at a Compression end and a decompression end based on Robust Header Compression.

Background

Robust header compression is applied in the case where the header (header) of a packet needs to be compressed, either over a wired or wireless network. Because continuous packets of the same data stream have some invariable information, the robust header compression only transmits complete header information at the beginning of the data stream, and only transmits the changed part in the subsequent data stream, so as to achieve the effect of compressing the header, thereby effectively utilizing wired or wireless frequency band resources. Basically, since only the changed part is transmitted, the receiver and the transmitter respectively prepare memories to store the unchanged part (the stored memory data is collectively referred to as text) for restoring the original complete header.

For example, there are header flow (header flow) a (IP address of destination is 0.0.0.1) and header flow B (IP address of destination is 0.0.0.2), so the compression end needs to create 2 texts to store the data of header flow a and header flow B respectively; similarly, the decompressor needs to create 2 texts to store the data of the header stream a and the header stream B, respectively. The more text the compressor or decompressor needs to store different header data, the larger the memory it needs, and the more memory shortage may occur.

The standard specification file for robust header compression mentions only: when the memory of the decompressing end is insufficient (for example, the remaining space is insufficient to store new text), the decompressing end may send a Feedback signal (Feedback rejection) with a reject option to the compressing end; and when the compression end receives the feedback signal with the rejection option, the compression end stops compressing the packet stream (packet stream) for a period of time. Therefore, there is a need to provide a memory starvation process for robust header compression to efficiently utilize wired or wireless band resources.

Disclosure of Invention

In view of the shortcomings of the prior art, an object of the present invention is to provide a compression end and a decompression end based on robust header compression and a data processing method thereof, so as to effectively utilize wired or wireless frequency band resources.

The invention discloses a compression end data processing method based on robust header compression, which is applied to a compression end of a transceiver. The compression end comprises a processor and a memory, and the memory stores a plurality of texts. The method comprises the following steps: receiving a header stream; when the storage space of the memory is insufficient, releasing at least one of the texts, but not releasing the text corresponding to the uncompressed specification (uncompressed profile); compressing the header stream; and transmitting the compressed header stream.

The invention also discloses a decompressing end data processing method based on robust header compression, which is applied to a decompressing end of a transceiver. The decompression end comprises a processor and a memory, and the memory stores a plurality of texts. The method comprises the following steps: receiving a compressed header stream; when the memory space allocated to the decompressing end in the memory is insufficient, a static receiving failure feedback signal is transmitted for a target text (text corresponding to the non-uncompressed specification) in the texts; releasing the target text; the data of the header stream is decompressed and stored.

The invention also discloses a compression end data processing method based on robust header compression, which is applied to a compression end of a transceiver. The compression end comprises a processor and a memory, and the memory stores a plurality of texts. The method comprises the following steps: receiving a feedback signal with a rejection option for a first text; receiving a header stream; and compressing the header stream with a second text when the second text corresponding to the header stream exists in the memory and the second text is not equal to the first text.

The invention also discloses a compression end of the robust header compression, which comprises a memory and a processor. The memory is used for storing a plurality of program codes or program instructions and a plurality of texts. The processor is coupled to the memory and is used for executing the program codes or the program instructions to realize the following steps: receiving a header stream; when the storage space of the memory is insufficient, releasing at least one of the texts, but not releasing the text corresponding to the uncompressed specification; compressing the header stream; and transmitting the compressed header stream.

The invention also discloses a decompression end of the robust header compression, which comprises a memory and a processor. The memory is used for storing a plurality of program codes or program instructions and a plurality of texts. The processor is coupled to the memory and is used for executing the program codes or the program instructions to realize the following steps: receiving a compressed header stream; when the storage space of the memory is insufficient, transmitting a static receiving failure feedback signal aiming at a target text (text corresponding to the non-uncompressed specification) in the texts; releasing the target text; the data of the header stream is decompressed and stored.

The invention also discloses a compression end of the robust header compression, which comprises a memory and a processor. The memory is used for storing a plurality of program codes or program instructions and a plurality of texts. The processor is coupled to the memory and is used for executing the program codes or the program instructions to realize the following steps: receiving a feedback signal with a rejection option for a first text; receiving a header stream; and compressing the header stream with a second text when the second text corresponding to the header stream exists in the memory and the second text is not equal to the first text.

The compression end and the decompression end based on the robust header compression and the data processing method thereof can release the text when the memory is insufficient so as to increase the available memory space. Compared with the prior art, the transceiver implementing the invention does not need to stop compressing the packet flow for a period of time, thereby effectively utilizing wired or wireless frequency band resources.

The features, implementations, and technical effects of the present invention are described in detail below with reference to the accompanying drawings.

Drawings

FIG. 1 is a device at a compression end or a decompression end for implementing the data processing method based on robust header compression of the present invention;

FIG. 2 is a functional sequence diagram of a compression-end data processing method based on robust header compression according to an embodiment of the present invention;

FIG. 3 is a flow chart corresponding to FIG. 2;

FIG. 4 is a functional sequence diagram of a decompression end data processing method based on robust header compression according to an embodiment of the present invention;

FIG. 5 is a flow chart corresponding to FIG. 4;

FIG. 6 is a functional sequence diagram of a compression-end data processing method based on robust header compression according to another embodiment of the present invention; and

fig. 7 is a flow chart corresponding to fig. 6.

Description of the symbols

110 baseband processor

120 memory

S310 to S350, S510 to S550, S710 to S760

Detailed Description

The technical terms in the following description refer to the conventional terms in the technical field, and some terms are explained or defined in the specification, and the explanation of the some terms is based on the explanation or the definition in the specification.

The disclosure of the invention comprises a compression end and a decompression end based on robust header compression and a data processing method thereof. Part or all of the flow of the data processing method of the present invention may be in the form of software and/or firmware, and may be executed by the compression/decompression end of the present invention or its equivalent, and the following description of the method invention will focus on the content of steps rather than hardware without affecting the full disclosure and feasibility of the method invention.

Fig. 1 is a device at a compression end or a decompression end for implementing the data processing method based on robust header compression of the present invention. A transceiver of a wireless/wired network typically includes a compression end and a decompression end. The compression side or the decompression side includes a baseband processor 110 and a memory 120. The memory 120 stores a plurality of program codes or program instructions, and the baseband processor 110 implements the functions of the compression end or the decompression end by executing the program codes or program instructions.

Fig. 2 is a functional sequence diagram (function sequence diagram) of a compression-end data processing method based on robust header compression according to an embodiment of the present invention. Fig. 3 is a flow chart corresponding to fig. 2. Please refer to fig. 2 and fig. 3. When the sender compressor receives a new header stream (step S310) and finds that the memory is insufficient (e.g., the portion of the memory 120 allocated to the compressor is insufficient to store new text) (step S320), the sender compressor releases n texts (i.e., clears the n texts in the memory 120) (step S330). n is an integer greater than or equal to 1 and less than the total number of texts stored in the memory 120. Then, the compression end of the transmitting side compresses the new header stream (step S340), and transmits the compressed new header stream to the decompression end of the receiving side receiver (step S350). In some embodiments, 1 ≦ n ≦ 3, and the n texts are the oldest n texts in all texts, and further, the n texts cannot be the texts corresponding to the uncompressed specification. After the old text is released, the memory 120 has room to store the new text, so that the sender compression side can continue to compress the header stream without stopping compressing the packet stream for a while.

Fig. 4 is a functional sequence diagram of a decompression end data processing method based on robust header compression according to an embodiment of the present invention. Fig. 5 is a flow chart corresponding to fig. 4. Please refer to fig. 4 and fig. 5. When the receiver decompressor receives a new header stream (step S510) and finds that there is insufficient memory (e.g., the portion of the memory 120 allocated to the decompressor has not enough to store new text) (step S520), the receiver decompressor selects n target texts and transmits a STATIC reception-failure feedback signal (STATIC-NACK) to the transmitter compressor for the n target texts (step S530). Next, the baseband processor 110 at the receiver decompressor releases the n target texts in the memory 120 (step S540), and stores the data of the new header stream into the memory 120 (step S550). In some embodiments, 1 ≦ n ≦ 3, and the n texts are the oldest n texts in all texts, and further, the n texts cannot be the texts corresponding to the uncompressed specification. Note that in step S530, the receiver decompressor sends a static reception failure feedback signal for each text to be released. The receiver decompressor autonomously or actively sends a static reception failure feedback signal, so the static reception failure feedback signal may not carry the Sequence Number (SN) of the packet. After receiving the static reception failure feedback signals, the sender compressor knows that the memory 120 of the receiver decompressor has not stored the text specified by or corresponding to the static reception failure feedback signal or signals; in other words, when the sender compresses the header stream corresponding to the text, the sender starts to transmit the most basic ir (initiation and refresh) packet (including the complete header information) specified by the robust header compression. The IR packet is transmitted to inform the receiver's decompressor to reconstruct the text corresponding to the header stream.

In the embodiments of fig. 4 and fig. 5, when the memory is insufficient, the receiver decompressor releases the old text in the local memory, and notifies the sender of the released text; therefore, the sender compression end can continue to compress the header stream without stopping compressing the packet stream for a period of time due to insufficient memory of the receiver decompression end.

Fig. 6 is a functional sequence diagram of a data processing method for a memory shortage situation at a transmitting side compression end based on robust header compression according to another embodiment of the present invention. Fig. 7 is a flow chart corresponding to fig. 6. Please refer to fig. 6 and fig. 7. Assume that the memory 120 of the sender compression side originally stores text a, text B, text C, and text D, where the text D corresponds to an uncompressed profile (uncompressed profile). When the receiver decompressor finds that the memory is insufficient, the sender decompressor receives the feedback signal with the rejection option from the receiver decompressor (step S710), and records the text (first text) targeted by the feedback signal with the rejection option (step S715). It is assumed here that the feedback signal with the reject option is for text a (i.e. the first text is text a). Thereafter, when the compression end receives a new header stream (corresponding to the second text) (step S720), the baseband processor 110 of the transmission compression end first determines whether the memory 120 stores the second text (step S730). If the second text is not stored in the memory 120 (e.g., the sender compressed end receives the header stream E, no in step S730), the baseband processor 110 transmits the data of the incoming header stream in the uncompressed specification (step S750). If the second text is stored in the memory 120 (e.g., the header stream A, B or C is received, yes in step S730), the baseband processor 110 further determines whether the second text is the same as the first text (step S740). If the second text is the first text (e.g., header stream a is received, yes in step S740), the baseband processor 110 transmits the data of the incoming header stream in the uncompressed specification (step S750). If the second text is not the first text (e.g., header stream B or header stream C is received, no in step S740), the baseband processor 110 compresses the incoming header stream with the second text (step S760).

In the embodiments of fig. 6 and fig. 7, after receiving the feedback signal with the reject option, the sender compression side can determine whether to compress the incoming header stream according to the text corresponding to the incoming header stream without stopping compressing the packet stream for a period of time. The text a mentioned above may be the oldest text at the decompression end of the receiving party. After the sender compressor receives the feedback signal with reject option for text a, the baseband processor 110 of the sender compressor may or may not release the text a in the memory 120.

In the above embodiment, the baseband processor 110 stores the texts in the memory 120 in the form of linked lists (linked lists), and each text is a node in the linked list. When the transmitter decompressor or the receiver decompressor receives a header data, the baseband processor 110 moves the text corresponding to the header data to the last node of the linked list. Thus, the text corresponding to the most front node of the linked list is the oldest of all the texts. The operation of the linked list is well known to those skilled in the art and will not be described further. Note that the text corresponding to the uncompressed specification may be stored in a linked list, but not released.

Because the details and variations of the disclosed method and invention can be understood by those skilled in the art from the disclosure of the disclosed apparatus and invention, the repetitive description is omitted herein for the avoidance of redundant details without affecting the disclosed requirements and the feasibility of the method and invention. It should be noted that the shapes, sizes, proportions, and sequence of steps of the elements and steps shown in the drawings are illustrative only and not intended to limit the invention, which is understood by those skilled in the art.

Although the embodiments of the present invention have been described above, the embodiments are not intended to limit the present invention, and those skilled in the art can make variations on the technical features of the present invention according to the explicit or implicit contents of the present invention, and all such variations may fall within the scope of the patent protection sought by the present invention.