CN108737392B

CN108737392B - Compression method for terminal reported data, sending end and receiving end

Info

Publication number: CN108737392B
Application number: CN201810415994.1A
Authority: CN
Inventors: 何军强; 叶飞虎
Original assignee: Hangzhou Hopechart Iot Technology Co ltd
Current assignee: Hangzhou Hopechart Iot Technology Co ltd
Priority date: 2018-05-03
Filing date: 2018-05-03
Publication date: 2020-10-30
Anticipated expiration: 2038-05-03
Also published as: CN108737392A

Abstract

The embodiment of the invention provides a compression method for terminal reported data, a sending end and a receiving end. Reading data to be transmitted, wherein the data to be transmitted consists of code word arrangement; dividing data to be transmitted into phrases according to preset compression conditions, wherein the phrases at least comprise coding types and coding information; obtaining a coding segment according to a coding rule corresponding to the coding type; wherein, the compression coding is carried out according to the static code table; the embodiment of the invention divides the data to be transmitted into a plurality of phrases, quickly and effectively obtains compression coding for each phrase according to coding types to obtain the coding fragments, and sends the coding fragments to the receiving end, so that the receiving end obtains the data to be transmitted after decoding, thereby reducing the complexity of data compression in the data transmission process, accelerating the compression speed and reducing the resource consumption.

Description

Compression method for terminal reported data, sending end and receiving end

Technical Field

The embodiment of the invention relates to the technical field of mobile communication, in particular to a compression method of terminal reported data, a sending end and a receiving end.

Background

The mobile terminal equipment needs to report the acquired data in real time, the terminal transmits the data through 2G/3G/4G, the hardware performance of the terminal is uneven, and the transmission speed and the stability are different. There are two problems to be solved in reporting data: a. the flow of the terminal mobile card exceeds the standard; b. because the data volume is large, the reported data has time delay. The data of each terminal is charged by the flow, typically a flat fee of several tens of MB of flow per month. There are also users that use the traffic pool, how many GB of traffic multiple terminals share per month. After all, the flow is limited, and the cost of the excess part is high, so that the data size is bound to be reduced in the transmission process.

In the prior art, the data packets are packed and the same items are removed to reduce the transmission data flow, but the reduction rate is not large, and the data flow still exceeds the standard. Although the data compression rate is high and general by using the currently mainstream compression algorithms such as gzip, bzip2, and 7z, there are several problems as follows: 1. the compression rate can be reflected only when the data size is more than dozens of KB, and the compression rate of the reported data within 1KB is relatively low; 2. the binary code space of the compression algorithm is at least dozens of KB, the available code space in the single chip microcomputer is only a few KB, the algorithm operation complexity is high, and the operation performance of the terminal can be influenced; 3. the operation of the compression algorithm requires that the memory space is more than 32KB, and the memory space of the stack and the heap in the single chip microcomputer is just a few KB, so that the normal operation cannot be realized at all.

It can be seen that the data compression method under high compression rate in the prior art is too complex and not easy to implement.

Disclosure of Invention

The embodiment of the invention provides a compression method for terminal reported data, a sending end and a receiving end, which are used for solving the problems that the data compression method under the high compression rate in the prior art is too complex and is difficult to realize.

In a first aspect, an embodiment of the present invention provides a method for compressing data reported by a terminal, including:

reading data to be transmitted with preset length, wherein the data to be transmitted is formed by arranging code words;

dividing the data to be transmitted into at least one phrase according to a preset compression condition and the arrangement sequence of the code words, wherein the phrase at least comprises a coding type and coding information;

obtaining a coding segment corresponding to the phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain a coding segment of the phrase;

and combining the corresponding coded segments according to the arrangement sequence of each phrase in the data to be transmitted, and then sending the combined coded segments to a receiving end, so that the receiving end analyzes each coded segment into the corresponding phrase according to the decoding rule corresponding to the coding rule and the static code table, and combining to obtain the data to be transmitted.

In a second aspect, an embodiment of the present invention provides a method for compressing data reported by a terminal, including:

receiving a coding segment combination sent by a sending end; the method comprises the steps that a sending end reads data to be transmitted with preset length, the data to be transmitted are arranged by code words, the data to be transmitted are divided into at least one phrase according to the arrangement sequence of the code words and preset compression conditions, and the phrase at least comprises a coding type and coding information; then the transmitting end root obtains a coding segment corresponding to each phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on coding information of corresponding phrases according to a pre-stored static code table to obtain coding segments of the phrases, and finally combining the corresponding coding segments by the sending end according to the arrangement sequence of each phrase in the data to be transmitted;

and analyzing each coding segment into corresponding phrases according to a decoding rule corresponding to the coding rule and the static code table, and combining to obtain the data to be transmitted.

In a third aspect, an embodiment of the present invention provides a sending end of a compression method for data reported by a terminal, where the sending end includes:

the device comprises an acquisition module and a transmission module, wherein the acquisition module is used for reading data to be transmitted with preset length, and the data to be transmitted consists of code word arrangement;

the segmentation module is used for segmenting the data to be transmitted into at least one phrase according to a preset compression condition and the arrangement sequence of the code words, wherein the phrase at least comprises a coding type and coding information;

the coding module is used for obtaining a coding segment corresponding to each phrase according to a coding rule corresponding to the coding type and the coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain a coding segment of the phrase;

and the sending module is used for combining the corresponding coding segments according to the arrangement sequence of each phrase in the data to be transmitted and then sending the combined coding segments to a receiving end, so that the receiving end analyzes each coding segment into the corresponding phrase according to the decoding rule corresponding to the coding rule and the static code table, and the data to be transmitted is obtained after the combination.

In a fourth aspect, an embodiment of the present invention provides a receiving end for a compression method for data reported by a terminal, where the receiving end is characterized in that the receiving end includes:

a receiving module, configured to receive a coded segment combination sent by a sending end; the method comprises the steps that a sending end reads data to be transmitted with preset length, the data to be transmitted are arranged by code words, the data to be transmitted are divided into at least one phrase according to the arrangement sequence of the code words and preset compression conditions, and the phrase at least comprises a coding type and coding information; then the transmitting end root obtains a coding segment corresponding to each phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on coding information of corresponding phrases according to a pre-stored static code table to obtain coding segments of the phrases, and finally combining the corresponding coding segments by the sending end according to the arrangement sequence of each phrase in the data to be transmitted;

and the decoding module is used for analyzing each coding segment into a corresponding phrase according to a decoding rule corresponding to the coding rule and the static code table, and obtaining the data to be transmitted after combination.

In a fifth aspect, an embodiment of the present invention further provides an electronic device, including:

a processor, a memory, a communication interface, and a bus; wherein,

the processor, the memory and the communication interface complete mutual communication through the bus;

the communication interface is used for information transmission between communication devices of the electronic equipment;

the memory stores program instructions executable by the processor, the processor invoking the program instructions to perform a method comprising:

In a sixth aspect, an embodiment of the present invention further provides a storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the following method:

According to the compression method for the terminal reported data, the sending end and the receiving end, the data to be transmitted is divided into a plurality of phrases through traversal of the data to be transmitted, compression coding is rapidly and effectively carried out on each phrase according to the coding type of each phrase to obtain the corresponding coding segment, and then the coding segment is sent to the receiving end, so that the receiving end can obtain the data to be transmitted after decoding, the complexity of data compression in the data transmission process is greatly reduced, the compression speed is accelerated, and the resource consumption is reduced.

Drawings

Fig. 1 is a flowchart of a compression method for data reported by a terminal according to an embodiment of the present invention;

fig. 2 is a flowchart of a compression method for data reported by another terminal according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of a transmitting end of a compression method for terminal reported data according to an embodiment of the present invention;

fig. 4 is a schematic diagram of a receiving end structure of a compression method for terminal reported data according to an embodiment of the present invention;

fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

Fig. 1 is a flowchart of a method for compressing data reported by a terminal according to an embodiment of the present invention, and as shown in fig. 1, the method includes:

and step S01, reading data to be transmitted with preset length, wherein the data to be transmitted consists of code word arrangement.

The method comprises the steps that a sending end firstly obtains data to be transmitted, wherein the data to be transmitted is prepared to be sent to a receiving end, the data to be transmitted is composed of a large number of code words through arrangement, the length can be set according to actual needs, for example, 1024 bytes, and the size of the code words can also be set according to the actual needs, for example, the length of one byte or two bytes.

Step S02, according to a preset compression condition, dividing the data to be transmitted into at least one phrase according to the arrangement order of the code words, where the phrase at least includes a coding type and coding information.

Traversing the data to be transmitted according to the sequence of the arrangement of the code words, and dividing the data to be transmitted into a plurality of phrases one by one according to a preset compression condition, wherein the phrases at least comprise one code word, and each phrase is defined with a corresponding coding type. The coding information of each phrase can also be obtained according to the compression condition.

Further, the encoding type is uncompressed encoding, identical encoding or matched encoding; wherein the same code and the matching code are compressible codes, and accordingly, the compression conditions are specifically as follows:

if the code words forming the phrase are the same code word, the coding type of the phrase is the same code, and the coding information of the phrase at least comprises the phrase length and the same code word;

if a code word combination which is the same as the permutation combination of the code words in the phrase exists in the data to be transmitted before the phrase, the coding type of the phrase is matched coding, and the coding information of the phrase at least comprises the phrase length and the offset between the phrase and the same code word combination;

while the encoding type of the other phrases is uncompressed encoding and the encoding information of the phrase includes at least all of the codewords that make up the phrase.

There may be many different classification manners for the encoding types, and only one of them is illustrated in the embodiment of the present invention.

The encoding types can be divided into uncompressed encoding and compressible encoding, wherein the compressible encoding is divided into identical encoding and matching encoding.

Wherein the compression conditions to be satisfied by the same coded phrase are: the code words forming the phrase are all the same one, and the encoding information of the phrase at least includes the phrase length and the same one code word forming the phrase, for example, the phrase "aaa" is composed of 3 code words 'a', the encoding type of the phrase is the same encoding, and the encoding information is the phrase length 3, and the code words 'a'.

The compression condition to be satisfied by the matching coded phrase is as follows: in the data to be transmitted before the phrase, namely the data to be transmitted after the division is completed, a code word combination having the same permutation and combination with the code word in the phrase exists, and the code word combination is not required to be attributed to the same phrase. And the coding information of the phrase at least comprises the phrase length and the offset of the phrase from the code word combination.

And phrases which neither satisfy the compression condition of the same code nor satisfy the compression condition of the matching code in the data to be transmitted can be defined as uncompressed codes, and the coding information of the phrases at least comprises all code words of the phrases.

For example, if the data to be transmitted is "abcdaaaabcdefbbbbbbbbbbcdefgh", the data to be transmitted may be divided from front to back according to the compression condition: wherein,

the phrase "abcd" is of the type uncompressed encoding, encoding information of 'a', 'b', 'c', and'd'; the phrase "aaaa" is the same code, whose coded information is the phrase length 4, codeword 'a';

the phrase "bcd" is matched coding because the same code word combination "bcd" can be found in the previous data to be transmitted, and the coding information is phrase length 3 and offset 7;

the phrase "ef" does not satisfy the compression condition of the same code and the matching code, the phrase is an uncompressed code, and the coded information thereof is 'e' and 'f';

the phrase "bbbbbbbb" is the same code, and its coded information is the phrase length 8, codeword 'b';

the phrase "cdef" is matching code, and the coding information is phrase length 4 and offset 12;

the phrase "gh" is uncompressed coding, and its coding information is 'g' and 'h'.

Step S03, obtaining a coding segment corresponding to the phrase according to the coding rule corresponding to the coding type and the coding information of each phrase; and if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain a coding segment of the phrase.

After the coding type of each phrase is obtained, the coding information of each phrase can be coded according to the pre-stored coding rule corresponding to each coding type to obtain the coded segment. If the encoding type is compressible encoding, the phrase length or the offset in the encoding information of the phrase needs to be compressed and encoded according to a pre-stored static code table, so as to obtain an encoding segment corresponding to the phrase.

Step S04, combining the corresponding encoded segments according to the arrangement order of each phrase in the data to be transmitted, and then sending the combined encoded segments to a receiving end, so that the receiving end parses each encoded segment into the corresponding phrase according to the decoding rule corresponding to the encoding rule and the static code table, and combines the phrases to obtain the data to be transmitted.

After the coding segments corresponding to each phrase are obtained, the corresponding coding segments can be combined according to the arrangement sequence of the phrases in the data to be transmitted, and then the combined coding segments are sent to a receiving end.

And after receiving the combination of the coding segments, the receiving end identifies and analyzes the coding segments according to the decoding rules corresponding to the coding rules and the static code table so as to obtain phrases corresponding to each coding segment. And combining the phrases according to the sequence to obtain the data to be transmitted.

According to the embodiment of the invention, the data to be transmitted is divided into a plurality of phrases through traversing the data to be transmitted, each phrase is quickly and effectively compressed and encoded according to the encoding type of each phrase to obtain the corresponding encoding segment, and then the encoding segment is transmitted to the receiving end, so that the receiving end can obtain the data to be transmitted after decoding, the complexity of data compression in the data transmission process is greatly reduced, the compression speed is accelerated, and the resource consumption is reduced.

Based on the foregoing embodiment, further, the encoding rule specifically includes:

if the coding type is uncompressed coding, adding an uncompressed coding identifier in front of each code word of the coding information to the corresponding coding segment;

if the coding types are the same, the corresponding coding segments comprise the same coding identification, the same length code and the same code word; the same-length codes are obtained from the static code table according to the phrase lengths in the coding information of the corresponding phrases;

if the coding type is matched coding, the corresponding coding segment comprises an offset code and a matched length code; and the offset code and the matching length code are respectively obtained through the static code table according to the offset and the phrase length in the coding information of the corresponding phrase.

The encoding rules in the above embodiments may be set according to actual needs, and the embodiments of the present invention only give an example.

If the encoding type is uncompressed encoding, the corresponding encoding segment is an identifier of uncompressed encoding added before each codeword of the encoding information, for example, the encoding segment of the uncompressed encoding phrase "abcd" is {0'a', 0'b',0'c',0'd', where 0 is a one-bit identifier of uncompressed encoding. Correspondingly, the decoding rule at the receiving end is that if the start bit of the coded segment is 0, the next codeword can be directly determined to be a codeword in an uncompressed coded phrase, and all codewords in the phrase can be sequentially analyzed.

And if the coding types are the same, the corresponding coding segments consist of the same coding identification, the same length code and the same code word, wherein the same length code is obtained by searching the static code table according to the phrase length in the coding information of the corresponding phrase. For example, the encoding information of the phrase "aaaa" of the same code is phrase length 4, codeword 'a', the same code is identified as 10000, and the phrase length 4 corresponds to the same length code of 0001 in the static code table, then the encoding fragment of the phrase is {100000001'a' }. Correspondingly, the decoding rule at the receiving end is that if the start bit of the coded segment is 1, the corresponding coding type can be judged to be the same coding or matched coding, then the next four bits are intercepted, if 10000 is obtained, the corresponding coding type can be judged to be the same coding, then the corresponding bits are intercepted, and the phrase length and the code word are respectively analyzed, so that the corresponding phrase is obtained.

If the coding type is matched coding, the corresponding coding segment consists of an offset code and a matched length code; and the offset code and the matching length code are respectively obtained by inquiring the static code table according to the offset and the phrase length in the coding information in the corresponding phrase. For example, the phrase "bcd" of matching coding has an offset of 7, the codeword length is 3, the offset of 7 corresponds to 101011 in the static code table, the matching length code of phrase length 3 corresponds to 00 in the static code table, and the final coding result is {10101100 }. Correspondingly, the decoding rule at the receiving end is that if the start bit of the coded segment is 1 and the number obtained by intercepting the next four bits is not 10000, the corresponding coding type can be judged to be matched coding, then the corresponding bits are intercepted according to a static code table to respectively analyze the offset and the phrase length, and the corresponding code word combination can be found in the analyzed previous data to be transmitted according to the offset and the phrase length, so that the corresponding phrase is obtained.

Taking the data to be transmitted "abcdaaaabebebbbbbbbbbbcdefgh" as an example, the code segments of each phrase are respectively obtained as follows:

taking each codeword as one byte as an example, the length of the data to be transmitted is: 27 × 8 ═ 216bits, and the total length of the coded segment is 124bits, and the compression ratio is: 57.4 percent.

The static code table may be a mapping table of a uniform numerical value and a coding segment, or different mapping tables may be set according to the difference of the same length code, the matching length code and the offset code, or only two mapping tables are set for mixed use. For example, the static code table may be divided into a first code table and a second code table, and the same-length code and the offset code use the first code table, and the matching-length code uses the second code table. The setting of the static code table may be performed according to actual needs, and is not limited specifically herein.

Further, the phrase length of the same code and the matching code is not less than a preset length threshold.

It can be known from the above embodiments that, because the same encoding and matching encoding requires more encoding information to be added to obtain an encoding segment, if the phrase is too short, the optimization effect of compression cannot be achieved. For this purpose, a length threshold value, for example, 3 or 4, needs to be preset, and when traversing and dividing the data to be transmitted into phrases according to compression conditions, it is ensured that the length of the phrases of the same encoding and matching encoding is not less than the length threshold value, and all the phrases less than the length threshold value are defined as uncompressed encoding. The length threshold cannot be too short or too long, and can be set and adjusted according to actual needs, and different length thresholds can be set for the same code and the matching code respectively, which is not specifically limited herein.

Accordingly, when encoding the phrase length, a length threshold may be subtracted from the phrase length, and then the corresponding length code may be looked up through the static code table.

Further, the code lengths of the same-length code, the matching-length code and the offset code are related to the frequency of occurrence of the corresponding numerical value in the coded information.

In order to further compress the data, the encoding lengths of the same-length code, the matching-length code and the offset code are not certain constants, for example, the same-length code of phrase length 4 is 0001, and the same-length code of phrase length 8 is 01001 in the above embodiment, and it can be seen that the encoding lengths of the same-length code are different according to the corresponding values, and the same is true for the matching-length code and the offset code. The coding length corresponding to the commonly used numerical value is shortened as much as possible, while the coding length which is not commonly used can be properly lengthened, so that the compression ratio of the data to be transmitted can be further improved.

Fig. 2 is a flowchart of a method for compressing data reported by another terminal according to an embodiment of the present invention, and as shown in fig. 2, the method includes:

step S10, receiving the coding segment combination sent by the sending end; the method comprises the steps that a sending end reads data to be transmitted with preset length, the data to be transmitted are arranged by code words, the data to be transmitted are divided into at least one phrase according to the arrangement sequence of the code words and preset compression conditions, and the phrase at least comprises a coding type and coding information; then the transmitting end root obtains a coding segment corresponding to each phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain the coding segments of the phrase, and finally combining the corresponding coding segments by the sending end according to the arrangement sequence of each phrase in the data to be transmitted.

The receiving end receives the information sent by the sending end, the information is the combination of the coding segments, the coding segments are obtained by the sending end according to the obtained data to be transmitted and the coding rule, the specific process is as follows:

the sending end firstly obtains data to be transmitted which is ready to be sent to the receiving end, and the data to be transmitted is composed of a large number of code words through arrangement.

Wherein the compression conditions to be satisfied by the same coded phrase are: the code words forming the phrase are all the same code word, and the coding information of the phrase at least comprises the phrase length and the same code word forming the phrase.

Step S11, each coding segment is analyzed into corresponding phrases according to the decoding rule corresponding to the coding rule and the static code table, and the data to be transmitted is obtained after combination.

Fig. 3 is a schematic structural diagram of a transmitting end of a compression method for data reported by a terminal according to an embodiment of the present invention, where as shown in fig. 3, the transmitting end at least includes: an acquisition module 10, a segmentation module 11, an encoding module 12 and a sending module 13, wherein,

the obtaining module 10 is configured to read data to be transmitted with a preset length, where the data to be transmitted is composed of code word arrangements; the dividing module 11 is configured to divide the data to be transmitted into at least one phrase according to a preset compression condition and the arrangement order of the code words, where the phrase at least includes a coding type and coding information; the encoding module 12 is configured to obtain an encoding segment corresponding to each phrase according to an encoding rule corresponding to the encoding type and encoding information of each phrase; if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain a coding segment of the phrase; the sending module 13 is configured to combine the corresponding encoded segments according to the arrangement order of each phrase in the data to be transmitted, and then send the combined encoded segments to a receiving end, so that the receiving end parses each encoded segment into the corresponding phrase according to the decoding rule corresponding to the encoding rule and the static code table, and the data to be transmitted is obtained after the combination. In particular, the amount of the solvent to be used,

the obtaining module 10 first obtains data to be transmitted, which is to be sent to a receiving end, where the data to be transmitted is composed of a large number of code words through permutation.

The dividing module 11 traverses the data to be transmitted acquired by the acquiring module 10 according to the sequence of the arrangement of the code words, and divides the data to be transmitted into a plurality of phrases one by one according to a preset compression condition, wherein the phrases at least comprise one code word, and each phrase is defined with a corresponding coding type. The coding information of each phrase can also be obtained according to the compression condition.

The segmentation module 11 sends the obtained coding type and coding information of each phrase to the coding module 12. The encoding module 12 can encode the encoding information of each phrase according to the pre-stored encoding rule corresponding to each encoding type to obtain the encoding segment. If the encoding type is compressible encoding, the phrase length or the offset in the encoding information of the phrase needs to be compressed and encoded according to a pre-stored static code table, so as to obtain an encoding segment corresponding to the phrase.

And sending the obtained coding segments corresponding to each phrase to a sending module 13, combining the corresponding coding segments by the sending module 13 according to the arrangement sequence of the phrases in the data to be transmitted, and then sending the combined coding segments to a receiving end.

The apparatus provided in the embodiment of the present invention is configured to execute the method, and the functions of the apparatus refer to the method embodiment specifically, and detailed method flows thereof are not described herein again.

Fig. 4 is a schematic diagram of a receiving end structure of a compression method for terminal reported data according to an embodiment of the present invention, where as shown in fig. 4, the receiving end at least includes: a receiving module 20 and a decoding module 21, wherein,

the receiving module 20 is configured to receive a coded segment combination sent by a sending end; the method comprises the steps that a sending end reads data to be transmitted with preset length, the data to be transmitted are arranged by code words, the data to be transmitted are divided into at least one phrase according to the arrangement sequence of the code words and preset compression conditions, and the phrase at least comprises a coding type and coding information; then the transmitting end root obtains a coding segment corresponding to each phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on coding information of corresponding phrases according to a pre-stored static code table to obtain coding segments of the phrases, and finally combining the corresponding coding segments by the sending end according to the arrangement sequence of each phrase in the data to be transmitted; the decoding module 21 is configured to parse each coded segment into a corresponding phrase according to a decoding rule corresponding to the coding rule and the static code table, and obtain the data to be transmitted after combining the phrases. In particular, the amount of the solvent to be used,

the receiving module 20 receives information sent by the sending end, where the information is a combination of coding segments, and the coding segments are obtained by the sending end according to the obtained data to be transmitted and according to a coding rule, and the specific process is as follows:

When the receiving module 20 receives the combination of the encoded segments, the decoding module 21 identifies and analyzes the encoded segments according to the decoding rules corresponding to the encoding rules and the static code table, so as to obtain phrases corresponding to each encoded segment. And combining the phrases according to the sequence to obtain the data to be transmitted.

Fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention, and as shown in fig. 5, the electronic device includes: a processor (processor)601, a memory (memory)602, and a bus 603;

wherein, the processor 601 and the memory 602 complete the communication with each other through the bus 603;

the processor 601 is configured to call program instructions in the memory 602 to perform the methods provided by the above-mentioned method embodiments, for example, including: reading data to be transmitted with preset length, wherein the data to be transmitted is formed by arranging code words; dividing the data to be transmitted into at least one phrase according to a preset compression condition and the arrangement sequence of the code words, wherein the phrase at least comprises a coding type and coding information; obtaining a coding segment corresponding to the phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain a coding segment of the phrase; and combining the corresponding coded segments according to the arrangement sequence of each phrase in the data to be transmitted, and then sending the combined coded segments to a receiving end, so that the receiving end analyzes each coded segment into the corresponding phrase according to the decoding rule corresponding to the coding rule and the static code table, and combining to obtain the data to be transmitted.

Further, embodiments of the present invention disclose a computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions, which when executed by a computer, the computer is capable of performing the methods provided by the above-mentioned method embodiments, for example, comprising: reading data to be transmitted with preset length, wherein the data to be transmitted is formed by arranging code words; dividing the data to be transmitted into at least one phrase according to a preset compression condition and the arrangement sequence of the code words, wherein the phrase at least comprises a coding type and coding information; obtaining a coding segment corresponding to the phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain a coding segment of the phrase; and combining the corresponding coded segments according to the arrangement sequence of each phrase in the data to be transmitted, and then sending the combined coded segments to a receiving end, so that the receiving end analyzes each coded segment into the corresponding phrase according to the decoding rule corresponding to the coding rule and the static code table, and combining to obtain the data to be transmitted.

Further, an embodiment of the present invention provides a non-transitory computer-readable storage medium storing computer instructions, which cause the computer to perform the method provided by the above method embodiments, for example, including: reading data to be transmitted with preset length, wherein the data to be transmitted is formed by arranging code words; dividing the data to be transmitted into at least one phrase according to a preset compression condition and the arrangement sequence of the code words, wherein the phrase at least comprises a coding type and coding information; obtaining a coding segment corresponding to the phrase according to a coding rule corresponding to the coding type and coding information of each phrase; if the coding type is compressible coding, carrying out compression coding on the coding information of the corresponding phrase according to a pre-stored static code table to obtain a coding segment of the phrase; and combining the corresponding coded segments according to the arrangement sequence of each phrase in the data to be transmitted, and then sending the combined coded segments to a receiving end, so that the receiving end analyzes each coded segment into the corresponding phrase according to the decoding rule corresponding to the coding rule and the static code table, and combining to obtain the data to be transmitted.

Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.

The above-described embodiments of the electronic device and the like are merely illustrative, where the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may also be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. A compression method for terminal reported data is characterized by comprising the following steps:

wherein the coding type is uncompressed coding, same coding or matched coding; wherein the same code and the matching code are compressible codes, and accordingly, the compression conditions are specifically as follows:

if a code word combination which is the same as the permutation combination of the code words in the phrase exists in the data to be transmitted before the phrase, the coding type of the phrase is matched coding, and the coding information of the phrase at least comprises the length of the phrase and the offset between the phrase and the same code word combination;

the coding type of other phrases is uncompressed coding, and the coding information of the phrases at least comprises all code words composing the phrases;

2. The method according to claim 1, wherein the encoding rule is specifically:

3. The method according to claim 1 or 2, wherein the phrase length of the same code and the matching code is not less than a preset length threshold.

4. The method of claim 2, wherein the code lengths of the same-length code, the matching-length code and the offset code are related to how often the corresponding values appear in the encoded information.

5. A compression method for terminal reported data is characterized by comprising the following steps:

6. A sending end of a compression method for terminal reported data is characterized by comprising the following steps:

the coding type is uncompressed coding, same coding or matched coding; wherein the same code and the matching code are compressible codes, and accordingly, the compression conditions are specifically as follows:

7. A receiving end of a compression method for terminal reported data is characterized by comprising the following steps:

8. An electronic device, comprising a memory and a processor, wherein the processor and the memory communicate with each other via a bus; the memory stores program instructions executable by the processor, the processor invoking the program instructions to perform the method of any of claims 1 to 5.

9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 5.