WO2014029081A1 - Procédé et appareil de compression - Google Patents

Procédé et appareil de compression Download PDF

Info

Publication number
WO2014029081A1
WO2014029081A1 PCT/CN2012/080429 CN2012080429W WO2014029081A1 WO 2014029081 A1 WO2014029081 A1 WO 2014029081A1 CN 2012080429 W CN2012080429 W CN 2012080429W WO 2014029081 A1 WO2014029081 A1 WO 2014029081A1
Authority
WO
WIPO (PCT)
Prior art keywords
compression
bit stream
text file
processor
length
Prior art date
Application number
PCT/CN2012/080429
Other languages
English (en)
Chinese (zh)
Inventor
覃祥菊
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201280002780.2A priority Critical patent/CN103210590B/zh
Priority to PCT/CN2012/080429 priority patent/WO2014029081A1/fr
Publication of WO2014029081A1 publication Critical patent/WO2014029081A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method

Definitions

  • the present application relates to compression technology, and in particular, to a compression method and device. Background technique
  • GZIP compression technology mainly includes two-part processing mode, one part of which is LZ77 compression mode and the other part of which is Huffman coding mode.
  • the LZ77 compression method is a phrase compression algorithm. When a string in a text file has a string that is completely repeated before it, the ⁇ repeating length, the distance between the two ⁇ can be utilized. The dual group replaces the former to achieve the purpose of data compression; if a string in a text file does not exist before it is completely repeated, it will not be processed.
  • Huffman coding is a method of encoding data that can be compressed. It can be based on the frequency difference between different characters in a text file, using shorter code words instead of higher frequency characters, and using longer code words.
  • the Huffman coding method may include a static Huffman coding method and a dynamic Huffman coding method.
  • the static Huffman coding method encodes characters according to the fixed code table specified by the protocol, and the compression effect is limited;
  • the dynamic Huffman coding method is to count the frequency of occurrence of characters in the text file to be compressed, according to the statistical result.
  • the encoding code table is generated, and the compression effect is obvious, but it is necessary to consume resources and time to count the appearance frequency of the characters and generate the encoding code table, and the output bit stream also needs to carry additional encoding code table information, and the output data is increased. the amount.
  • GZIP compression technology can be implemented using hardware devices.
  • the processor the Central Processing Unit (CPU)
  • CPU Central Processing Unit
  • the processor can combine the bit streams output by each compression engine to obtain a compressed text file.
  • the processor when it combines the bit streams output by each compression engine, it needs to perform a shift splicing operation to obtain a bit stream whose length is an integer multiple of the minimum data unit that the processor can process.
  • aspects of the present application provide a compression method and apparatus for saving processor processing resources Source.
  • a compression method including:
  • the first bit stream and the second bit stream are output for processing by the processor.
  • the foregoing aspect and any possible implementation manner further provide an implementation manner, where the compression processing manner includes a static Huffman coding method and a dynamic Huffman coding method in a GZIP compression technology;
  • the non-compression processing method includes an uncompressed coding mode in the GZIP compression technology.
  • the foregoing aspect and any possible implementation manner further provide an implementation manner, where the compression processing manner further includes an LZ77 compression mode in the GZIP compression technology.
  • an implementation is further provided, the second part comprising at least one byte of an end of the text file.
  • the data unit includes a byte.
  • a compression device including:
  • a receiving unit configured to acquire a text file to be compressed, and transmit the text file to a processing unit, where the text file includes a first part and a second part;
  • the processing unit is configured to process the first part by using a compression processing manner and/or a non-compression processing manner to generate a first bit stream, and transmit the first bit stream to an output unit; Decoding a length of the first bit stream, processing the second portion by a non-compression processing manner to generate a second bit stream, and transmitting the second bit stream to the output unit, the first bit stream
  • the sum of the length of the second bit stream and the length of the second bit stream is an integer multiple of the smallest unit of data that the processor can process;
  • the output unit is configured to output the first bit stream and the second bit stream for processing by the processor.
  • the foregoing aspect and any possible implementation manner further provide an implementation manner, where the compression processing manner includes a static Huffman coding method and a dynamic Huffman coding method in a GZIP compression technology;
  • the non-compression processing method includes an uncompressed coding mode in the GZIP compression technology.
  • the foregoing aspect and any possible implementation manner further provide an implementation manner, where the compression processing manner further includes an LZ77 compression mode in the GZIP compression technology.
  • an implementation is further provided, the second part comprising at least one byte of an end of the text file.
  • the data unit includes a byte.
  • a compression device including:
  • a receiver configured to acquire a text file to be compressed, and transmit the text file to a processor, the text file including a first part and a second part;
  • the processor is configured to process the first part by using a compression processing manner and/or a non-compression processing manner to generate a first bit stream, and transmit the first bit stream to a transmitter; Decoding a length of the first bitstream, processing the second portion by a non-compression processing manner to generate a second bitstream, and transmitting the second bitstream to the transmitter, the first bitstream
  • the sum of the length of the second bit stream and the length of the second bit stream is an integer multiple of the smallest unit of data that the processor can process;
  • the transmitter is configured to output the first bit stream and the second bit stream for processing by the processor.
  • the compression processing manner includes a static Huffman coding method and a dynamic Huffman coding method in a GZIP compression technology
  • the non-compression processing method includes an uncompressed coding mode in the GZIP compression technology.
  • the foregoing aspect and any possible implementation manner further provide an implementation manner, where the compression processing manner further includes an LZ77 compression mode in the GZIP compression technology.
  • an implementation is further provided, the second part comprising at least one byte of an end of the text file.
  • the most d, the data unit includes bytes.
  • the second part of the text file to be compressed is processed by an uncompressed (Uncompressed or Stored) coding method in the second part of the text file to be compressed, for example, by using an uncompressed (Stored) method in the GZIP compression technology.
  • the second bit stream may be such that the length of the output complete bit stream, that is, the sum of the lengths of the first bit stream and the second bit stream, is a minimum data unit that the processor can process, for example, an integer multiple of a byte (Byte), such that The processor no longer needs to perform a shift splicing operation when merging the bit streams output by each compression engine, thereby saving the processing resources of the processor.
  • FIG. 1 is a schematic flowchart of a compression method according to an embodiment of the present application
  • FIG. 1B is a schematic diagram showing the processing manners of the first part and the second part included in the text file to be compressed in the embodiment corresponding to FIG. 1A;
  • FIG. 1 C is a schematic diagram of a data flow after processing a second portion included in a text file to be compressed in the embodiment corresponding to FIG. 1A;
  • 1D is a schematic diagram of data flow after processing the first part and the second part included in the text file to be compressed in the embodiment corresponding to FIG. 1A;
  • FIG. 2 is a schematic structural diagram of a compression device according to another embodiment of the present application.
  • FIG. 3 is a schematic structural diagram of a compression device according to another embodiment of the present disclosure.
  • the technical solutions in the embodiments of the present application are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present application.
  • the embodiments are part of the embodiments of the present application, and not all of the embodiments. Based on the embodiments in the present application, those of ordinary skill in the art obtain the following without creative efforts. All other embodiments obtained are within the scope of the protection of the present application.
  • FIG. 1A is a schematic flowchart of a compression method according to an embodiment of the present application.
  • Process the first part by using a compression processing manner and/or a non-compression processing manner to generate a first bit stream.
  • Which processing method is selected to process the first part and may be selected according to a preset processing strategy. For example, the processing method with the highest compression ratio may be selected.
  • the second part is processed by using a non-compression processing manner to generate a second bit stream, the length of the first bit stream and the length of the second bit stream, according to the length of the first bit stream.
  • the sum is an integer multiple of the smallest unit of data that the processor can handle.
  • the execution body of 101 ⁇ 104 may be each of at least two compression engines in a hardware device.
  • the text file to be compressed acquired by each compression engine may be obtained by dividing the original text file by the processor according to the processing capability of each compression engine. Both the original text file and the text file to be compressed are in the smallest unit of data that the processor can handle, for example, a byte (Byte).
  • the compression processing manner may include a static Huffman coding method and a dynamic Huffman coding method in a GZIP compression technology;
  • the non-compression processing method may include the GZIP Uncompressed or Stored encoding in compression technology, as shown in Figure 1B.
  • the static Huffman coding method, the dynamic Huffman coding method, and the uncompressed or uncompressed coding method in the GZIP compression technology refer to the prior art. The relevant content in the content is not described here.
  • the compression processing manner may further include an LZ77 compression manner in the GZIP compression technology.
  • the first part may be processed by using an LZ77 compression method, and then processed by the LZ77 compression method by using a static Huffman coding method or a Dynamic Huffman coding method. The first part of the process is processed.
  • the second part may include at least one byte of an end of the text file.
  • the second bit stream may include a flag bit "xOO" of 3 bits (bit), a length code (LEN) of 0 bits, a length code of 1 byte, and a length code of 1 byte. (NLEN) and the data contained in the second part, as shown in Figure 1C.
  • the sum of the length, the 3 bits, the m bits, the 1 byte, the 1 byte, and the length of the data included in the second portion of the first bit stream is the minimum data that the processor can process.
  • the unit is, for example, an integer multiple of a byte (Byte).
  • the text file to be compressed may be divided into a plurality of data blocks (blocks) as a basic unit of a static Huffman coding method or a dynamic Huffman coding method, each data block.
  • the size is usually 4k ⁇ 32k bytes.
  • the 100 bytes of the text file to be compressed may include the first part, that is, the first 96 bytes and the second part, that is, the following 4 bytes. It is assumed that the data included in the first part is processed by the compression processing method and/or the non-compression processing manner, and the generated first bit stream has a length of 207 bits.
  • the sum of the first bit stream, the 3-bit flag bit "100", the 1-byte LEN, the 1-byte NLEN, and the length of the data contained in the second portion is (207+3+) 8+8+32) bits, ie 258 bits.
  • the last part (ie, the second part) of the text file to be compressed is processed by an uncompressed processing method, for example, an uncompressed (Stored) method in the GZIP compression technology.
  • Generating a second bit stream such that the length of the output complete bit stream, that is, the sum of the lengths of the first bit stream and the second bit stream, is a minimum data unit that the processor can process, for example, an integer multiple of a byte (Byte), This makes it unnecessary for the processor to perform the shift splicing operation when merging the bit streams output by each compression engine, thereby saving the processing resources of the processor.
  • FIG. 2 is a schematic structural diagram of a compression device according to another embodiment of the present disclosure.
  • the compression device of this embodiment may include a receiving unit 21, a processing unit 22, and an output unit 23.
  • the receiving unit 21 is configured to acquire a text file to be compressed, and transmit the text file to the processing unit 22, where the text file includes a first part and a second part.
  • the processing unit 22 is configured to utilize compression processing.
  • the second portion is processed by the non-compression processing to generate a second bit stream, and the second bit stream is transmitted to the output unit 23, the length of the first bit stream and the second bit
  • the sum of the lengths of the streams is an integer multiple of the smallest unit of data that the processor can process; the output unit 23 is configured to output the first bit stream and the second bit stream for processing by the processor.
  • the compression device provided in this embodiment may be at least two of a hardware device. Any compression engine in the compression engine.
  • the text file to be compressed acquired by the receiving unit 21 may be obtained by the processor by dividing the original text file according to the processing capability of each compression engine. Both the original text file and the text file to be compressed are in the smallest unit of data that the processor can handle, for example, Bytes.
  • the compression processing manner may include a static Huffman coding method and a dynamic Huffman coding method in a GZIP compression technology;
  • the uncompressed processing manner may include an uncompressed (Stored) or Unstamped encoding method in the GZIP compression technology, as shown in FIG. 1B.
  • the compression processing manner may further include an LZ77 compression manner in the GZIP compression technology.
  • the processing unit 22 may first process the first part by using an LZ77 compression method, and then use a static Huffman coding method or a dynamic Huffman coding method to pass the LZ77. The first portion of the compression mode processing is processed.
  • the second part may include at least one byte of an end of the text file.
  • the second bit stream may include a 3-bit flag bit "xOO", m bits of 0, a 1-byte length code (LEN), and a 1-byte length code inverse code (NLEN).
  • LN 1-byte length code
  • NLEN 1-byte length code inverse code
  • the sum of the length of the first bit stream, 3 bits, m bits, 1 byte, 1 byte, and the length of data included in the second part is the minimum data that the processor can process.
  • the unit is, for example, an integer multiple of a byte (Byte). Wherein, if the second part is the last data block of the text file to be compressed, X takes a value of "1"; if the second part is not the last data of the text file to be compressed Block, then X takes the value "0".
  • the 100 bytes of the text file to be compressed may include The first part is the first 96 bytes and the second part is the last 4 bytes. It is assumed that the data included in the first part is processed by the compression processing method and/or the non-compression processing manner, and the generated first bit stream has a length of 207 bits.
  • the sum of the first bit stream, the 3-bit flag bit "100", the 1-byte LEN, the 1-byte NLEN, and the length of the data contained in the second portion is (207+3+) 8+8+32) bits, ie 258 bits.
  • the compression device provided in this embodiment is used to perform the method in the embodiment shown in FIG. 1A, and details have been described in the embodiment shown in FIG. 1A, and details are not described herein again.
  • the last part (ie, the second part) of the text file to be compressed by the processing unit is used in an uncompressed processing manner, for example, an uncompressed or unscheduled encoding method in the GZIP compression technology.
  • the length of the complete bit stream output by the output unit that is, the sum of the lengths of the first bit stream and the second bit stream, is the smallest data unit that the processor can process, for example, a byte (Byte) Integer multiples, so that the processor does not need to perform a shift splicing operation when merging the bit streams output by each compression engine, thereby saving the processing resources of the processor.
  • FIG. 3 is a schematic structural diagram of a compression device according to another embodiment of the present disclosure.
  • the compression device of this embodiment may include a receiver 31, a processor 32, and a transmitter 33.
  • the receiver 31 is configured to acquire a text file to be compressed, and transmit the text file to the processor 32, where the text file includes a first part and a second part, and the processor 32 is configured to utilize compression processing.
  • the first portion is processed by the non-compression processing to generate a second bit stream, and the second bit stream is transmitted to the transmitter 33, the length of the first bit stream and the second bit
  • the sum of the lengths of the streams is an integer multiple of the smallest unit of data that the processor can process; the transmitter 33 is configured to output the first bit stream and the second bit stream for processing by the processor.
  • the compression device may be any one of at least two compression engines in a hardware device.
  • the text file to be compressed acquired by the receiver 31 may be obtained by dividing the original text file by the processor according to the processing capability of each compression engine. Both the original text file and the text file to be compressed are in the smallest unit of data that the processor can handle, for example, Bytes.
  • the compression processing manner may include a static Huffman coding method and a dynamic Huffman coding method in a GZIP compression technology;
  • the uncompressed processing manner may include an uncompressed (Stored) or Unstamped encoding method in the GZIP compression technology, as shown in FIG. 1B.
  • the compression processing manner may further include an LZ77 compression manner in the GZIP compression technology.
  • the processor 32 may first process the first part by using an LZ77 compression method, and then use a static Huffman coding method or a dynamic Huffman coding method to pass the LZ77. The first portion of the compression mode processing is processed.
  • the second part may include at least one byte of an end of the text file.
  • the second bit stream may include a 3-bit flag bit "xOO", m bits of 0, a 1-byte length code (LEN), and a 1-byte length code inverse code (NLEN).
  • LN 1-byte length code
  • NLEN 1-byte length code inverse code
  • the sum of the length of the first bit stream, 3 bits, m bits, 1 byte, 1 byte, and the length of data included in the second part is the minimum data that the processor can process.
  • the unit is, for example, an integer multiple of a byte (Byte). Wherein, if the second part is the last data block of the text file to be compressed, X takes a value of "1"; if the second part is not the last data of the text file to be compressed Block, then X takes the value "0".
  • the 100 bytes of the text file to be compressed may include the first part, that is, the first 96 bytes and the second part, that is, the following 4 bytes.
  • the generated first bit stream has a length of 207 bits.
  • the sum of the first bit stream, the 3-bit flag bit "100", the 1-byte LEN, the 1-byte NLEN, and the length of the data contained in the second portion is (207+3+) 8+8+32) bits, ie 258 bits.
  • the compression device provided in this embodiment is used to perform the method in the embodiment shown in FIG. 1A, and details have been described in the embodiment shown in FIG. 1A, and details are not described herein again.
  • the last part (ie, the second part) of the text file to be compressed by the processor is processed by an uncompressed processing method, for example, an uncompressed or stored code in the GZIP compression technology.
  • processing to generate the second bit stream the length of the complete bit stream output by the transmitter, that is, the sum of the lengths of the first bit stream and the second bit stream, is the smallest unit of data that the processor can process, for example, a byte (Byte) Integer multiples, so that the processor does not need to perform a shift splicing operation when merging the bit streams output by each compression engine, thereby saving the processing resources of the processor.
  • the disclosed systems, devices, and methods may be implemented in other ways.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not executed.
  • the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be electrical, mechanical or otherwise.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. You can choose some of them according to actual needs or All units are used to achieve the objectives of the solution of this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of hardware plus software functional units.
  • the above-described integrated unit implemented in the form of a software functional unit can be stored in a computer readable storage medium.
  • the above software functional unit is stored in a storage medium and includes a plurality of instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to execute the method of the various embodiments of the present application. Part of the steps.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a Read-Only Memory (ROM), a random access memory (RAM), a disk or an optical disk, and the like, which can store program codes. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

Les modes de réalisation de la présente invention concernent un procédé et un appareil de compression. Un second flux binaire est généré en traitant, à l'aide d'un moyen de traitement non compressé, tel qu'un mode de codage non compressé (non compressé ou stocké) de la technologie de compression GZIP, une dernière partie (c'est-à-dire une seconde partie) d'un fichier texte à compresser, ce qui rend la longueur de l'intégralité du flux binaire de sortie, c'est-à-dire la somme de la longueur d'un premier flux binaire et de la longueur d'un second flux binaire, la plus petite unité possible de données pouvant être traitée par un dispositif de traitement, telle qu'un multiple entier d'un octet (Octet), de façon à ce que le dispositif de traitement n'ait plus besoin d'effectuer des opérations de décalage et d'assemblage lors de la combinaison des flux binaires provenant de chaque moteur de compression, économisant ainsi les ressources de traitement du dispositif de traitement.
PCT/CN2012/080429 2012-08-21 2012-08-21 Procédé et appareil de compression WO2014029081A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201280002780.2A CN103210590B (zh) 2012-08-21 2012-08-21 压缩方法及设备
PCT/CN2012/080429 WO2014029081A1 (fr) 2012-08-21 2012-08-21 Procédé et appareil de compression

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2012/080429 WO2014029081A1 (fr) 2012-08-21 2012-08-21 Procédé et appareil de compression

Publications (1)

Publication Number Publication Date
WO2014029081A1 true WO2014029081A1 (fr) 2014-02-27

Family

ID=48756622

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/080429 WO2014029081A1 (fr) 2012-08-21 2012-08-21 Procédé et appareil de compression

Country Status (2)

Country Link
CN (1) CN103210590B (fr)
WO (1) WO2014029081A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104199951B (zh) * 2014-09-12 2018-09-04 百度在线网络技术（北京）有限公司 网页处理方法及装置
CN106789871B (zh) * 2016-11-10 2020-05-01 东软集团股份有限公司 攻击检测方法、装置、网络设备及终端设备
CN109302187A (zh) * 2018-08-31 2019-02-01 中国海洋大学 一种针对潜标温盐深数据的数据压缩方法
CN112199922B (zh) * 2020-08-25 2023-08-22 中国物品编码中心 编码方法、装置、设备及计算机可读存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100079314A1 (en) * 2008-09-30 2010-04-01 Apple Inc. Method and apparatus for compressing and decompressing data
CN102143039A (zh) * 2010-06-29 2011-08-03 华为技术有限公司 数据压缩中数据分段方法及设备
CN102291773A (zh) * 2011-07-18 2011-12-21 电信科学技术研究院 一种数据压缩方法和设备
US20120106861A1 (en) * 2010-10-29 2012-05-03 Altek Corporation Image compression method
CN102469306A (zh) * 2010-10-29 2012-05-23 华晶科技股份有限公司 图像压缩的方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100079314A1 (en) * 2008-09-30 2010-04-01 Apple Inc. Method and apparatus for compressing and decompressing data
CN102143039A (zh) * 2010-06-29 2011-08-03 华为技术有限公司 数据压缩中数据分段方法及设备
US20120106861A1 (en) * 2010-10-29 2012-05-03 Altek Corporation Image compression method
CN102469306A (zh) * 2010-10-29 2012-05-23 华晶科技股份有限公司 图像压缩的方法
CN102291773A (zh) * 2011-07-18 2011-12-21 电信科学技术研究院 一种数据压缩方法和设备

Also Published As

Publication number Publication date
CN103210590A (zh) 2013-07-17
CN103210590B (zh) 2016-09-28

Similar Documents

Publication Publication Date Title
JP2005269618A (ja) データ圧縮
US20220043778A1 (en) System and method for data compaction and security with extended functionality
US9137337B2 (en) Hierarchical bitmasks for indicating the presence or absence of serialized data fields
US20140266816A1 (en) Method and apparatus for compressing data-carrying signals
CN105052040A (zh) 多流压缩与解压的方法与系统
US11586588B2 (en) System and methods for bandwidth-efficient cryptographic data transfer
WO2012155683A1 (fr) Procédé de contrôle de parité basse densité et dispositif pour sa mise en œuvre
JP2016512004A (ja) データエンコーダ、データデコーダ及び方法
WO2014029081A1 (fr) Procédé et appareil de compression
US11762557B2 (en) System and method for data compaction and encryption of anonymized datasets
CN112399479A (zh) 用于数据传输的方法、电子设备和存储介质
US20230401173A1 (en) System and methods for secure deduplication of compacted data
US20230283292A1 (en) System and method for data compaction and security with extended functionality
TW201436533A (zh) 資料流傳輸系統及方法
US20220129421A1 (en) System and methods for bandwidth-efficient encoding of genomic data
CN104518850B (zh) 将参考模板同步到数据流的方法和信息处理系统
US11025272B2 (en) Real-time history-based byte stream compression
KR100997870B1 (ko) 데이터 인코딩 및 디코딩 방법, 데이터 전송 방법, 송신기 및 수신기
CN112328373A (zh) 一种面向分布式仿真的数据分发服务dds自动发现方法
CN103929447B (zh) 一种基于PEEK操作的解析HTTP chunked编码数据的方法
Jain et al. An efficient compression algorithm (ECA) for text data
CN110995274B (zh) 一种解压缩方法及装置
WO2023179800A1 (fr) Procédé de réception de communication et appareil associé
CN112597082B (zh) 总线的数据传输方法及电子设备
US20240154622A1 (en) System and method for extracting data from a compressed and encrypted data stream

Legal Events

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

Ref document number: 12883328

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12883328

Country of ref document: EP

Kind code of ref document: A1