CN117014520A - Data rapid transmission method based on compression algorithm - Google Patents
Data rapid transmission method based on compression algorithm Download PDFInfo
- Publication number
- CN117014520A CN117014520A CN202311290073.4A CN202311290073A CN117014520A CN 117014520 A CN117014520 A CN 117014520A CN 202311290073 A CN202311290073 A CN 202311290073A CN 117014520 A CN117014520 A CN 117014520A
- Authority
- CN
- China
- Prior art keywords
- data
- transmission
- transmitted
- compression
- result
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 191
- 230000006835 compression Effects 0.000 title claims abstract description 180
- 238000007906 compression Methods 0.000 title claims abstract description 180
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000012545 processing Methods 0.000 claims abstract description 36
- 238000012795 verification Methods 0.000 claims abstract description 14
- 230000009467 reduction Effects 0.000 claims description 25
- 230000006837 decompression Effects 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 5
- 230000000694 effects Effects 0.000 abstract description 2
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
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/04—Protocols for data compression, e.g. ROHC
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The application relates to the field of data rapid transmission, in particular to a data rapid transmission method based on a compression algorithm, which comprises the following steps: s1, acquiring a data to be transmitted primary compression label based on a compression algorithm by utilizing the data to be transmitted; s2, performing traversal processing according to the data to be transmitted primary compression label to obtain a transmission traversal result; s3, completing data rapid transmission according to a transmission traversing result by utilizing the data to be transmitted, in the data transmission, alternately using lossy compression and lossless compression, performing processing on the data by using the lossy compression in the early stage, traversing the data in a transmitting end and a receiving end, subsequently reducing the data size according to the traversing result and then using the lossless compression to improve the transmission speed, and finally creatively providing mutual verification of the lossy compression result and the lossless compression result in the receiving end, so that the final accuracy of data transmission is ensured, and the transmission effect is further improved on the premise of not changing a communication transmission line.
Description
Technical Field
The application relates to the field of data rapid transmission, in particular to a data rapid transmission method based on a compression algorithm.
Background
In a fixed communication line, a large amount of data transmission can cause the problems of reduced line speed, delayed line and the like, wherein the transmission of partial data has the phenomena of repetition or overlapping and the like, the communication transmission pressure of partial lines can be solved by utilizing a common compression algorithm to compress the transmission data in the traditional scheme, but the transmission speed can be further improved by classifying the compression algorithm and combining the data, and the transmission efficiency of the line is improved.
Disclosure of Invention
Aiming at the defects of the prior art, the application provides a data rapid transmission method based on a compression algorithm, which can improve transmission efficiency and perform real-time verification after transmission by alternately combining lossy compression and lossless compression.
In order to achieve the above object, the present application provides a data rapid transmission method based on a compression algorithm, including:
s1, acquiring a data to be transmitted primary compression label based on a compression algorithm by utilizing the data to be transmitted;
s2, performing traversal processing according to the data to be transmitted primary compression label to obtain a transmission traversal result;
and S3, completing rapid data transmission according to the transmission traversal result by utilizing the data to be transmitted.
Preferably, the obtaining the preliminary compression tag of the data to be transmitted based on the compression algorithm by using the data to be transmitted includes:
s1-1, judging whether the data to be transmitted is text data, if so, obtaining a preliminary compression label of the data to be transmitted by using the data to be transmitted based on a lossless compression algorithm, otherwise, executing S1-2 after obtaining the data attribute of the data to be transmitted;
s1-2, obtaining a preliminary compression label of the data to be transmitted based on a lossless compression algorithm by utilizing the data attribute of the data to be transmitted.
Further, performing traversal processing according to the data to be transmitted primary compression label to obtain a transmission traversal result includes:
s2-1, performing traversal processing in a transmitting end by utilizing the data to be transmitted primary compression label to obtain a transmitting traversal result;
s2-2, performing secondary traversal processing in the receiving end according to the transmission traversal result to obtain a basic transmission traversal result;
s2-3, obtaining a transmission traversal result by using the basic transmission traversal result.
Further, performing traversal processing in the transmitting end by using the data to be transmitted primary compression label to obtain a transmission traversal result includes:
s2-1-1, judging whether a history preliminary compression label completely consistent with a data preliminary compression label to be transmitted exists in the transmitting end, if so, executing S2-1-2, otherwise, using the data preliminary compression label to be transmitted as a transmission traversal result;
s2-1-2, judging whether the number of the history primary compression labels is 1, if yes, executing S2-1-3, otherwise, executing S2-1-4;
s2-1-3, judging whether the data which correspond to the historical primary compression label and are transmitted are identical to the data to be transmitted, if yes, using the historical primary compression label as a transmission traversal result, otherwise, using the data attribute which is identical to the data to be transmitted in the transmitted data to establish a historical secondary compression label based on a lossless compression algorithm as the transmission traversal result;
s2-1-4, judging whether each history primary compression label corresponds to the same transmitted data, if so, returning to S2-1-3, otherwise, using the data primary compression label to be transmitted as a transmission traversal result.
Further, performing secondary traversal processing in the receiving end according to the sending traversal result to obtain a basic transmission traversal result includes:
s2-2-1, judging whether the transmission traversing result has corresponding transmitted data in a receiving end, if so, executing S2-2-2, otherwise, giving up processing;
s2-2-2, judging whether the transmission traversal result corresponds to a history primary compression label, if so, performing decompression processing by using the history primary compression label to obtain history fuzzy complete reduction data as history fuzzy reduction data, otherwise, performing memorial decompression processing by using the history secondary compression label to obtain history fuzzy incomplete reduction data as history fuzzy reduction data;
s2-2-3, obtaining a basic transmission traversal result by utilizing the history fuzzy reduction data;
wherein, the transmitted data in the receiving end and the transmitted data in the transmitting end are in a corresponding relation.
Further, obtaining a basic transmission traversal result by using the history fuzzy reduction data comprises:
acquiring Euclidean distance between the historical fuzzy reduction data and the received data corresponding to the historical fuzzy reduction data as historical data similarity;
judging whether the history fuzzy reduction data corresponds to a history preliminary compression label, if so, using the similarity of the history data as a first basic transmission traversal result, otherwise, using the similarity of the history data as a second basic transmission traversal result;
and transmitting the traversing result by using the first basic transmitting traversing result or the second basic transmitting traversing result as a basic transmitting traversing result.
Further, obtaining the transmission traversal result by using the basic transmission traversal result includes:
s2-3-1, judging whether the basic transmission traversal result exists, if yes, executing S2-3-2, otherwise, transmitting the traversal result to be empty;
s2-3-2, judging whether the basic transmission traversing result is a first basic transmission traversing result, if so, executing S2-3-3, otherwise, judging that the transmission traversing result is partial history corresponding data;
s2-3-3, judging whether the basic transmission traversing result is 1, if yes, determining that the transmission traversing result is the history corresponding data, otherwise, determining that the transmission traversing result is the history corresponding data.
Further, completing the rapid data transmission according to the transmission traversal result by using the data to be transmitted includes:
when the corresponding transmission traversing result of the data to be transmitted is empty, the data to be transmitted is sent to a receiving end by a sending end to finish the rapid data transmission;
when the corresponding transmission traversing result of the data to be transmitted is that the history corresponding data exists, the received data corresponding to the transmission traversing result in the receiving end is used as the current received data corresponding to the data to be transmitted to complete the rapid data transmission;
when the corresponding transmission traversing result of the data to be transmitted is that the history corresponding data does not exist, completing the rapid data transmission by utilizing the data to be transmitted and the transmission traversing result;
when the corresponding transmission traversing result of the data to be transmitted is that part of historical corresponding data exists, the data to be transmitted is utilized to carry out brief transmission according to the transmission traversing result so as to complete rapid data transmission.
Further, completing the data fast transmission by using the data to be transmitted and the transmission traversal result includes:
judging whether the data to be transmitted is text data or not, if so, obtaining a transmission verification tag based on a lossy compression algorithm by using the data to be transmitted, otherwise, obtaining the transmission verification tag based on the lossy compression algorithm by using the data attribute of the data to be transmitted;
obtaining lossless compression data to be transmitted based on a lossless compression algorithm by utilizing the data to be transmitted;
the lossless compression data to be transmitted is sent to a receiving end from a sending end to obtain received lossless compression data;
and in the receiving end, judging whether the transmission verification tag corresponding to the lossless compression data to be transmitted is a subset of the history preliminary compression tag corresponding to the transmission traversal result of the data to be transmitted, if so, decompressing the received lossless compression data in the receiving end to finish data rapid transmission, otherwise, discarding the processing.
Further, performing brief transmission according to the transmission traversal result by using the data to be transmitted to complete quick data transmission includes:
acquiring the same data of the received data and the data to be transmitted in the receiving end as unnecessary data;
removing unnecessary data in the data to be transmitted at a transmitting end to obtain partial data to be transmitted;
obtaining partial data to be transmitted in a lossless compression mode based on a lossless compression algorithm by utilizing the partial data to be transmitted;
transmitting the partial lossless compression data to be transmitted from the transmitting end to the receiving end by utilizing the partial lossless compression data to be transmitted to obtain partial received lossless compression data;
judging whether the part of received lossless compression data and unnecessary data in the receiving end correspond or not, if so, completing data quick transmission by using the part of received lossless compression data and unnecessary data, otherwise, discarding the processing.
Compared with the closest prior art, the application has the following beneficial effects:
in data transmission, lossy compression and lossless compression are alternately used, the advantages of the lossy compression and the lossless compression are exerted, the data is processed by the lossy compression in the early stage and then is traversed in a transmitting end and a receiving end, the data size is reduced by the lossless compression according to the traversing result, the transmission speed is improved, and finally, mutual verification of the lossy compression result and the lossless compression result is creatively provided in the receiving end, so that the final accuracy of data transmission is ensured, and the transmission effect is further improved on the premise of not changing a communication transmission line.
Drawings
Fig. 1 is a flowchart of a data fast transmission method based on a compression algorithm.
Detailed Description
The following describes the embodiments of the present application in further detail with reference to the drawings.
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Example 1: the application provides a data rapid transmission method based on a compression algorithm, as shown in figure 1, comprising the following steps:
s1, acquiring a data to be transmitted primary compression label based on a compression algorithm by utilizing the data to be transmitted;
s2, performing traversal processing according to the data to be transmitted primary compression label to obtain a transmission traversal result;
and S3, completing rapid data transmission according to the transmission traversal result by utilizing the data to be transmitted.
S1 specifically comprises:
s1-1, judging whether the data to be transmitted is text data, if so, obtaining a preliminary compression label of the data to be transmitted by using the data to be transmitted based on a lossless compression algorithm, otherwise, executing S1-2 after obtaining the data attribute of the data to be transmitted;
s1-2, obtaining a preliminary compression label of the data to be transmitted based on a lossless compression algorithm by utilizing the data attribute of the data to be transmitted.
In this embodiment, a data fast transmission method based on a compression algorithm, where the lossless compression algorithm is capable of reconstructing, without distortion, from compressed data, and accurately restoring original data. The method can be used for occasions with strict requirements on the accuracy of data, such as compression of executable files and common files and compression of magnetic discs, and also can be used for compression of multimedia data. The compression ratio of this method is relatively small. Such as differential coding, RLE, huffman coding, LZW coding, arithmetic coding.
In this embodiment, a data rapid transmission method based on a compression algorithm, where the data attribute includes, but is not limited to, a nominal attribute, a binary attribute, an ordinal attribute, a numerical attribute, a discrete attribute, and a continuous attribute of data, and in practical application, one of the above data attributes may be selected as a data attribute carrying method according to a specific type of the data for processing.
S2 specifically comprises:
s2-1, performing traversal processing in a transmitting end by utilizing the data to be transmitted primary compression label to obtain a transmitting traversal result;
s2-2, performing secondary traversal processing in the receiving end according to the transmission traversal result to obtain a basic transmission traversal result;
s2-3, obtaining a transmission traversal result by using the basic transmission traversal result.
S2-1 comprises:
s2-1-1, judging whether a history preliminary compression label completely consistent with a data preliminary compression label to be transmitted exists in the transmitting end, if so, executing S2-1-2, otherwise, using the data preliminary compression label to be transmitted as a transmission traversal result;
s2-1-2, judging whether the number of the history primary compression labels is 1, if yes, executing S2-1-3, otherwise, executing S2-1-4;
s2-1-3, judging whether the data which correspond to the historical primary compression label and are transmitted are identical to the data to be transmitted, if yes, using the historical primary compression label as a transmission traversal result, otherwise, using the data attribute which is identical to the data to be transmitted in the transmitted data to establish a historical secondary compression label based on a lossless compression algorithm as the transmission traversal result;
s2-1-4, judging whether each history primary compression label corresponds to the same transmitted data, if so, returning to S2-1-3, otherwise, using the data primary compression label to be transmitted as a transmission traversal result.
S2-2 comprises:
s2-2-1, judging whether the transmission traversing result has corresponding transmitted data in a receiving end, if so, executing S2-2-2, otherwise, giving up processing;
s2-2-2, judging whether the transmission traversal result corresponds to a history primary compression label, if so, performing decompression processing by using the history primary compression label to obtain history fuzzy complete reduction data as history fuzzy reduction data, otherwise, performing memorial decompression processing by using the history secondary compression label to obtain history fuzzy incomplete reduction data as history fuzzy reduction data;
s2-2-3, obtaining a basic transmission traversal result by utilizing the history fuzzy reduction data;
wherein, the transmitted data in the receiving end and the transmitted data in the transmitting end are in a corresponding relation.
S2-2-3 specifically comprises:
s2-2-3-1, acquiring Euclidean distance between the historical fuzzy reduction data and the received data corresponding to the historical fuzzy reduction data as the similarity of the historical data;
s2-2-3-2, judging whether the historical fuzzy reduction data corresponds to a historical preliminary compression label, if so, using the historical data similarity as a first basic transmission traversal result, and if not, using the historical data similarity as a second basic transmission traversal result;
s2-2-3-3, using the first basic transmission traversal result or the second basic transmission traversal result as a basic transmission traversal result.
S2-3 specifically comprises:
s2-3-1, judging whether the basic transmission traversal result exists, if yes, executing S2-3-2, otherwise, transmitting the traversal result to be empty;
s2-3-2, judging whether the basic transmission traversing result is a first basic transmission traversing result, if so, executing S2-3-3, otherwise, judging that the transmission traversing result is partial history corresponding data;
s2-3-3, judging whether the basic transmission traversing result is 1, if yes, determining that the transmission traversing result is the history corresponding data, otherwise, determining that the transmission traversing result is the history corresponding data.
S3 specifically comprises:
s3-1, when a corresponding transmission traversing result of the data to be transmitted is empty, the data to be transmitted is sent to a receiving end from a sending end to complete rapid data transmission;
s3-2, when the transmission traversing result corresponding to the data to be transmitted is that the history corresponding data exists, the received data corresponding to the transmission traversing result in the receiving end is used as the data to be transmitted corresponding to the current receiving data to finish the rapid data transmission;
s3-3, when the corresponding transmission traversing result of the data to be transmitted is that the history corresponding data does not exist, completing the rapid data transmission by utilizing the data to be transmitted and the transmission traversing result;
and S3-4, when the corresponding transmission traversing result of the data to be transmitted is that part of the corresponding historical data exists, carrying out brief transmission according to the transmission traversing result by utilizing the data to be transmitted to finish quick data transmission.
S3-3 specifically comprises:
s3-3-1, judging whether the data to be transmitted is text data, if so, obtaining a transmission verification tag based on a lossy compression algorithm by using the data to be transmitted, otherwise, obtaining the transmission verification tag based on the lossy compression algorithm by using the data attribute of the data to be transmitted;
s3-3-2, obtaining lossless compression data to be transmitted based on a lossless compression algorithm by using the data to be transmitted;
s3-3-3, transmitting the lossless compression data to be transmitted from a transmitting end to a receiving end by utilizing the lossless compression data to be transmitted to obtain received lossless compression data;
s3-3-4, judging whether the transmission verification tag corresponding to the lossless compression data to be transmitted is a subset of the history preliminary compression tag corresponding to the transmission traversal result of the data to be transmitted in the receiving end, if so, decompressing the received lossless compression data in the receiving end to finish data rapid transmission, otherwise, giving up processing.
In this embodiment, in a data fast transmission method based on a compression algorithm, the lossy compression is distorted, the original data cannot be completely and accurately recovered, and the reconstructed data is only an approximation of the original data. The method can be used for occasions with low requirements on the accuracy of data, such as the compression of multimedia data. The compression ratio of the method is large. Such as predictive coding, perceptual coding, fractal compression, wavelet compression, JPEG/MPEG.
S3-4 specifically comprises:
s3-4-1, acquiring the same data of the received data and the data to be transmitted in the receiving end as unnecessary data;
s3-4-2, removing unnecessary data in the data to be transmitted at a transmitting end to obtain partial data to be transmitted;
s3-4-3, obtaining partial data to be transmitted in a lossless compression mode based on a lossless compression algorithm by utilizing the partial data to be transmitted;
s3-4-4, transmitting the partial lossless compression data to be transmitted from the transmitting end to the receiving end by utilizing the partial lossless compression data to be transmitted to obtain partial received lossless compression data;
s3-4-5, judging whether the part of received lossless compression data and unnecessary data in the receiving end correspond to each other, if so, completing data quick transmission by using the part of received lossless compression data and the unnecessary data, otherwise, discarding the processing.
In this embodiment, the method for quickly transmitting data based on the compression algorithm uses the characteristic of larger compression ratio of lossy compression, saves the occupation of a hardware port or a communication line as much as possible, and simultaneously uses the complete recovery of lossless compression to perform actual transmission, and finally uses the combination verification of the two compression methods to realize the final verification after data transmission.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical aspects of the present application and not for limiting the same, and although the present application has been described in detail with reference to the above embodiments, it should be understood by those of ordinary skill in the art that: modifications and equivalents may be made to the specific embodiments of the application without departing from the spirit and scope of the application, which is intended to be covered by the claims.
Claims (10)
1. The data rapid transmission method based on the compression algorithm is characterized by comprising the following steps of:
s1, acquiring a data to be transmitted primary compression label based on a compression algorithm by utilizing the data to be transmitted;
s2, performing traversal processing according to the data to be transmitted primary compression label to obtain a transmission traversal result;
and S3, completing rapid data transmission according to the transmission traversal result by utilizing the data to be transmitted.
2. The method for quickly transmitting data based on a compression algorithm according to claim 1, wherein the obtaining the preliminary compression tag of the data to be transmitted based on the compression algorithm by using the data to be transmitted comprises:
s1-1, judging whether the data to be transmitted is text data, if so, obtaining a preliminary compression label of the data to be transmitted by using the data to be transmitted based on a lossless compression algorithm, otherwise, executing S1-2 after obtaining the data attribute of the data to be transmitted;
s1-2, obtaining a preliminary compression label of the data to be transmitted based on a lossless compression algorithm by utilizing the data attribute of the data to be transmitted.
3. The method for quickly transmitting data based on a compression algorithm according to claim 2, wherein performing traversal processing according to the data to be transmitted primary compression label to obtain a transmission traversal result comprises:
s2-1, performing traversal processing in a transmitting end by utilizing the data to be transmitted primary compression label to obtain a transmitting traversal result;
s2-2, performing secondary traversal processing in the receiving end according to the transmission traversal result to obtain a basic transmission traversal result;
s2-3, obtaining a transmission traversal result by using the basic transmission traversal result.
4. The method for quickly transmitting data based on a compression algorithm as claimed in claim 3, wherein performing traversal processing in the transmitting end by using the data to be transmitted primary compression tag to obtain a transmission traversal result comprises:
s2-1-1, judging whether a history preliminary compression label completely consistent with a data preliminary compression label to be transmitted exists in the transmitting end, if so, executing S2-1-2, otherwise, using the data preliminary compression label to be transmitted as a transmission traversal result;
s2-1-2, judging whether the number of the history primary compression labels is 1, if yes, executing S2-1-3, otherwise, executing S2-1-4;
s2-1-3, judging whether the data which correspond to the historical primary compression label and are transmitted are identical to the data to be transmitted, if yes, using the historical primary compression label as a transmission traversal result, otherwise, using the data attribute which is identical to the data to be transmitted in the transmitted data to establish a historical secondary compression label based on a lossless compression algorithm as the transmission traversal result;
s2-1-4, judging whether each history primary compression label corresponds to the same transmitted data, if so, returning to S2-1-3, otherwise, using the data primary compression label to be transmitted as a transmission traversal result.
5. The method for fast data transmission based on a compression algorithm according to claim 4, wherein performing a secondary traversal process in the receiving end according to the transmission traversal result to obtain a basic transmission traversal result comprises:
s2-2-1, judging whether the transmission traversing result has corresponding transmitted data in a receiving end, if so, executing S2-2-2, otherwise, giving up processing;
s2-2-2, judging whether the transmission traversal result corresponds to a history primary compression label, if so, performing decompression processing by using the history primary compression label to obtain history fuzzy complete reduction data as history fuzzy reduction data, otherwise, performing memorial decompression processing by using the history secondary compression label to obtain history fuzzy incomplete reduction data as history fuzzy reduction data;
s2-2-3, obtaining a basic transmission traversal result by utilizing the history fuzzy reduction data;
wherein, the transmitted data in the receiving end and the transmitted data in the transmitting end are in a corresponding relation.
6. The method for rapid data transmission based on a compression algorithm of claim 5, wherein obtaining a basic transmission traversal result using the history fuzzy restored data comprises:
acquiring Euclidean distance between the historical fuzzy reduction data and the received data corresponding to the historical fuzzy reduction data as historical data similarity;
judging whether the history fuzzy reduction data corresponds to a history preliminary compression label, if so, using the similarity of the history data as a first basic transmission traversal result, otherwise, using the similarity of the history data as a second basic transmission traversal result;
and transmitting the traversing result by using the first basic transmitting traversing result or the second basic transmitting traversing result as a basic transmitting traversing result.
7. The method for quickly transmitting data based on a compression algorithm according to claim 6, wherein obtaining the transmission traversal result using the basic transmission traversal result comprises:
s2-3-1, judging whether the basic transmission traversal result exists, if yes, executing S2-3-2, otherwise, transmitting the traversal result to be empty;
s2-3-2, judging whether the basic transmission traversing result is a first basic transmission traversing result, if so, executing S2-3-3, otherwise, judging that the transmission traversing result is partial history corresponding data;
s2-3-3, judging whether the basic transmission traversing result is 1, if yes, determining that the transmission traversing result is the history corresponding data, otherwise, determining that the transmission traversing result is the history corresponding data.
8. The method for rapidly transmitting data based on a compression algorithm as claimed in claim 7, wherein completing rapid data transmission according to the transmission traversal result using the data to be transmitted comprises:
when the corresponding transmission traversing result of the data to be transmitted is empty, the data to be transmitted is sent to a receiving end by a sending end to finish the rapid data transmission;
when the corresponding transmission traversing result of the data to be transmitted is that the history corresponding data exists, the received data corresponding to the transmission traversing result in the receiving end is used as the current received data corresponding to the data to be transmitted to complete the rapid data transmission;
when the corresponding transmission traversing result of the data to be transmitted is that the history corresponding data does not exist, completing the rapid data transmission by utilizing the data to be transmitted and the transmission traversing result;
when the corresponding transmission traversing result of the data to be transmitted is that part of historical corresponding data exists, the data to be transmitted is utilized to carry out brief transmission according to the transmission traversing result so as to complete rapid data transmission.
9. The method for quickly transmitting data based on a compression algorithm as claimed in claim 8, wherein completing the quick transmission of data using the data to be transmitted and the transmission traversal result comprises:
judging whether the data to be transmitted is text data or not, if so, obtaining a transmission verification tag based on a lossy compression algorithm by using the data to be transmitted, otherwise, obtaining the transmission verification tag based on the lossy compression algorithm by using the data attribute of the data to be transmitted;
obtaining lossless compression data to be transmitted based on a lossless compression algorithm by utilizing the data to be transmitted;
the lossless compression data to be transmitted is sent to a receiving end from a sending end to obtain received lossless compression data;
and in the receiving end, judging whether the transmission verification tag corresponding to the lossless compression data to be transmitted is a subset of the history preliminary compression tag corresponding to the transmission traversal result of the data to be transmitted, if so, decompressing the received lossless compression data in the receiving end to finish data rapid transmission, otherwise, discarding the processing.
10. The method for rapidly transmitting data based on a compression algorithm as claimed in claim 8, wherein performing brief transmission using the data to be transmitted according to the transmission traversal result comprises:
acquiring the same data of the received data and the data to be transmitted in the receiving end as unnecessary data;
removing unnecessary data in the data to be transmitted at a transmitting end to obtain partial data to be transmitted;
obtaining partial data to be transmitted in a lossless compression mode based on a lossless compression algorithm by utilizing the partial data to be transmitted;
transmitting the partial lossless compression data to be transmitted from the transmitting end to the receiving end by utilizing the partial lossless compression data to be transmitted to obtain partial received lossless compression data;
judging whether the part of received lossless compression data and unnecessary data in the receiving end correspond or not, if so, completing data quick transmission by using the part of received lossless compression data and unnecessary data, otherwise, discarding the processing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311290073.4A CN117014520B (en) | 2023-10-08 | 2023-10-08 | Data rapid transmission method based on compression algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311290073.4A CN117014520B (en) | 2023-10-08 | 2023-10-08 | Data rapid transmission method based on compression algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117014520A true CN117014520A (en) | 2023-11-07 |
| CN117014520B CN117014520B (en) | 2024-02-09 |
Family
ID=88573091
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311290073.4A Active CN117014520B (en) | 2023-10-08 | 2023-10-08 | Data rapid transmission method based on compression algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117014520B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117278439A (en) * | 2023-11-23 | 2023-12-22 | 广东广宇科技发展有限公司 | Communication quick verification method based on compression algorithm |
| CN117478707A (en) * | 2023-12-27 | 2024-01-30 | 天津数智物联科技有限公司 | Multi-target energy management data transmission method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110535869A (en) * | 2019-09-05 | 2019-12-03 | 厦门市美亚柏科信息股份有限公司 | A kind of data transmission method based on compression algorithm, terminal device and storage medium |
| CN110958265A (en) * | 2019-12-16 | 2020-04-03 | 上海英方软件股份有限公司 | Real-time forwarding method and device based on market data |
| CN114363419A (en) * | 2020-09-28 | 2022-04-15 | 中兴通讯股份有限公司 | Transmission method, equipment and storage medium based on NETCONF protocol |
| US11463559B1 (en) * | 2021-08-24 | 2022-10-04 | Lyft, Inc. | Compressing digital metrics for transmission across a network utilizing a graph-based compression dictionary and time slice delta compression |
| CN115221091A (en) * | 2021-04-21 | 2022-10-21 | 华为技术有限公司 | Method, system and computer equipment for aggregating communication |
| CN116232762A (en) * | 2023-05-05 | 2023-06-06 | 广东广宇科技发展有限公司 | Encryption data transmission method based on quantum key |
-
2023
- 2023-10-08 CN CN202311290073.4A patent/CN117014520B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110535869A (en) * | 2019-09-05 | 2019-12-03 | 厦门市美亚柏科信息股份有限公司 | A kind of data transmission method based on compression algorithm, terminal device and storage medium |
| CN110958265A (en) * | 2019-12-16 | 2020-04-03 | 上海英方软件股份有限公司 | Real-time forwarding method and device based on market data |
| CN114363419A (en) * | 2020-09-28 | 2022-04-15 | 中兴通讯股份有限公司 | Transmission method, equipment and storage medium based on NETCONF protocol |
| CN115221091A (en) * | 2021-04-21 | 2022-10-21 | 华为技术有限公司 | Method, system and computer equipment for aggregating communication |
| CN116257494A (en) * | 2021-04-21 | 2023-06-13 | 华为技术有限公司 | Method, system and computer equipment for aggregating communication |
| US11463559B1 (en) * | 2021-08-24 | 2022-10-04 | Lyft, Inc. | Compressing digital metrics for transmission across a network utilizing a graph-based compression dictionary and time slice delta compression |
| CN116232762A (en) * | 2023-05-05 | 2023-06-06 | 广东广宇科技发展有限公司 | Encryption data transmission method based on quantum key |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117278439A (en) * | 2023-11-23 | 2023-12-22 | 广东广宇科技发展有限公司 | Communication quick verification method based on compression algorithm |
| CN117278439B (en) * | 2023-11-23 | 2024-02-09 | 广东广宇科技发展有限公司 | Communication quick verification method based on compression algorithm |
| CN117478707A (en) * | 2023-12-27 | 2024-01-30 | 天津数智物联科技有限公司 | Multi-target energy management data transmission method |
| CN117478707B (en) * | 2023-12-27 | 2024-05-07 | 天津数智物联科技有限公司 | Multi-target energy management data transmission method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117014520B (en) | 2024-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN117014520B (en) | Data rapid transmission method based on compression algorithm | |
| TW502178B (en) | Efficient and lossless conversion for transmission or storage of data | |
| CN109379598B (en) | Image lossless compression method based on FPGA | |
| CN112565777B (en) | Deep learning model-based video data transmission method, system, medium and device | |
| CN110021369B (en) | Gene sequencing data compression and decompression method, system and computer readable medium | |
| CN115278777A (en) | Data transmission method for vehicle-mounted purifier | |
| Xiang et al. | Adaptive and dynamic multi-grouping scheme for absolute moment block truncation coding | |
| WO2024061316A1 (en) | Data compression method, data decompression method, and related device | |
| CN112631434B (en) | Deep learning-based vibrotactile coding and decoding method | |
| US20140340393A1 (en) | System and method for error controllable repetitive structure discovery based compression | |
| US20230154053A1 (en) | System and method for scene graph lossless compression by context-based graph convolution | |
| CN100551066C (en) | The implementation method of encoder and adaptive arithmetic code and device | |
| CN115239563A (en) | Point cloud attribute lossy compression device and method based on neural network | |
| US8537038B1 (en) | Efficient compression method for sorted data representations | |
| Shportko et al. | Development of Predictors to Increase the Efficiency of Progressive Hierarchic Context-Independent Compression of Images Without Losses. | |
| Reyes Zambrano | GPS trajectory compression algorithm | |
| CN117278439B (en) | Communication quick verification method based on compression algorithm | |
| CN115190182A (en) | Data lossless compression method, device and equipment suitable for Beidou system | |
| CN114598329B (en) | Lightweight lossless compression method for rapid decompression application | |
| WO2021139796A1 (en) | Method for constructing morton codes, encoder, decoder, and storage medium | |
| CN115082723A (en) | Frontend operation system and method for bolt defect identification and robot | |
| CN115914630B (en) | Image compression method, device, equipment and storage medium | |
| CN102572425A (en) | Huffman decoding method | |
| WO2019191904A1 (en) | Data processing method and device | |
| Sijabat | IMPLEMENTATION OF QUANTITATION TECHNIQUES TO PERFORM RGB IMAGE COMPRESSION |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |