A method for framing using common data compression binary code

Abstract

A method for framing by using common data compressed binary code, which calls complete data in a storage into a memory, compresses the data through calculation by a CPU, and stores the compressed data in the storage; the specific steps are as follows: a first step, dividing the complete data into identical data units and different data units according to the binary code data with the same label; a second step, extracting data of one identical data unit from data of multiple identical data units, storing the data in the storage as data of a common data unit, and recording the stored static address, and establishing a one-to-one mapping relationship between the common data unit and the static address; a third step, replacing the identical data unit in the complete data with the static address of the common data unit to form compressed data; a fourth step, assembling the common data unit, the static address of the common data unit, and the compressed data into a frame, and sending the data frame; a fifth step, recording the dynamic address of the common data unit.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, in particular to a method for framing using public data compression binary codes. Background Art

[0002] The so-called data frame is the protocol data unit of the data link layer, which consists of three parts: frame header, data part, and frame trailer. The frame header and frame trailer contain some necessary control information, such as synchronization information, address information, error control information, etc. The data part contains the data passed down from the network layer, such as IP data packets, etc.

[0003] Before data is framed, data is compressed. Data compression refers to a technical method that reduces the amount of data to reduce storage space, improves its transmission, storage and processing efficiency, or reorganizes data according to a certain algorithm to reduce data redundancy and storage space without losing useful information. Data compression includes lossy compression and lossless compression.

[0004] In computer science and information theory, data compression or source coding is the process of representing information using fewer bits, or other information-related units, than the uncoded form according to a particular coding scheme.

[0005] In the field of satellite communications, the satellite's data transmission capabilities to the ground are constantly facing new technical challenges. Faced with the demand for payload data transmission rates reaching several Gbps, ground station capabilities and channel coding capabilities have approached the limits of technical realization; existing conventional data transmission technologies need to improve data transmission capabilities, which places great demands on channels and satellite resources, and channel bandwidth and transmission power have become resource bottlenecks; image information and video information collected by satellites, and the same data in image information and video information, compress the same data.

[0006] A system for scanning and marking identical data before data transmission, patent application number: 202210855327.1, scans the binary code data to be transmitted and marks the same binary code data. As the basis for compressing data, it is urgent to propose a method for using public data to compress binary code framing to solve the above problems.

[0007] Glossary:

[0008] Complete data: emphasizes the integrity of data files; data: refers to data with general meaning. Summary of the invention

[0009] The purpose of the present invention is to find out the same data in binary code data before the binary code data is transmitted, set the same data as public data, the public data and the address are in a one-to-one correspondence, and use the address of the public data to replace the same data in the complete data. The data is compressed and framed, and a method for compressing binary code framing using public data is provided.

[0010] The technical solution to achieve the purpose of the present invention is:

[0011] A method for framing using a common data compression binary code, transferring the complete data in the storage into the memory, compressing the data through CPU calculation, and storing the compressed data in the storage; the specific steps are as follows:

[0012] The first step is to divide the complete data into the same data units and different data units according to the binary code data with the same label;

[0013] The second step is to extract the data of one identical data unit from the data of multiple identical data units, store the data of one identical data unit in a storage device as the data of a common data unit, and record the static address of the storage, so that a one-to-one mapping relationship is established between the common data unit and the static address;

[0014] The third step is to replace the same data units in the complete data with the static addresses of the common data units to form compressed data;

[0015] The fourth step is to assemble the public data unit, the static address of the public data unit, and the compressed data into a frame and send the data frame;

[0016] The fifth step is to record the dynamic address of the public data unit.

[0017] Compared with the prior art, the present invention has the following significant advantages: 1. Binary code data is compared to find the same data, and the data of one same data unit is extracted from the data of multiple same data units, and stored in a storage device as the data of a common data unit, and the stored static address is recorded, and a one-to-one mapping relationship is established between the common data unit and the static address; 2. The same data unit in the complete data is replaced by the static address of the common data unit to form compressed data; 3. The common data unit, the static address of the common data unit, and the compressed data are assembled into a frame.

[0018] The present invention is further described in detail below in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0020] Figure 1 The invention discloses a compressed data flow chart of a method for framing a common data compression binary code. DETAILED DESCRIPTION

[0021] To make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be described clearly and completely in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them.

[0022] Therefore, the following detailed description of the embodiments of the present invention is not intended to limit the scope of the invention claimed for protection, but merely represents some embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0023] It should be noted that, in the absence of conflict, the embodiments of the present invention and the features and technical solutions in the embodiments may be combined with each other.

[0024] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, further definition and explanation thereof is not required in subsequent drawings.

[0025] “—” indicates a simplified one-to-one mapping relationship.

[0026] Embodiment 1:

[0027] Combination Figure 1 , a compressed data flow chart of a method for framing using a common data compression binary code;

[0028] Data units of complete data 101: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S21 , S 22 ,……,S n , n is a natural number; the data length of the data unit of the complete data 101 can be longer or shorter. When the data length of the data unit of the complete data 101 is longer, the degree of data compression is higher. When the data length of the data unit of the complete data 101 is shorter, the degree of data compression is lower. The data length of the data unit of the complete data 101 is determined by the computing power of the CPU. The efficiency can only be improved if the data length of the data unit matches the computing power of the CPU.

[0029] The complete data 101 is divided into the same data unit 102 and the different data unit 103, and the data of the segment S1, S2, S3, S4, S5, S6, S7, S8, S9, S103 of the complete data 101 is 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 For example, according to the binary code data with the same label, S1, S5, S9, S 12 , S 15 , S 19 , S 22 For the same data unit, S2, S4, S7, S 18 , S 20 For the same data unit, S3, S8, S 11 , S 14 For the same data unit, S6, S 10 , S 13 , S 16 , S 17 , S 21 are different data units; and so on, the data units of the complete data 101 are: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,Sn Use the same method.

[0030] The public data unit 104 is established to complete the data 101 of a segment S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 For example, there are three public data units: G1, G2, G3; G1 is data unit S1, S5, S9, S 12 , S 15 , S 19 , S 22 The common data unit of the equal relationship is: G1 = S1 = S5 = S9 = S 12 =S 15 =S 19 =S 22 ; G2 is data unit S2, S4, S7, S 18 , S 20 The common data unit of the equal relationship is: G2 = S2 = S4 = S7 = S 18 =S 20 ; G3 is data unit S3, S8, S 11 , S 14 The common data unit of the equal relationship is: G3 = S3 = S8 = S 11 =S 14 ; Similarly, the data units of the complete data 101 are: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,S n Use the same method.

[0031] The static address 105 of the public data unit is the public data unit: G1, G2, G3..., Gn Stored in the memory, extract the address corresponding to the public data unit: D1, D2, D3, ..., D n , and its one-to-one mapping relationship is: {(f:D1→G1), (f -1 :G1→D1)}, {(f:D2→G2), (f -1 :G2→D2)}, {(f:D3→G3), (f -1 :G3→D3)}, ..., {(f:D n →G n ), (f -1 :G n →D n )}; The number of bits of the public data unit is greater than the number of bits of the public data unit address information.

[0032] The compressed data 106, the public data unit is placed in the public area, according to the one-to-one mapping relationship between the public data unit and the address corresponding to the public data unit: {(f: D1→G1), (f -1 :G1→D1)}, {(f:D2→G2), (f -1 :G2→D2)}, {(f:D3→G3), (f -1 :G3→D3)}, ..., {(f:D n →G n ), (f -1 :G n →D n )}, with a segment of data S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 For example, the compressed data is: D1, D2, D3, D2, D1, S6, D2, D3, D1, S 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1; and so on, the data units of the complete data 101: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,S n The same data units in the same data unit are replaced by the static addresses of the common data units to form compressed data D1, D2, D3, D2, D1, S6, D2, D3, D1, S 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1, ..., S n ; Compressed data D1, D2, D3, D2, D1, S6, D2, D3, D1, S 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1, ..., S n It has the effect of data encryption.

[0033] The address 107 of the public data unit that constitutes the frame and dynamically manages the data is a segment of data S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 Take the public area data as an example: D1-G1, D2-G2, D3-G3, compressed data D1, D2, D3, D2, D1, S6, D2, D3, D1, S 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1 to form a frame and send the data frame; and so on, the data in the public area is D1-G1, D2-G2, D3-G3, ..., Dn —G n , compressed data D1, D2, D3, D2, D1, S6, D2, D3, D1, S 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1, ..., S n Form frames and send data frames; record common data units G1, G2, G3, ..., G n The dynamic address of the

[0034] Compared with the prior art, the beneficial effects of the present invention include: (1) the number of bits of the common data unit is greater than the number of bits of the common data unit address information, thereby achieving the purpose of compressed data; (2) the data length of the data unit of the complete data 101 is variable in length and shortened. When the data length of the data unit of the complete data 101 becomes longer, the degree of data compression becomes higher, and when the data length of the data unit of the complete data 101 becomes shorter, the degree of data compression becomes lower; (3) the data length of the data unit of the complete data 101 is determined by the computing power of the CPU. Only when the data length of the data unit matches the computing power of the CPU can the efficiency be improved; (4) the compressed data D1, D2, D3, D2, D1, S6, D2, D3, D1, S7, 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1, ..., S n It has the effect of data encryption.

[0035] Embodiment 2:

[0036] Data units of complete data 101: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,S n, n is a natural number; the data length of the data unit of the complete data 101 is variable in length and shortened. When the data length of the data unit of the complete data 101 becomes longer, the degree of data compression becomes higher, and when the data length of the data unit of the complete data 101 becomes shorter, the degree of data compression becomes lower.

[0037] The complete data 101 is divided into the same data unit 102 and the different data unit 103, and the data of the segment S1, S2, S3, S4, S5, S6, S7, S8, S9, S103 of the complete data 101 is 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 For example, according to the binary code data with the same label, S1, S5, S9, S 12 , S 15 , S 19 , S 22 For the same data unit, S2, S4, S7, S 18 , S 20 For the same data unit, S3, S8, S 11 , S 14 For the same data unit, S6, S 10 , S 13 , S 16 , S 17 , S 21 are different data units; and so on, the data units of the complete data 101 are: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,S n Use the same method.

[0038] The public data unit 104 is established to complete the data 101 of a segment S1, S2, S3, S4, S5, S6, S7, S8, S9, S10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 For example, there are three public data units: G1, G2, G3; G1 is data unit S1, S5, S9, S 12 , S 15 , S 19 , S 22 The common data unit of the equal relationship is: G1 = S1 = S5 = S9 = S 12 =S 15 =S 19 =S 22 ; G2 is data unit S2, S4, S7, S 18 , S 20 The common data unit of the equal relationship is: G2 = S2 = S4 = S7 = S 18 =S 20 ; G3 is data unit S3, S8, S 11 , S 14 The common data unit of the equal relationship is: G3 = S3 = S8 = S 11 =S 14 ; Similarly, the data units of the complete data 101 are: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,S n Use the same method.

[0039] The public data units: G1, G2, G3..., G n Stored in the memory, name the public data unit, the corresponding names are: M1, M2, M3, ..., M n , the one-to-one mapping relationship between the public data unit and the public data unit name is: {(f:M1→G1), (f -1:G1→M1)}, {(f:M2→G2), (f -1 :G2→M2)}, {(f:M3→G3), (f -1 :G3→M3)}, ..., {(f:M n →G n ), (f -1 :G n →M n )}; The number of digits in the public data unit is greater than the number of digits in the public data unit name.

[0040] The compressed data, the public data unit is placed in the public area, according to the one-to-one mapping relationship between the public data unit and the public data unit name: {(f: M1→G1), (f -1 :G1→M1)}, {(f:M2→G2), (f -1 :G2→M2)}, {(f:M3→G3), (f -1 :G3→M3)}, ..., {(f:M n →G n ), (f -1 :G n →M n )}, with a segment of data S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 For example, the compressed data is: M1, M2, M3, M2, M1, S6, M2, M3, M1, S 10 , M3, M1, S 13 , M3, M1, S 16 , S 17 , M2, M1, M2, S 21 , M1; and so on, the data units of the complete data 101: S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18, S 19 , S 20 , S 21 , S 22 ,……,S n The same data units in the same file are replaced by common data unit names; forming compressed data M1, M2, M3, M2, M1, S6, M2, M3, M1, S 10 , M3, M1, S 13 , M3, M1, S 16 , S 17 , M2, M1, M2, S 21 , M1, ..., S n ; Compressed data M1, M2, M3, M2, M1, S6, M2, M3, M1, S 10 , M3, M1, S 13 , M3, M1, S 16 , S 17 , M2, M1, M2, S 21 , M1, ..., S n It has the effect of data encryption.

[0041] The frame is composed of a segment of data S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 For example, the public area data: M1-G1, M2-G2, M3-G3, the compressed data M1, M2, M3, M2, M1, S6, M2, M3, M1, S 10 , M3, M1, S 13 , M3, M1, S 16 , S 17 , M2, M1, M2, S 21 , M1 to form a frame and send the data frame; and so on, the data in the public area is M1-G1, M2-G2, M3-G3, ..., M n —G n , compressed data M1, M2, M3, M2, M1, S6, M2, M3, M1, S 10 , M3, M1, S 13 , M3, M1, S 16 , S17 , M2, M1, M2, S 21 , M1, ..., S n Form frames and send data frames.

[0042] Compared with the prior art, the beneficial effects of the present invention include: (1) the number of bits of the common data unit is greater than the number of bits of the common data unit name, thereby achieving the purpose of compressed data; (2) the data length of the data unit of the complete data 101 is variable in length and shortened, and when the data length of the data unit of the complete data 101 becomes longer, the degree of data compression becomes higher, and when the data length of the data unit of the complete data 101 becomes shorter, the degree of data compression becomes lower; (3) the compressed data M1, M2, M3, M2, M1, S6, M2, M3, M1, S 10 , M3, M1, S 13 , M3, M1, S 16 , S 17 , M2, M1, M2, S 21 , M1, ..., S n It has the effect of data encryption.

[0043] The above embodiments are only used to illustrate the present invention and are not intended to limit the technical solutions described in the present invention. Although the present invention has been described in detail with reference to the above embodiments, the present invention is not limited to the above specific implementation methods. Therefore, any modification or equivalent replacement of the present invention; and all technical solutions and improvements thereof that do not depart from the spirit and scope of the invention are included in the scope of the claims of the present invention.

Claims

1. A method for framing using a common data compression binary code, characterized in that: The complete data in the storage is transferred to the memory, the data is compressed by the CPU calculation, and the compressed data is stored in the storage; The specific steps are as follows: In the first step, the complete data (101) is divided into identical data units and different data units according to the binary code data with the same label; The second step is to extract the data of one identical data unit from the data of multiple identical data units, store the data of one identical data unit in a storage device as the data of a common data unit, and record the static address of the storage, so that a one-to-one mapping relationship is established between the common data unit and the static address; The third step is to replace the same data units in the complete data (101) with the static addresses of the common data units to form compressed data; The fourth step is to assemble the public data unit, the static address of the public data unit, and the compressed data into a frame and send the data frame; The fifth step is to record the dynamic address of the public data unit; The public data units: G1, G2, G3..., G n Stored in the memory, extract the address corresponding to the public data unit: D1, D2, D3, ..., D n , the one-to-one mapping relationship is: {(f:D1→G1), (f -1 : G1→D1)}, {(f: D2→G2), (f -1 : G2→D2)}, {(f: D3→G3), (f -1 : G3→D3)},……,{(f:D n →G n ), (f -1 : G n →D n )}; The data units of the complete data (101): S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,S n The same data units in the same data unit are replaced by the static addresses of the common data units to form compressed data D1, D2, D3, D2, D1, S6, D2, D3, D1, S 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1, ..., S n .

2. A method for framing using a common data compression binary code according to claim 1, characterized in that: Data units of complete data (101): S1, S2, S3, S4, S5, S6, S7, S8, S9, S 10 , S 11 , S 12 , S 13 , S 14 , S 15 , S 16 , S 17 , S 18 , S 19 , S 20 , S 21 , S 22 ,……,S n .

3. A method for framing using a common data compression binary code according to claim 2, characterized in that: The data length of the data unit of the complete data (101) can be made longer and shorter.

4. A method for framing using a common data compression binary code according to claim 3, characterized in that: The data length of the data unit of the complete data (101) is determined by the computing capability of the CPU.

5. A method for framing using a common data compression binary code according to claim 1, characterized in that: The number of bits of the common data unit is greater than the number of bits of the address information of the common data unit.

6. A method for framing using a common data compression binary code according to claim 1, characterized in that: Compressed data D1, D2, D3, D2, D1, S6, D2, D3, D1, S 10 , D3, D1, S 13 , D3, D1, S 16 , S 17 , D2, D1, D2, S 21 , D1, ..., S n It has the effect of data encryption.

Images