CN115765756A - Lossless data compression method, system and device for high-speed transparent transmission - Google Patents
Lossless data compression method, system and device for high-speed transparent transmission Download PDFInfo
- Publication number
- CN115765756A CN115765756A CN202211599846.2A CN202211599846A CN115765756A CN 115765756 A CN115765756 A CN 115765756A CN 202211599846 A CN202211599846 A CN 202211599846A CN 115765756 A CN115765756 A CN 115765756A
- Authority
- CN
- China
- Prior art keywords
- data
- compressed
- compression
- bit width
- lossless
- 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.)
- Pending
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
A high-speed transparent transmission lossless data compression method, system and device, it is a data processing field, characterized by that, analyze and count to the sample data in advance, obtain the preconfiguration parameter meeting compression requirement, then carry on the online real-time lossless compression to the data received according to the preconfiguration parameter, do not need the context information, can support to higher processing speed and lower delay; the lossless data compression method, system and device for high-speed transparent transmission, disclosed by the invention, have the advantages of simple compression process, less resource occupation and flexible bandwidth expansion, can meet the online lossless compression requirement for high-speed transmission, and occupy less hardware circuit resources.
Description
Technical Field
The invention belongs to the field of data processing, and particularly relates to a lossless data compression method, system and device for high-speed transparent transmission.
Background
Digital technology is influencing aspects of our lives, communication signals, images, voice and the like are collected, transmitted and recorded in a digital form, and data needing to be processed is increasing at an exponential rate. An important problem faced today is that the transmission and storage of such information takes up a huge amount of space, and the transmission speed and real-time performance of the data are demanding. On the other hand, the data collected in most scenes are not completely random, but have certain regularity: for example, only a small portion of the image data of adjacent frames in a video image changes; or voice signal data, only a portion is a valid voice signal, most likely background noise, etc. At present, the compression processing for such data generally includes associating context data, performing comparison calculation to find a rule, and performing encoding compression according to the found rule. However, most of the existing processing methods for the data have the problems of large CPU load, complex compression circuit, large delay, difficult meeting of bandwidth requirements, insufficient expansibility and the like.
Disclosure of Invention
The present invention is directed to solve the above problems, and provides a lossless data compression method, system and apparatus for high-speed transparent transmission based on preset parameters.
The invention provides a lossless data compression method for high-speed transparent transmission, which comprises the steps of firstly, pre-analyzing sample data, and obtaining pre-configured parameters according to a pre-analysis result; and then performing data compression on the data to be compressed according to the pre-configured parameters.
Further, the lossless data compression method for high-speed transparent transmission according to the present invention, wherein the process of pre-analyzing the sample data comprises:
dividing the sample data into a plurality of data units according to a preset granularity;
carrying out statistical analysis on the data units, and calculating the probability of the occurrence of different types of data code patterns in the sample data;
classifying the data code patterns according to the occurrence probability of the data code patterns;
according to different classifications, a classification identifier with a fixed length is correspondingly arranged for each class of data code pattern;
setting the code length after compression coding for the data corresponding to each type of data code pattern according to the coding rule according to different classifications;
the pre-configuration parameters comprise preset granularity, classification of data code patterns, classification identifiers and code length.
Further, in the lossless data compression method for high-speed transparent transmission, the preset granularity is one or more complete bytes; the classified numerical value of the data code pattern is n-th power of 2; the classification identifier is n-bit binary digits in length.
Further, the lossless data compression method for high-speed transparent transmission of the present invention comprises the following encoding rules: according to the occurrence probability of the data code pattern from high to low, the code length of the data after compression coding is from short to long; wherein, the shortest code length is 0, and the longest code length is the original data length.
Further, the lossless data compression method for high-speed transparent transmission according to the present invention, wherein the process of performing data compression on the data to be compressed according to the preconfigured parameters comprises:
firstly, carrying out bit width conversion on data to be compressed, and converting the bit width into a multiple of the preset granularity;
according to the classification of the data code pattern, identifying the classification of the data to be compressed, and generating a corresponding classification identifier;
according to the classification of the data code pattern, performing data compression on data to be compressed according to the code length after the setting of the compression coding, and outputting the compressed data;
and carrying out data alignment processing on the classification identifier and the compressed data, outputting a new compressed data formed according to a preset sequence, and completing data compression.
Further, the lossless data compression method for high-speed transparent transmission of the present invention, the data alignment process includes: if the data bit width of the new compressed data is less than the bit width of the output data, temporarily storing the data and splicing the data with the next received data; if the spliced bit width is larger than or equal to the required output data bit width, sending out effective compressed data with aligned bit width; the exceeded digit is continuously stored and is continuously spliced with the next received data; and if the spliced data bit width is still smaller than the required output data bit width, latching and waiting for the merging processing with the next data.
Further, according to the lossless data compression method for high-speed transparent transmission of the present invention, the output speed of the new compressed data can be adjusted by inserting an invalid code that does not conform to the aforementioned encoding rule into the data stream.
In a second aspect, the invention provides a high-speed transparent transmission lossless data compression system, which comprises a data receiving module, a data bit width conversion module, a data compression coding module, a data alignment module and a data sending control module;
the data receiving module is used for acquiring data to be compressed from an interface or a cache;
the data bit width conversion module is used for firstly performing bit width conversion on data to be compressed and converting the bit width into a multiple of the preset granularity;
the data compression coding module is used for identifying the classification of the data to be compressed according to the classification of the data code pattern and generating a corresponding classification identifier; according to the classification of the data code pattern, performing data compression on data to be compressed according to the code length after the setting of the compression coding, and outputting the compressed data;
the data alignment output module is used for performing data alignment processing on the classification identifier and the compressed data and outputting a new compressed data formed according to a preset sequence;
and the data sending control module is used for outputting the compressed data.
If the bit width of the new compressed data is less than the bit width of the output data, temporarily storing the data, and splicing and merging the data with the next received data. And if the spliced data bit width is larger than or equal to the output data bit width, sending out effective compressed data with aligned bit width, continuously latching the part exceeding the data bit width, and continuously splicing the part with the next received data. And if the spliced data bit width is still smaller than the required output data bit width, continuing latching and waiting for splicing with the next data.
Meanwhile, invalid codes can be inserted into the data stream to control the output speed of the compressed data.
When the bit width of the received data is larger than the set unit width of the processed data, the received data to be compressed can be subjected to stripe division, and then a plurality of compression modules are called to perform parallel synchronous processing, so that the processing bandwidth is improved. The compression ratios of the multiple stripes may be different, and the overall balance of the amount of data before and after compression input among the stripes is balanced by inserting invalid codes into the data stream.
In a third aspect, the present invention provides a lossless data compression apparatus for high-speed transparent transmission, including a processor and a memory electrically connected to each other; the memory is used for storing a computer program; the processor, when executing the computer program, may implement the lossless data compression method for high-speed transparent transmission as described in the first aspect.
In a fourth aspect, the present invention provides a computer readable storage medium having a computer program stored thereon; when executed, the computer program may implement a lossless data compression method for high-speed transparent transmission as described in the first aspect above.
According to the lossless data compression method, system and device for high-speed transparent transmission, the pre-configuration parameters meeting the compression requirements are obtained by analyzing and counting the sample data in advance, and then the received data is subjected to online real-time lossless compression according to the pre-configuration parameters, so that context information is not needed, and higher processing speed and lower delay can be supported; the lossless data compression method, system and device for high-speed transparent transmission, disclosed by the invention, have the advantages of simple compression process, less resource occupation and flexible bandwidth expansion, can meet the online lossless compression requirement for high-speed transmission, and occupy less hardware circuit resources.
Drawings
FIG. 1 is a flow chart of a lossless data compression method for high-speed transparent transmission according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a lossless data compression system for high-speed transparent transmission according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a lossless data compression system for high-speed transparent transmission according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a lossless data compression method for high-speed transparent transmission according to an embodiment of the present invention;
fig. 5 is a schematic diagram of aligning data in the lossless data compression method for high-speed transparent transmission according to the embodiment of the present invention.
Detailed Description
The following describes the lossless data compression method, system and apparatus for high-speed transparent transmission in accordance with the present invention in detail with reference to the accompanying drawings and embodiments.
Example one
The embodiment discloses a lossless data compression method for high-speed transparent transmission, as shown in fig. 1, pre-analyzing sample data to obtain pre-configured parameters according to the pre-analysis result; and then performing data compression on the data to be compressed according to the pre-configured parameters.
Wherein the process of pre-analyzing the sample data comprises: dividing the sample data into a plurality of data units according to a preset granularity; in an embodiment of the present disclosure, the preset granularity is one or more complete bytes; the classified numerical value of the data code pattern is n-th power of 2; the classification identifier is n-bit binary digits in length. Carrying out statistical analysis on the data units, and calculating the probability of the occurrence of different types of data code patterns in the sample data; classifying the data code patterns according to the occurrence probability of the data code patterns; according to different classifications, a classification identifier with a fixed length is correspondingly arranged for each class of data code pattern; setting the code length after compression coding for the data corresponding to each type of data code type according to the coding rule according to different classifications; the encoding rule is as follows: according to the occurrence probability of the data code pattern from high to low, the code length of the data after compression coding is from short to long; wherein, the shortest code length is 0, and the longest code length is the original data length. The pre-configuration parameters include a preset granularity, a classification of a data pattern, a classification identifier and a code length.
The process of performing data compression on the data to be compressed according to the pre-configured parameters comprises the following steps: firstly, carrying out bit width conversion on data to be compressed, and converting the bit width into a multiple of the preset granularity; according to the classification of the data code pattern, identifying the classification of the data to be compressed, and generating a corresponding classification identifier; according to the classification of the data code pattern, performing data compression on data to be compressed according to the code length after the setting of the compression coding, and outputting the compressed data; and carrying out data alignment processing on the classification identifier and the compressed data, outputting a new compressed data formed according to a preset sequence, and completing data compression.
The data alignment process in the embodiment of the present disclosure includes: if the data bit width of the new compressed data is less than the bit width of the output data, temporarily storing the data and splicing the data with the next received data; if the spliced bit width is larger than or equal to the required output data bit width, sending out effective compressed data with aligned bit width; continuously storing the exceeded digit, and continuously splicing with the next received data; and if the spliced data bit width is still smaller than the required output data bit width, latching and waiting for merging with the next data.
In the process of data compression and output, when the output speed of the final new compressed data needs to be adjusted, the adjustment can be carried out by inserting invalid codes which do not accord with the coding rule into the data stream; meanwhile, if the bit width of the data to be compressed is larger than the set unit width of the processed data, the received data to be compressed can be subjected to stripe division, and a plurality of parallel steps are adopted for data compression processing, so that the processing bandwidth is effectively improved.
In the embodiment of the present disclosure, the compression ratio of the data to be compressed may be calculated according to the occurrence probability and the code length of different data patterns. When the calculated compression ratio does not meet the compression requirement, the preset granularity of the data and the classification of the data code pattern can be modified, and the calculation is carried out through iteration of the process until the parameter meeting the compression ratio requirement is calculated.
As shown in fig. 4, in the embodiment of the present disclosure, statistical analysis is performed on sample data according to a preset granularity of 8 bits, and probabilities of occurrence of different data patterns are calculated; and classifying according to the probability. The module 402 is classified by 4 data patterns as in fig. 4, and the length of the classification identifier is described in detail as 2 bits; 8-bit data 00000000 is assigned to the identifier 00, 11111111 is assigned to the identifier 01, data with 0 at 5 bits in 8-bit binary digits, i.e., 00000 xxx, and data with 1 at 5 bits in 8-bit binary digits, i.e., 1111 1xxx, are assigned to the identifier 10, and the other data are assigned to the identifier code 11.
And (3) performing cutting lossless compression on the data according to the data code type classification, wherein 403 in FIG. 4 shows the data length after lossless compression of different data classifications, and 404 in FIG. 4 shows the data after lossless compression.
Based on the code type classification in this embodiment, the identifier is 00 or 01, the code length of the encoded data is 0, and the compression rate of this type of data is 25%; when the identifier is 10, the code length of the compressed data is 4, and after the identifier is added, the compression rate of the data is 75%; when the identification code is 11, the code length of the data after compression encoding is 8, and the compression rate of the data is 125%.
By using the coding rule, an invalid code which does not conform to the rule can be set as a filling purpose; invalid codes can be customized, for example, the identifier is 11, and the corresponding data is 00000000; and when data compression is carried out, calculating the compression ratio according to the occurrence probability and the compressed length of different data code patterns. If the above coding rules satisfy the compression ratio requirement, the parameters to be pre-configured to the compression module are determined: the processing granularity of the data is 8 bits, the data classification number is 4, the length of the data identifier is 2 bits, and the corresponding relation between the identifier and the actual compressed data is shown in fig. 4.
Example two
On the basis of the first embodiment, the embodiment of the present disclosure discloses a method of decompression; after the decompression process is started, the decompression process can be performed on the data to be decompressed, and the process is as follows:
the method comprises the steps that data to be compressed are received, identifiers sent first are taken out, and the effective data length of the data to be decompressed is obtained according to the corresponding relation between the identifiers and the data code length; taking out effective data, supplementing data bits cut off according to rules during compression, and combining the original data to send out; the bit width of the decompressed data is the same as the unit bit width of the corresponding compression module.
If the extracted compressed data bit is judged to be invalid data according to the identifier, discarding the data; if the received data of one period still remains after the identifier and the data are taken out, the remaining data bits are temporarily stored and combined with the next data to continue the decompression operation.
For the same compression mode, the configuration parameters used for compressing and decompressing the same data are kept consistent, and the process is a symmetrical reverse operation process.
EXAMPLE III
The embodiment of the present disclosure discloses a high-speed transparent transmission lossless data compression system, as shown in fig. 2, including a data receiving module, a data bit width conversion module, a data compression encoding module, a data alignment module, and a data transmission control module;
the data receiving module is used for reading data to be compressed from the cache or inputting the data from the interface;
the data bit width conversion module receives the received data, performs bit width conversion on the data, converts the data into a pre-configured processing granularity which is m bytes or a multiple of the m bytes, and sends the converted data to the data compression encoding module;
the data compression coding module identifies the classification of the data according to a pre-configured code pattern classification rule, and generates a corresponding data identifier and cuts the compressed data; such as data 00000101, corresponding to a data class identifier of 10; the data after compression coding is 0101; the data 11111111, the corresponding data classification identifier is 01, the code length of the data after compression coding is 0, namely all 8-bit data bits can be judged only by using the data classification identifier.
The generated data identifier and the data after cutting and compression are sent to a data alignment module; the data alignment module combines the received identifier and the cut and compressed data into new data according to a convention sequence, and then the new data is transmitted out through the data transmission control module.
If the bit width of the newly combined data is less than the bit width of the output data, temporarily storing the data and splicing the data with the next received data. If the spliced bit width is larger than or equal to the required output data bit width, sending out effective data aligned with the required data bit width; the exceeding bit number is latched continuously and merged and spliced with the next received data continuously. If the spliced data bit width is still smaller than the required output data bit width, continuously latching and waiting for splicing with the next data, and so on; FIG. 5 is a schematic diagram of parallel aligned data after data compression encoding;
according to the specific use condition, invalid codes can be inserted into the data stream when needed, and the output speed of the compressed data is controlled.
As shown in fig. 3, when the received data bit width is greater than the set processing data unit width, the received data to be compressed may be stripe-divided, and then a plurality of compression modules are invoked to perform parallel synchronous processing, so as to increase the processing bandwidth. The compression ratios of the multiple stripes may be different, and the overall balance of the amount of data before and after compression input among the stripes is balanced by inserting invalid codes into the data stream.
For the same compression mode, the configuration parameters used for compressing and decompressing the same data are kept consistent, and the process is a symmetrical reverse operation process.
Example four
The embodiment of the disclosure discloses a lossless data compression device for high-speed transparent transmission, which comprises a processor and a memory which are electrically connected; the memory is used for storing a computer program; when the processor executes the computer program, the lossless data compression method for high-speed transparent transmission according to the first embodiment can be realized; the specific compression method steps are the same as those in the first embodiment, and are not described herein again.
EXAMPLE five
The disclosed embodiments disclose a computer-readable storage medium having a computer program stored thereon; when the computer program is executed, the lossless data compression method for high-speed transparent transmission of the embodiment one can be realized; the specific compression method steps are the same as those in the first embodiment, and are not described herein again.
The computer described in the embodiments of the present application may be a general purpose computer, a special purpose computer, a network of computers, or other programmable devices. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium. The computer readable storage medium may be any available medium that can be read by a computer or a data storage device, such as a server, a data center, etc., that includes one or more available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., digital Versatile Disk (DVD)), or a semiconductor medium (e.g., solid State Disk (SSD)), among others. The software formed by the computer stored code may be located in a random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, or other storage media as is well known in the art.
The functional modules in the embodiments of the present application may be integrated into one processing unit or module, or each module may exist alone physically, or two or more modules are integrated into one unit or module. In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are realized in whole or in part.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A lossless data compression method for high-speed transparent transmission is characterized in that: firstly, sample data is pre-analyzed, and pre-configuration parameters are obtained according to a pre-analysis result; and then performing data compression on the data to be compressed according to the pre-configured parameters.
2. The lossless data compression method for high-speed transparent transmission according to claim 1, wherein: the process of pre-analyzing the sample data comprises the following steps:
dividing the sample data into a plurality of data units according to a preset granularity;
carrying out statistical analysis on the data units, and calculating the probability of the occurrence of different types of data code patterns in the sample data;
classifying the data code patterns according to the occurrence probability of the data code patterns;
according to different classifications, a classification identifier with a fixed length is correspondingly arranged for each class of data code pattern;
setting the code length after compression coding for the data corresponding to each type of data code type according to the coding rule according to different classifications;
the pre-configuration parameters include a preset granularity, a classification of a data pattern, a classification identifier and a code length.
3. The lossless data compression method for high-speed transparent transmission according to claim 2, wherein: the preset granularity is one or more complete bytes; the classified numerical value of the data code pattern is n-th power of 2; the classification identifier is n-bit binary digits in length.
4. The lossless data compression method for high-speed transparent transmission according to claim 2, wherein: the encoding rule is as follows: according to the occurrence probability of the data code pattern from high to low, the code length of the data after compression coding is from short to long; wherein, the shortest code length is 0, and the longest code length is the original data length.
5. The lossless data compression method for high-speed transparent transmission according to claim 2, wherein: the process of performing data compression on the data to be compressed according to the preconfigured parameters comprises the following steps:
firstly, carrying out bit width conversion on data to be compressed, and converting the bit width into a multiple of the preset granularity;
according to the classification of the data code pattern, identifying the classification of the data to be compressed, and generating a corresponding classification identifier;
according to the classification of the data code pattern, performing data compression on data to be compressed according to the code length after the setting of the compression coding, and outputting the compressed data;
and carrying out data alignment processing on the classification identifier and the compressed data, outputting a new compressed data formed according to a preset sequence, and completing data compression.
6. The lossless data compression method for high-speed transparent transmission according to claim 5, wherein: the data alignment process includes: if the data bit width of the new compressed data is less than the bit width of the output data, temporarily storing the data and splicing the data with the next received data; if the spliced bit width is larger than or equal to the required output data bit width, sending out effective compressed data with aligned bit width; the exceeded digit is continuously stored and is continuously spliced with the next received data;
and if the spliced data bit width is still smaller than the required output data bit width, latching and waiting for merging with the next data.
7. The lossless data compression method for high-speed transparent transmission according to claim 6, wherein: the output speed of the new compressed data can be adjusted by inserting invalid codes in the data stream that do not comply with the aforementioned encoding rules.
8. A lossless data compression system for high-speed transparent transmission, comprising: the system comprises a data receiving module, a data bit width conversion module, a data compression coding module, a data alignment module and a data sending control module;
the data receiving module is used for acquiring data to be compressed from an interface or a cache;
the data bit width conversion module is used for firstly performing bit width conversion on data to be compressed and converting the bit width into a multiple of the preset granularity;
the data compression coding module is used for identifying the classification of the data to be compressed according to the classification of the data code pattern and generating a corresponding classification identifier; according to the classification of the data code pattern, performing data compression on data to be compressed according to the set code length after compression coding, and outputting the compressed data;
the data alignment output module is used for performing data alignment processing on the classification identifier and the compressed data and outputting a new compressed data formed according to a preset sequence;
and the data transmission control module is used for outputting the compressed data.
9. A high-speed transparent transmission lossless data compression device comprises a processor and a memory which are electrically connected; the memory is used for storing a computer program; the method is characterized in that: the processor, when executing the computer program, may perform a lossless data compression method for high speed transparent transmission as claimed in any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that: the storage medium has a computer program stored thereon; the computer program, when executed, may perform a lossless data compression method for high speed transparent transmission as claimed in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211599846.2A CN115765756A (en) | 2022-12-14 | 2022-12-14 | Lossless data compression method, system and device for high-speed transparent transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211599846.2A CN115765756A (en) | 2022-12-14 | 2022-12-14 | Lossless data compression method, system and device for high-speed transparent transmission |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115765756A true CN115765756A (en) | 2023-03-07 |
Family
ID=85345754
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211599846.2A Pending CN115765756A (en) | 2022-12-14 | 2022-12-14 | Lossless data compression method, system and device for high-speed transparent transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115765756A (en) |
-
2022
- 2022-12-14 CN CN202211599846.2A patent/CN115765756A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11463102B2 (en) | Data compression method, data decompression method, and related apparatus, electronic device, and system | |
| US7990289B2 (en) | Combinatorial coding/decoding for electrical computers and digital data processing systems | |
| JP2018522457A (en) | Method, device and system for hybrid data compression and decompression | |
| US20090016452A1 (en) | Blocking for combinatorial coding/decoding for electrical computers and digital data processing systems | |
| KR20120084180A (en) | Data compression device, operation method using the same, and data processing apparatus having the same | |
| US7554464B1 (en) | Method and system for processing data having a pattern of repeating bits | |
| US9923577B1 (en) | Hybrid software-hardware implementation of lossless data compression and decompression | |
| CN111884660B (en) | Huffman coding equipment | |
| US20220224947A1 (en) | Coding method and related device | |
| CN106849956B (en) | Compression method, decompression method, device and data processing system | |
| CN116610265B (en) | Data storage method of business information consultation system | |
| CN115483935A (en) | Data processing method and device | |
| CN110198171B (en) | Data compression method and device, computer readable medium and electronic equipment | |
| JP2008067361A (en) | Encoding apparatus, decoding apparatus, encoding method, and program | |
| US20140015698A1 (en) | System and method for fixed rate entropy coded scalar quantization | |
| CN108880559B (en) | Data compression method, data decompression method, compression equipment and decompression equipment | |
| WO2021145105A1 (en) | Data compression device and data compression method | |
| CN112956131B (en) | Encoding device, decoding device, encoding method, decoding method, and computer-readable recording medium | |
| CN115765756A (en) | Lossless data compression method, system and device for high-speed transparent transmission | |
| US20150280737A1 (en) | Compression ratio for a compression engine | |
| CN112800183B (en) | Content name data processing method and terminal equipment | |
| Kim et al. | Low-overhead compressibility prediction for high-performance lossless data compression | |
| US8593310B1 (en) | Data-driven variable length encoding of fixed-length data | |
| US20240137579A1 (en) | Encoding Control Method and Apparatus, and Decoding Control Method and Apparatus | |
| CN113595557B (en) | Data processing method and device |
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 |