+

WO2013033895A1 - Procédé de compression et de décompression de données, programme, support de stockage et produit électronique - Google Patents

Procédé de compression et de décompression de données, programme, support de stockage et produit électronique Download PDF

Info

Publication number
WO2013033895A1
WO2013033895A1 PCT/CN2011/079417 CN2011079417W WO2013033895A1 WO 2013033895 A1 WO2013033895 A1 WO 2013033895A1 CN 2011079417 W CN2011079417 W CN 2011079417W WO 2013033895 A1 WO2013033895 A1 WO 2013033895A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
initial
sequence
character sequence
algorithm
Prior art date
Application number
PCT/CN2011/079417
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 PCT/CN2011/079417 priority Critical patent/WO2013033895A1/fr
Publication of WO2013033895A1 publication Critical patent/WO2013033895A1/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
    • 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/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code

Definitions

  • the present invention relates to a method of compressing and decompressing data, and related programs, storage media and electronic products, and more particularly to lossless recompression of compressed data. Background technique
  • the present invention provides a method for compressing data (including compressed files of various formats), comprising the steps of: analyzing an initial character sequence of data to select a transform algorithm suitable for the initial character sequence,
  • the transform algorithm is an algorithm that can lengthen the run length of the character sequence by a certain transform; the selected transform algorithm is used for the initial character sequence to obtain a new character sequence having a longer run length;
  • the sequence adds a character for recording the transformation algorithm; and obtains a program sequence of the new character sequence by run-length encoding the new character sequence, thereby obtaining compressed data.
  • the initial character sequence is a binary number
  • the transform algorithm includes one of the following algorithms or a combination of several algorithms: inverting the initial character sequence in a regular digit, which may be an initial The even-numbered bits of the sequence of characters are inverted or the bits of each two-bit interval of the initial sequence of characters are inverted; the adjacent n-bit characters of the initial sequence of characters are entirely exchanged, n is an integer greater than or equal to 2; and the initial character a combination of fixed characters in the sequence Conventional replacement.
  • the transform algorithm is a combination of a plurality of different algorithms that continuously perform a plurality of different transforms on the same sequence of characters or a plurality of different algorithms that are used for character sequences of different fields in the initial character sequence. combination.
  • the analyzing the initial character sequence of the data comprises: applying a plurality of transform algorithms to the initial character sequence exhaustively, and comparing the compression ratios obtainable by the respective transform algorithms to obtain a data compression ratio
  • the transform algorithm searches for a specific character type in the initial character sequence and compares the search results of the respective transform algorithms to determine an applicable transform algorithm.
  • the analyzing the initial character sequence of the data includes performing segmentation analysis on the initial character sequence.
  • a data decompression method comprising: obtaining, for a compressed data obtained according to the method described above, the new data from a program sequence of the compressed data by an inverse operation of run-length encoding a sequence of characters, obtaining the transformation algorithm of the record, applying an inverse operation of the transformation algorithm to the new sequence of characters, thereby obtaining an initial sequence of characters of the data.
  • the invention also provides a computer program comprising instructions adapted to cause a data processing apparatus to perform the above described compression method and/or data decompression method.
  • the present invention also provides a storage medium including a computer program, wherein the program causes a compression method according to the present invention to be performed on the initial data when storing initial data to the storage medium, thereby obtaining compression of the initial data Data; when the initial data is copied from the storage medium to the outside, a decompression method according to the present invention is performed on the compressed data, thereby decompressing the compressed data into the initial data. Compression is lossless compression, obeying the protocol of data transmission.
  • the present invention also provides an electronic product comprising the storage medium according to the above.
  • the invention realizes lossless recompression of data (including compressed data), greatly reduces the data storage cost, and accelerates the data network ⁇ "transmission, especially in the multi-faceted application of the streaming media network, such as video, audio, Transmission of images, files, etc., has great value.
  • FIG. 1 is a flow chart of a data compression method in accordance with the present invention. detailed description
  • step 1 of Fig. 1 data analysis is first performed on the initial data to be compressed.
  • the data used in the computer system is a binary number, where the initial data is selected as a binary character sequence for ease of explanation.
  • This application has a very strong unique function for further compression of compressed data, however, the method of the present application is equally applicable to uncompressed data.
  • the data sequence to be compressed by the method of the present invention is
  • the data is a compressed data sequence.
  • a plurality of transform algorithms can be applied to the data sequence, and the transform algorithm is an algorithm that can lengthen the run length of the character sequence by a certain transform.
  • the first conversion algorithm is to invert the even bits of the data sequence
  • the new sequence after the inversion of the even bits of the sequence is:
  • the second transformation algorithm is to invert the data sequence every two bits, and the new data sequence obtained by performing the transformation on the initial data sequence is:
  • the third transformation algorithm is to exchange adjacent n-bit characters of the data sequence, and n is an integer greater than or equal to 2.
  • the initial data sequence is transformed by converting adjacent three-bit characters of the data sequence.
  • the new data sequence is:
  • the fourth transformation algorithm is to replace the fixed character combination in the data sequence by, for example, replacing "10" in the initial data with 1, replacing "11” with 0, and performing the transformation on the initial data sequence.
  • the new data sequence obtained is:
  • transformation algorithms are merely exemplary, and those skilled in the art can design more transformation algorithms based on the content, and the transformation algorithm can be more complicated, and can be a transformation in the form of a calculation formula, which can be continuous on the same character sequence.
  • a combination of a plurality of different algorithms of a plurality of different transforms may also be a combination of a plurality of different algorithms for a sequence of characters of different fields in the initial character sequence, as long as it can ultimately lengthen the run length of the data.
  • the above initial data has a longer run length after the first type of transformation than after the second type of transformation, thereby facilitating data compression. Therefore, the initial data to be compressed needs to be analyzed to select the transform algorithm that is most suitable for the data.
  • a plurality of transform algorithms may be exhaustively applied to the initial data, and the compression ratios obtainable by the respective transform algorithms may be compared to obtain a transform algorithm that optimizes the data compression ratio, and the initial characters may also be Search for a specific transformation in the sequence The specific character type for which the method is directed, and compares the search results of the respective transform algorithms to determine the applicable transform algorithm.
  • Other methods for analyzing data to obtain a transformation algorithm matched thereto are also contemplated by those skilled in the art, and are all included within the scope of the present invention.
  • the selected transform algorithm is applied to the initial data to transform the data.
  • the selected transform algorithm may be a single algorithm or a combination of multiple algorithms, which is determined according to the condition of the specific initial data.
  • step 3 of Fig. 1 the transform algorithm is recorded in the transformed data sequence.
  • a plurality of transform algorithms can be numbered and numbered markers added to the transformed data sequence to record the transform algorithm.
  • step 4 of Figure 1 the transformed data is run-length encoded to implement compression of the data.
  • the data sequence after the first transformation can be represented as a swim-up column:
  • step 5 the above-mentioned swim program column is represented by a binary number and is the compressed data.
  • the decompression method according to the present invention is the inverse of the above compression method, comprising: obtaining, for the compressed data obtained by the above compression method, the transformed data from the run sequence of the compressed data by an inverse operation of the run length encoding Sequence, obtaining the transformation algorithm of the record, applying an inverse operation of the transformation algorithm to the transformed data sequence, thereby obtaining an initial data sequence of the data.
  • the compression method of the present invention obtains the effect of compression by transforming the data without any deletion or corruption of the initial data
  • the compression method of the present invention is a lossless compression method.
  • Both the compression method and the decompression method according to the present invention can be implemented in the form of a computer program.
  • the present invention may also be embodied as a storage medium including a calculation order, wherein the program is: when storing initial data to the storage medium, the initial data is compressed according to the present invention, thereby obtaining the initial data. Compressing data; when copying the initial data from the storage medium to the outside, performing a decompression method according to the present invention on the compressed data, thereby The compressed data is decompressed into the initial data.
  • the storage medium described herein can be a flash memory, an optical disk, or other storage device as known to those skilled in the art.
  • the present invention can also be embodied as various electronic products including the storage medium according to the present invention, so that data can be stored in a small amount of data when copying data or downloading data from a network, while returning to the original data at the time of decompression without Any damage to the original data.
  • Examples of such electronic products may be smartphones, MP4 players, or other electronic devices known to those skilled in the art.
  • the compression method of the invention further lossless compression of the compressed data can be realized, a compression ratio of at least 50% can be achieved, and high-speed compression can be achieved, thereby greatly reducing the data storage cost and greatly accelerating the data network.
  • the speed of transmission can significantly improve the application of streaming media transmission, real-time playback and so on.
  • the compression method of the present invention is applicable to various file formats of computers.

Landscapes

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

Abstract

L'invention porte sur un procédé de compression et de décompression de données, sur un programme, sur un support de stockage et sur un produit électronique. Le procédé de compression de données selon la présente invention comprend les étapes consistant à : analyser une chaîne de caractères initiale de données de manière à sélectionner un algorithme de transformation applicable à la chaîne de caractères initiale, l'algorithme de transformation étant un algorithme qui peut étendre une longueur de plage d'une chaîne de caractères; appliquer l'algorithme sélectionné à la chaîne de caractères initiale de manière à obtenir une nouvelle chaîne de caractères ayant une plus grande longueur de plage; ajouter un caractère pour recoder l'algorithme de transformation à la nouvelle chaîne de caractères; et obtenir une longueur de plage de la nouvelle chaîne de caractères par exécution d'un codage de longueur de plage sur la nouvelle chaîne de caractères, de manière à obtenir des données compressées.
PCT/CN2011/079417 2011-09-07 2011-09-07 Procédé de compression et de décompression de données, programme, support de stockage et produit électronique WO2013033895A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/079417 WO2013033895A1 (fr) 2011-09-07 2011-09-07 Procédé de compression et de décompression de données, programme, support de stockage et produit électronique

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/079417 WO2013033895A1 (fr) 2011-09-07 2011-09-07 Procédé de compression et de décompression de données, programme, support de stockage et produit électronique

Publications (1)

Publication Number Publication Date
WO2013033895A1 true WO2013033895A1 (fr) 2013-03-14

Family

ID=47831439

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/079417 WO2013033895A1 (fr) 2011-09-07 2011-09-07 Procédé de compression et de décompression de données, programme, support de stockage et produit électronique

Country Status (1)

Country Link
WO (1) WO2013033895A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039374A (zh) * 2006-03-14 2007-09-19 联想(北京)有限公司 一种图像无损压缩和图像解压缩方法
CN101198056A (zh) * 2006-12-05 2008-06-11 华为技术有限公司 变长编码方法及装置
US20100117875A1 (en) * 2008-11-10 2010-05-13 Apple Inc. System and method for compressing a stream of integer-valued data

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039374A (zh) * 2006-03-14 2007-09-19 联想(北京)有限公司 一种图像无损压缩和图像解压缩方法
CN101198056A (zh) * 2006-12-05 2008-06-11 华为技术有限公司 变长编码方法及装置
US20100117875A1 (en) * 2008-11-10 2010-05-13 Apple Inc. System and method for compressing a stream of integer-valued data

Similar Documents

Publication Publication Date Title
US20210400278A1 (en) Codebook generation for cloud-based video applications
US20200153942A1 (en) Method and system for transmitting a data file over a data network
US8275897B2 (en) System and methods for accelerated data storage and retrieval
CN104504307B (zh) 基于拷贝单元的音视频拷贝检测方法和装置
US11575947B2 (en) Residual entropy compression for cloud-based video applications
CN112188198B (zh) 图像数据压缩解压方法及系统
US10366698B2 (en) Variable length coding of indices and bit scheduling in a pyramid vector quantizer
CN109983535B (zh) 具有子带能量平滑的基于变换的音频编解码器和方法
CN113271467B (zh) 一种支持高效编辑的超高清视频分层编解码方法
WO2013033895A1 (fr) Procédé de compression et de décompression de données, programme, support de stockage et produit électronique
KR101632689B1 (ko) 멀티미디어 조각파일의 복구방법
EP3461009A1 (fr) Archivage haute densité
Mohamed Wireless communication systems: Compression and decompression algorithms
Grzes Voice Long Distance Transmission Using Audio Codec for Low-Performance Microcontrollers and LoRa Communication for Use in IoT
JP2002135128A (ja) データ圧縮方法、データ圧縮・伸長方法、データ圧縮装置及びデータ圧縮・伸長装置
Compression et al. Data Compression
KR100975063B1 (ko) 가변 길이 부호화된 비트스트림을 복호화하기 위한 장치및 그 방법과 이를 구현하기 위한 프로그램이 기록된 기록매체
JP4008457B2 (ja) データ圧縮システムおよびデータ圧縮プログラム

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: 11872052

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11872052

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载