A data restoration method for using public data compression binary code

Abstract

A data restoration method using a public data compressed binary code stores received data in a storage device, transfers the data into a memory, restores the data through calculation by a CPU, and stores the restored data in the storage device, wherein the specific steps are as follows: a first step is to receive a data frame, store a public data unit, a static address of the public data unit, and compressed data in the storage device, and record a dynamic address of the public data unit; a second step is to extract a mapping relationship between the dynamic address of the public data unit and the static address of the public data unit; a third step is to replace the static address of the public data unit in the compressed data with the public data unit according to the mapping relationship between the dynamic address of the public data unit and the static address of the public data unit; and a fourth step is to obtain complete data.

Description

Technical Field

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

[0002] 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.

[0003] This patent is directed to a method of using common data compression binary code framing to restore compressed data.

[0004] Glossary:

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

[0006] The purpose of the present invention is to receive data framed by using a common data compression binary code, restore the compressed data, and provide a data restoration method for using a common data compression binary code.

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

[0008] A data restoration method for using a public data compression binary code stores received data in a storage device, transfers the data into a memory, restores the data through calculation by a CPU, and stores the restored data in the storage device. The specific steps are as follows:

[0009] The first step is to receive a data frame, store the public data unit, the static address of the public data unit, and the compressed data in a storage device, and record the dynamic address of the public data unit;

[0010] The second step is to extract the mapping relationship between the dynamic address of the public data unit and the static address of the public data unit;

[0011] The third step is to replace the static address of the public data unit in the compressed data with the public data unit according to the mapping relationship between the dynamic address of the public data unit and the static address of the public data unit;

[0012] The fourth step is to obtain complete data.

[0013] Compared with the prior art, the present invention has the following significant advantages: (1) recording the dynamic address of the public data unit, extracting the mapping relationship between the dynamic address of the public data unit and the static address of the public data unit, and ensuring the accuracy of data restoration; (2) for compressed data, the data can be flexibly restored according to the computing power situation without time limit. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] 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.

[0015] Figure 1 The invention discloses a data restoration flow chart for a data restoration method using a common data compression binary code. DETAILED DESCRIPTION

[0016] 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.

[0017] 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.

[0018] 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.

[0019] 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.

[0020] A specific embodiment is to restore data using a method of framing using a common data compression binary code.

[0021] Embodiment 1:

[0022] The present embodiment is a reverse process of a method for framing binary codes using common data compression, a method for framing binary codes using common data compression: dividing complete data into identical data units and different data units according to binary code data with the same label; extracting data of one identical data unit from data of multiple identical data units, storing the data in a storage device as data of a common data unit, and recording the stored static address, establishing a one-to-one mapping relationship between the common data unit and the static address; replacing the identical data units in the complete data with the static address of the common data unit to form compressed data; 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; recording the dynamic address of the common data unit.

[0023] Combination Figure 1 , a data restoration flow chart for a data restoration method using a common data compression binary code;

[0024] Receive the data frame, store the public data unit, the static and dynamic addresses of the public data unit, and the compressed data in the storage, and record the dynamic address of the public data unit.

[0025] A piece 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, 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 14The common data unit of the equal relationship is: G3 = S3 = S8 = S 11 =S 14 .

[0026] Data compression stage:

[0027] 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, public data units G1, G2, G3, the static addresses corresponding to the public data units are: D1, D2, D3, and their 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)}.

[0028] Data reception:

[0029] Receive compressed data, a common data unit, and a static address corresponding to the common data unit.

[0030] 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 is stored in the memory; the public data units G1, G2, G3 are stored in the memory, and the static addresses D'1, D'2, D'3 of the current public data units G1, G2, G3 are extracted; the dynamic addresses of the public data units G1, G2, G3 are extracted, and the one-to-one mapping relationship of the static address change track of the public data units G1, G2, G3 is: {(f: D1→…→D'1), (f -1 :D'1→...→D1)}, {(f:D2→...→D'2), (f -1 :D'2→...→D2)}, {(f:D3→...→D'3), (f -1:D'3→…→D3)}, "…" represents multiple dynamic addresses; in the one-to-one mapping relationship of the address change track of the public data units G1, G2, and G3, the one-to-one mapping relationship between the static addresses D1, D2, and D3 of the public data units G1, G2, and G3 in the data compression stage and the static addresses D'1, D'2, and D'3 of the current public data units G1, G2, and G3 is simplified as follows: {(f:D1→D'1), (f -1 :D'1→D1)}, {(f:D2→D'2), (f -1 :D'2→D2)}, {(f:D3→D'3), (f -1 :D'3→D3)}.

[0031] Data restoration phase:

[0032] The static addresses D1, D2, D3 of the public data units G1, G2, G3 in the data compression stage, the static addresses D'1, D'2, D'3 of the current public data units G1, G2, G3, and the public data units G1, G2, G3, the one-to-one mapping relationship between the above three is: {(f: G1→D1→D'1), (f -1 :D'1→D1→G1)}, {(f:G2→D2→D'2), (f -1 :D'2→D2→G2)}, {(f:G3→D3→D'3), (f -1 :D'3→D3→G3)}; According to the one-to-one mapping relationship {(f:G1→D1→D'1), (f -1 :D'1→D1→G1)}, {(f:G2→D2→D'2), (f -1 :D'2→D2→G2)}, {(f:G3→D3→D'3), (f -1 :D'3→D3→G3)}, compress the 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 , the static address of the public data unit in D1 is restored to the public data unit; restored to a piece of data G1, G2, G3, G2, G1, S6, G2, G3, G1, S 10 , G3, G1, S 13 , G3, G1, S 16 , S 17 , G2, G1, G2, S 21 , G1; G1 is the data unit S1, S5, S9, S 12 , S15 , 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 , restored to a complete data 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 .

[0033] The data units of complete data 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 , n is a natural number. 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 =S19 =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 ; And so on, the data units of complete 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 ,……,S n Use the same method.

[0034] Data compression stage:

[0035] 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, ..., S n , public data units G1, G2, G3, ..., G n , the static addresses corresponding to the public data units are: 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 )}.

[0036] Data reception:

[0037] Receive compressed data, public data units, and static addresses corresponding to the public data units, and receive and record dynamic addresses of the public data units.

[0038] 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 Store in the memory; store the public data units G1, G2, G3, ..., G n Stored in the memory, and extract the current public data unit G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n ; Extract common data units G1, G2, G3, ..., G n The dynamic address of the data compression stage, the public data units G1, G2, G3, ..., G n The static addresses D1, D2, D3, ..., D n , the one-to-one mapping relationship of the public data unit address change trajectory is: {(f: D1→…→D'1), (f -1 :D'1→…→D1)}, {(f:D2→…→D'2), (f -1 :D'2→...→D2)}, {(f:D3→...→D'3), (f -1 :D'3→…→D3)},…,{(f:D n →…→D' n ), (f -1 :D' n →…→D n )}, "..." represents multiple dynamic addresses; in the public data units G1, G2, G3, ..., G n In the one-to-one mapping relationship of the address change track, it is simplified to the public data units G1, G2, G3, ..., G n The static addresses D1, D2, D3, ..., D n , and the current public data units G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n The one-to-one mapping relationship is: {(f:D1→D'1), (f -1 :D'1→D1)}, {(f:D2→D'2), (f -1:D'2→D2)}, {(f:D3→D'3), (f -1 :D'3→D3)},...,{(f:D n →D' n ), (f -1 :D' n →D n )}.

[0039] Data restoration phase:

[0040] The common data units G1, G2, G3, ..., G in the data compression stage n The static addresses D1, D2, D3, ..., D n , the current public data units G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n , public data units G1, G2, G3, ..., G n , the one-to-one mapping relationship among the above three: {(f:G1→D1→D'1), (f -1 :D'1→D1→G1)}, {(f:G2→D2→D'2), (f -1 :D'2→D2→G2)}, {(f:G3→D3→D'3), (f -1 :D'3→D3→G3)},...,{(f:G n →D n →D' n ), (f -1 :D' n →D n →G n )}; According to the one-to-one mapping relationship {(f:G1→D1→D'1), (f -1 :D'1→D1→G1)}, {(f:G2→D2→D'2), (f -1 :D'2→D2→G2)}, {(f:G3→D3→D'3), (f -1 :D'3→D3→G3)},...,{(f:G n →D n →D' n ), (f -1 :D' n →D n →G n )}, the 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, S21 , D1, ..., S n , restored to complete data containing common data units G1, G2, G3, G2, G1, S6, G2, G3, G1, S 10 , G3, G1, S 13 , G3, G1, S 16 , S 17 , G2, G1, G2, S 21 , G1, ..., S n ; 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 the 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 the data unit S3, S8, S 11 , S 14 The common data unit of the equal relationship is: G3 = S3 = S8 = S 11 =S 14 , and so on G n The equality relationship is restored to the complete 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 ,……,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.

[0041] Compared with the prior art, the beneficial effects of the present invention include: (1) public data units G1, G2, G3, ..., G n Stored in the memory, and extract the current public data unit G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n ; Extract common data units G1, G2, G3, ..., G n The dynamic address of the data compression stage, the public data units G1, G2, G3, ..., G n The static addresses D1, D2, D3, ..., D n , the one-to-one mapping relationship of the public data unit address change trajectory is: {(f: D1→…→D'1), (f -1 :D'1→...→D1)}, {(f:D2→...→D'2), (f -1 :D'2→...→D2)}, {(f:D3→...→D'3), (f -1 :D'3→…→D3)},…,{(f:D n →…→D' n ), (f -1 :D' n →…→D n )}, accurately find the public data units G1, G2, G3, ..., G n The change track of the address provides the basis for data restoration; (2) The path of data restoration is: the public data units G1, G2, G3, ..., G n The static addresses D1, D2, D3, ..., D n , the current public data units G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n , public data units G1, G2, G3, ..., G n , the one-to-one mapping relationship among the above three: {(f:G1→D1→D'1), (f -1 :D'1→D1→G1)}, {(f:G2→D2→D'2), (f -1 :D'2→D2→G2)}, {(f:G3→D3→D'3), (f -1 :D'3→D3→G3)},...,{(f:G n →D n →D' n ), (f -1 :D' n →D n →G n)}; (3), 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.

[0042] 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 restoring data using a public data compression binary code, characterized in that: The received data is stored in the storage, the data is transferred to the memory, the data is restored after the CPU calculates, and the restored data is stored in the storage. The specific steps are as follows: The first step is to receive a data frame, store the public data unit, the static address of the public data unit, and the compressed data in a storage device, and record the dynamic address of the public data unit; The second step is to extract the mapping relationship between the dynamic address of the public data unit and the static address of the public data unit; The third step is to replace the static address of the public data unit in the compressed data with the public data unit according to the mapping relationship between the dynamic address of the public data unit and the static address of the public data unit; The fourth step is to obtain complete data; The public data units G1, G2, G3, ..., G n Stored in the memory, and extract the current public data unit G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n ; Extract common data units G1, G2, G3, ..., G n The dynamic address of the data compression stage, the public data units G1, G2, G3, ..., G n The static addresses D1, D2, D3, ..., D n , the one-to-one mapping relationship of the public data unit address change trajectory is: {(f: D1→…→D'1), (f -1 :D'1→…→D1)}, {(f:D2→…→D'2), (f -1 :D'2→...→D2)}, {(f:D3→...→D'3), (f -1 :D'3→…→D3)},…,{(f:D n →…→D' n ), (f -1 :D' n →…→D n )}, "..." indicates multiple dynamic addresses; Simplified to the common data units G1, G2, G3, ..., G n The static addresses D1, D2, D3, ..., D n , and the current public data units G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n The one-to-one mapping relationship is: {(f:D1→D'1), (f -1 :D'1→D1)}, {(f:D2→D'2), (f -1 :D'2→D2)}, {(f:D3→D'3), (f -1 :D'3→D3)},...,{(f:D n →D' n ), (f -1 :D' n →D n )}; The common data units G1, G2, G3, ..., G in the data compression stage n The static addresses D1, D2, D3, ..., D n , the current public data units G1, G2, G3, ..., G n The static addresses D'1, D'2, D'3, ..., D' n , public data units G1, G2, G3, ..., G n , the one-to-one mapping relationship among the above three: {(f:G1→D1→D'1), (f -1 :D'1→D1→G1)}, {(f:G2→D2→D'2), (f -1 :D'2→D2→G2)}, {(f:G3→D3→D'3), (f -1 :D'3→D3→G3)},...,{(f:G n →D n →D' n ), (f -1 :D' n →D n →G n )}; According to the one-to-one mapping relationship {(f:G1→D1→D'1), (f -1 :D'1→D1→G1)}, {(f:G2→D2→D'2), (f -1 :D'2→D2→G2)}, {(f:G3→D3→D'3), (f -1 :D'3→D3→G3)},...,{(f:G n →D n →D' n ), (f -1 :D' n →D n →G n )}, the 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 , restored to complete data containing common data units G1, G2, G3, G2, G1, S6, G2, G3, G1, S 10 , G3, G1, S 13 , G3, G1, S 16 , S 17 , G2, G1, G2, S 21 , G1, ..., S n ; G1 is the 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 the 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 the data unit S3, S8, S 11 , S 14 The common data unit of the equal relationship is: G3 = S3 = S8 = S 11 =S 14 , and so on G n The equality relationship is restored to the complete 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 ,……,S n .

2. A method for restoring data using a public 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