TWI466453B - Digital data compression / decompression method and its system - Google Patents

Description

Digital data compression/decompression method and system thereof

The present invention relates to a digital data compression/decompression method and system thereof, and more particularly to a compression method and system capable of simultaneously providing non-distortion data compression and high data compression ratio when performing digital data compression.

In the prior art, the digital data compression technology is divided into two categories, the first type is a distortion-free compression technology, and the second type is a distortion compression technology. Among them, the characteristics of the technology without distortion compression can be completely restored to the original data, and because of this characteristic, the data compression ratio has lower problems than the distortion compression technology, and the demand for high data compression ratio cannot be achieved. Representatives of such distortion-free compression technologies are: communication data compression technology (ITU-T V.42bis), file-based compression technology (LZ78, LZW, ZIP, RAR); and distortion compression technology can easily achieve high data compression ratio. Demand, however, the distortion technology has the problem of not being able to restore the original data. Such distortion compression technology is represented by image compression technology (GIF, PNG, CALIC, JPEG) and other audio and video data compression technologies (MP3, JPEG). .

Therefore, it is necessary to provide a data compression technology, which can simultaneously have non-distortion data compression and high data compression ratio, so that the compression quality can be greatly improved.

One object of the present invention is to provide a digital data compression/decompression system. The system provides digital addresses for non-distortion data compression and high data compression ratio.

Another object of the present invention is to provide a digital data compression/decompression method for the purpose of compressing and decompressing digital data.

To achieve the above or other objects, the present invention provides a digital data compression/decompression system for compressing digital data having an M-bit address, which includes a Compressed iDentify Code Generator (CDCG). Compressed iDentify Code Table (CDCT), Compressed Cross Code Generator (CCCT), Address Check Unit (ACU), address content read/uncompress Address Read Unit (ARU) and Address Squeeze Unit (ASEU). The compressed identification code generating unit receives the digital address, and the compressed identification code generating unit generates a 2 ^M pen non-repetitive compressed identification code according to the digital address; the compressed identification code table unit has N ² fields. for storing 2 ^M strokes of the compression a summing result identification code in the same column; and the compressed cross-validation code table cell lines by the K ² pen compression cross-validation code consisting of the compressed cross-validation code based the number of bits in accordance with A comparison result of any field in the compressed identification code generated by the address and other fields is generated, wherein the compressed cross-validation codes respectively have L ² fields.

To achieve the above or other objects, the present invention provides a digital data compression/decompression method for compressing/decompressing digital data having M bits, the method comprising: receiving a digital address for generating 2 ^M a compressed identification code that does not repeat the pen and has a length of M ² field data; accumulates the same field in the compressed identification code to obtain an accumulated result and stores the compressed identification code table unit having N ² fields; and Comparing any field in the compressed identification code generated by the digital address with other fields to obtain a comparison result and storing the compressed cross-validation code table unit with L ² fields, wherein the other field and other The fields are only compared once each other.

That is, if both contents have a value greater than 0 at the same time, the field corresponding to the field in the compressed cross-validation code unit is filled with a value of 1 to form the compressed cross-validation code, and is accumulated and stored. a corresponding field in the corresponding compressed cross-validation code table unit; the address verification unit receives the compression identification code, the compressed cross-validation code and the compressed identification code table unit, and the compressed cross-validation code unit table to verify and determine the compression identification code, Whether the compressed cross-validation code has been stored in the compressed identification code table unit and the compressed cross-validation code table unit.

The address content reading/decompression unit receives the address verification unit and determines that the compressed identification code and the compressed cross-validation code have been stored in the compressed identification code table unit and the compressed cross-validation code table unit, indicating that the digital data solution is The compressed original data is 1, and vice versa, the original data after decompressing the digital data is 0.

The address compression unit receives the address verification unit and determines that the compressed identification code and the compressed cross-validation code are stored in the compressed identification code table unit and the compressed cross-validation code table unit, and the compressed identification code table unit is decompressed and compressed. The identification code compresses the cross-validation code table unit and subtracts the compressed cross-validation code to complete the compression and change of the data.

In other words, the digital data compressed by the compression method can be further converted by the compressed identification code table unit and the compressed cross-check code table unit by the compressed digital data address. The compressed cross-validation code is stored in the compressed identification code table unit and the compressed cross-validation code table unit for achieving the purpose of compressing or changing the compressed data to 0; otherwise, the digital data is converted The compressed identification code table unit and the compressed cross-validation code table unit formed by accumulating the compressed identification code of the address and the compressed cross-validation code are completed, thereby completing the digital data compression operation, in other words, the digital data And accumulating the compressed identification code converted by the digital data address and the compressed cross-check code to the compressed identification code table unit and the compressed cross-check code table unit and storing the compressed identification code table unit and the compressed cross The verification code table unit is used for the purpose of achieving the compression of the digital data and changing the compressed data to 1.

In addition, in another embodiment, the address compression unit may store between the compressed identification code table unit, the compressed cross-validation code table unit, the compressed identification code, and the compressed cross-check code according to a compression action thereof. The action of deleting/deleting may also define that the address compression unit is a compressed data storage/deletion unit, and in essence, the two definitions are the same.

Compared with the prior art, the present invention converts a digital address into an absolute non-repetitive compressed identification code, and generates a compressed cross-validation code by the compressed identification code, and separately accumulates and stores them to a corresponding compressed identification code table unit. And compressing the cross-validation code table unit to provide the digital data for compression; conversely, by comparing the compressed identification code table unit with the compressed cross-validation code table unit, the compressed data can be decompressed Therefore, the present invention can reduce the space for storing the digital data by a large amount of comparison with the prior art, so that the compression system and method for achieving non-distortion data compression and high data compression ratio can be achieved.

In order to fully understand the objects, features and advantages of the present invention, the present invention will be described in detail with reference to the accompanying drawings. A schematic diagram of a digital data compression/decompression system. In this embodiment, a digital data compression/decompression system 10 is provided for compressing a digital data DD having an M-bit address, which includes a compressed identification code generating unit 12 (CDCG) and a compressed identification code table unit 14. (CDCT), Compressed Cross-Validation Code Table Unit 16 (CCCT), Address Check Unit 18 (ACU), Address Content Read/Decompress Unit 20 (ARU) and Address Compression Unit 22 (ASEU). The compressed identification code generating unit 12 receives the digital address address DA and generates a corresponding complex compressed identification code CDC and a complex compressed cross-check code CCC. In addition, the compressed identification code generating unit 12 further includes a compressed identification code unit 122 and a compressed cross-checking code unit 124 for respectively generating the compressed identification code CDC and the compressed cross-check code CCC.

The compressed identification code unit 122 has M ² fields, and the digital address DA transmits the compressed identification code CDC having the 2 ^M pen absolute non-repetition through the compressed identification code unit 122 of the compressed identification code generating unit 12, such as Figure 2 shows.

The compressed cross-validation code unit 124 has L ² fields, and according to the content of the corresponding field of the compressed identification code CDC, when there is a value greater than 0, the corresponding corresponding to the compressed cross-code unit 124 A 1 is stored in the field to form the compressed cross-validation code CCC, as shown in FIG. For example, the compressed cross-validation code C _00-01 indicates that the fields 0-0 and 0-1 in the compressed cross-validation code unit 124 are determined. If the fields have values greater than 0, the compression is performed. The value in the field 0-1 of the field C ₀₀ of the cross-validation code unit 124 is incremented by one; the compressed cross-validation code C _00-0M indicates the fields 0-0 and 0-M in the compressed cross-validation code unit 124, If there is a value greater than 0 in the fields, the value in the 0-M field of C ₀₀ of the compressed cross-validation code unit 124 is incremented by 1. According to this rule, the cross-check code C _MM-M is compressed. _(M-1) indicates that when the fields MM and M(M-1) of the compressed cross-validation code unit 124 have a value greater than 0, the MM field of the C _MM of the compressed cross-validation code unit 124 is The value of 1 is added to form the compressed cross-validation code CCC.

The compressed identification code table unit 14 provides an accumulated result of the compressed identification code CDC having N ² fields for storing the same field. In other words, the content in the same field of the compressed identification code CDC generated by the digital address DA is added to the field corresponding to the compressed identification code table unit 14, for example, the content accumulation mode is as shown in the following equation. And the content accumulation is stored in the same field corresponding to the compressed identification code table unit 14, as shown in FIG. 4:

I ₀₀ =A ₀ (0,0)+A ₁ (0,0)+A ₂ (0,0)+...+A ₂ ^M-1 (0,0)+A ₂ ^M (0,0) ;

I ₀₁ =A ₀ (0,1)+A ₁ (0,1)+A ₂ (0,1)+...+A ₂ ^M-1 (0,1)+A ₂ ^M (0,1) ;

.

.

.

I _MM =A ₀ (M,M)+A ₁ (M,M)+A ₂ (M,M)+...+A ₂ ^M-1 (M,M)+A ₂ ^M (M,M) .

In addition, the compressed cross-validation code table unit 16 is composed of a K ² pen compression cross-validation code CCC, that is, the compressed cross-validation code CCC is based on any field in the compressed identification code CDC and other fields. A comparison result is produced.

The address verification unit 18 compares the compressed identification code CDC, the compressed cross-check code CCC, the compressed identification code table unit 14, and the compressed cross-validation code table unit 16 to determine whether the digital address DA is compressed. The identification code table unit 14 and the compressed cross-validation code table unit 16 are compressed. In other words, when it is determined whether the digital address address DA has been compressed in the compressed identification code table unit 14 and the compressed cross-validation code table unit 16, first, the compressed identification code table unit 14 and the compressed cross-validation code table unit 16 are The value of the compression identification code CDC and the compressed cross-validation code CCC are respectively subtracted, and based on the result of the comparison subtraction, it is determined whether the digital address address DA is compressed in the compressed identification code table unit 14 and the compressed cross-validation code table unit. 16, that is, whether it is correct or incorrect, for example, when the comparison subtracted compressed identification code table unit 14 and the compressed cross-validation code table unit 16 cannot mutually verify the association, that is, the compressed identification code CDC and the compressed cross-validation code CCC are indicated. If the error is determined, it further indicates that the digital data DD corresponding to the digital address DA is 0, which is not compressed in the compressed identification code table unit 14 and the compressed cross-validation code table unit 16; The reduced compression identification code table unit 14 and the compressed cross-validation code table unit 16 can mutually verify the association, that is, the compressed identification code CDC and the compressed cross-validation code CCC are determined as Indeed, further indicating that the digit address DA corresponds to the digital data DD of the contents of line 1, in which the compressed compression based cross-validation code table unit 1614 within the compression unit identification code table.

The address content reading/decompressing unit 20 judges the result from the address verifying unit 18, and when the output result of the address verifying unit 18 is correct, the value output by the address content reading/decompressing unit 20 is 1; conversely, when the output result of the address verifying unit 18 is an error, the value output by the address content reading/decompressing unit 20 is 0.

The address compression unit 22 adds the value of the compressed identification code CDC and the compressed cross-validation code CCC to the fields in the compressed identification code table unit 14 and the compressed cross-check code table unit 16, respectively, to achieve The digital data DD of the digital address DA is 1 for data compression purposes, as shown in FIG. 5; in another aspect, the address compression unit 22 provides the compressed identification code CDC and the compressed cross-validation code CCC. And subtracting the values of the fields in the compressed identification code table unit 14 and the compressed cross-validation code table unit 16 respectively, to achieve the data compression purpose of the digital address DA of the digital address DA being 0, as shown in FIG. Show.

Referring to FIG. 7, a flowchart of a digital data compression/decompression method according to an embodiment of the present invention is shown. In this embodiment, the digital data compression/decompression method is used to compress/decompress digital data having an M-bit address, and the method starts in step S1, and the digital data is received by the compressed identification code generating unit. Address, and generate a 2 ^M pen absolute non-repetitive M ² field data length compression identification code and L ² field compression cross-validation code, wherein the column between the compression identification code and the compression cross-check code The accumulation of bits is used to store the accumulated results into the compressed identification code table unit and the compressed cross-validation code table unit.

Next, in step S2, the compression identification code, the compressed cross-validation code, the value of the field in the compressed identification code table unit, and the value of the field in the compressed cross-validation code table unit are verified by the address verification unit, and then compared. Determining whether the compressed identification code and the compressed cross-validation code have been stored in the compressed identification code table unit and the compressed cross-check code table unit for generating a comparison result, and respectively decompressing according to the comparison result Process and compression process. Furthermore, the comparison determination is performed according to whether (i) the compressed identification code table unit and the value of the field in the compressed cross-validation code table unit are greater than 0, equal to 0 or less than 0, respectively. And (ii) whether the content of the compressed identification code table unit and the compressed cross-validation code table unit match each other to obtain a corresponding comparison result, wherein the definition of the matching is described in detail later.

In step S3, it is a decompression process, which is a continuation of the comparison of the step S2, that is, when the comparison result is compared with the value of the field in the compressed identification code table unit and the compressed cross-check code table unit. When the greater than or equal to 0 and the content of the compressed identification code table and the compressed cross-validation code table unit are mutually matched, the comparison result is expressed as "correct", and then the digital address content is Defined as 1; conversely, when the compressed identification code table unit is compared with the value of the field in the compressed cross-validation code table unit, it is less than 0 and the contents of the compressed identification code table unit and the compressed cross-validation code table unit are mutually When at least one of the mismatches is established, the comparison result is expressed as "error", which defines the contents of the digit address as 0.

In addition, those skilled in the art should be able to understand that the definition of the digital data decompression can be defined according to the user's habits, that is, the digital data can be reversed compared with the above embodiments.

In step S4, it is a compression process, which is similar to the comparison of the step S2, that is, when the compressed identification code table unit is compared with the value of the field in the compressed cross-validation code table unit, it is greater than or equal to 0 and when the contents of the compressed identification code table unit and the compressed cross-validation code table unit are mutually matched, the comparison result is expressed as "correct", and then the digital address is received, wherein the digital position The address is stored in the compressed identification code table unit and the compressed cross-validation code table unit and the content of the digital address is 1, and then the new content in the digital address is 1 or 0, to determine whether to update The compressed identification code table unit and the compressed cross-validation code table unit. When the new content in the digital address is 1, it indicates that the digital address is stored in the compressed identification code table unit and the compressed cross-check code table unit, that is, no action is performed on the digital address. Or, when the new content in the digital address is 0, the compressed identification code table unit and the compressed cross-check code table unit are subtracted from the compressed identification code or the compressed cross-check code. So that the content in the digit address is updated from 1 to 0.

Conversely, when the compressed identification code table unit is compared with the value of the field in the compressed cross-check code table unit, the value is less than 0, and the content of the compressed identification code table and the compressed cross-check code table unit does not match at least When it is established, the comparison result is expressed as "error", and then the digital address is received, wherein the digital address is not stored in the compressed identification code table unit and the compressed cross-certification code table unit and the digit The content of the address is 0, and then the new content in the digital address is 1 or 0 to decide whether to update the compressed identification code table unit and the compressed cross-check code table unit. And when the new content in the digital address is 1, the compressed identification code table unit and the compressed cross-check code table unit are respectively added to the compressed identification code or the compressed cross-check code, respectively, for The content in the digital address is updated from 0 to 1; or, when the new content in the digital address is 0, it indicates that the digital address is not stored in the compressed identification code table unit and the compressed cross-validation In the code table unit, that is, no action is performed on the digital address.

In other words, the step is to indicate the digital data that has been compressed by the compression method, and the compressed identification can be further deleted by the compressed identification code table unit and the compressed cross-check code table unit to delete the compressed digital data. a code and the compressed cross-validation code for achieving the purpose of changing the compressed digital data to 0; and storing the digital identification data by the compressed identification code converted by the digital data and the compressed cross-checking code The compressed identification code table unit and the compressed cross-validation code table unit are used to achieve the purpose of changing the compressed digital data to 1.

It should be noted that whether the content of the compressed identification code table mentioned above and the content of the compressed cross-validation code table unit match each other is further described herein. The definition of this match is based on:

(i) the unique compressed identification code will generate a unique compressed cross-validation code, and the only one of the compressed identification code and the compressed cross-validation code system respectively stored in different fields indicates the digital address Be unique;

(ii) subtracting the compressed identification code to be determined from the compressed identification code table, and subtracting the compressed cross-validation code to be determined from the compressed cross-validation code table;

(iii) By generating a compressed cross-validation code, the association between the field and the field in the compressed identification code can be recorded, that is, the compression identification code and the compressed cross-validation code have a unique correlation mode. . Furthermore, the association mode between each set of compressed identification code and the compressed cross-validation code is a compressed identification code table and a compressed cross-validation code table formed by accumulating according to the above-mentioned manner, and still inherits or maintains each other. Correlation, so when a non-existent occurrence of the compression identification code and the compression verification code will affect the association mode, resulting in an error in the association mode.

For example, according to the manner in which the compressed identification code table unit is generated, if there is data in both I ₀₀ and I ₀₈ , the value 1 is accumulated in the compressed cross-validation code table unit C _00-08 , and has 1 at this time. C-mode lines _00-08 of the association may be defined as C _00-08 corresponding to the I ₀₀ and I ₀₈ exists within the system information simultaneously.

In another example, if A ₀ (0, 0), A ₀ (0, 3), A ₀ ( ₀ , 5), and A ₀ ( _{0, 9} ) are both present in the first compression identification code, In the case of data, C _00-03 , C _00-05 and C _{00-09 in} the first compressed cross-validation code corresponding to the conversion are recorded as 1. At this time, the first compressed identification code and the first compressed cross-validation code are respectively stored in the corresponding first compressed identification code table unit and the first compressed cross-check code table unit. Furthermore, if there is a second compressed identification code input that is not stored in the first compressed identification code table unit and the first compressed cross-check code table unit, and the second compressed identification code is only A ₀ (0, 0), A ₀ (0,3) and A ₀ (0,9) When there is data in the memory, the same is recorded in the corresponding second compressed cross-validation code C _00-03 and C _00-09 as 1 when performing When judging, the first compressed identification code table unit (A ₀ (0,0), A ₀ (0,3), A ₀ (0,5) and A ₀ (0,9)) and the first compression The cross-validation code table unit (C _00-03 , C _00-05 and C _00-09 ) subtracts the second compression identification code (A ₀ (0,0), A ₀ (0,3) and A _{0 respectively)} (0,9)) and the second compressed cross-validation code (C _00-03 and C _00-09 ), which will result in the original first compressed identification code stored and the first compressed cross-check code being generated. The error of the association mode, which is due to the fact that only A ₀ ( ₀ , 5) remains when the first compression identification code is subtracted from the second compression identification code in the subtraction process, but corresponds to C _{00 -05} cross the first compression codes, both results clearly associated with the corrupted original mode, resulting in no match; , The identification code if the second compression system and the same identification code of the first compression, with the maintenance of the association mode can be judged that the identification code table is compressed with the compression unit cross-validation of the content code table match with each other. Further, the M, N, K, and L mentioned in the above are integers and may be the same integer.

Compared with the prior art, the present invention converts a digital address into an absolute non-repetitive compressed identification code, and generates a compressed cross-validation code by the compressed identification code, and separately accumulates and stores them to a corresponding compressed identification code table unit. And compressing the cross-validation code table unit to provide the digital data for compression; conversely, by comparing the compressed identification code table unit with the cross-validation code table unit, the decompressing action of the compressed data may be performed. Therefore, the present invention can reduce the space for data storage in a large amount, and can be used to achieve a non-distortion data compression and a high data compression ratio compression system and method.

The invention has been described above in terms of the preferred embodiments, and it should be understood by those skilled in the art that the present invention is not intended to limit the scope of the invention. It should be noted that variations and permutations equivalent to those of the embodiments are intended to be included within the scope of the present invention. Therefore, the scope of the invention is defined by the scope of the following claims.

12. . . Compressed identification code generating unit

14. . . Compressed identification code table unit

16‧‧‧Compressed cross-validation code table unit

18‧‧‧ address inspection unit

20‧‧‧Address content reading/decompression unit

22‧‧‧Address compression unit

122‧‧‧Compressed identification code unit

124‧‧‧Compressed cross-validation code unit

DA‧‧‧Digital Address

DD‧‧‧ digital data

CDC‧‧‧Compression Identification Code

CCC‧‧‧Compressed cross-validation code

1 is a block diagram showing a system of a digital data compression/decompression system according to an embodiment of the present invention;

2 is a schematic diagram of a compression identification code of a digital data compression/decompression system according to an embodiment of the present invention;

3 is a schematic diagram of a compressed cross-validation code of a digital data compression/decompression system according to an embodiment of the present invention;

4 is a schematic diagram of a compressed identification code table unit of a digital data compression/decompression system according to an embodiment of the present invention;

5 and 6 are schematic diagrams showing the operation of the address compression unit of the digital data compression/decompression system of the embodiment of the present invention;

Figure 7 is a flow chart of a digital data compression/decompression method according to an embodiment of the present invention.

10. . . Digital data compression/decompression system

12. . . Compressed identification code generating unit

14. . . Compressed identification code table unit

16. . . Compressed cross-validation code table unit

18. . . Address inspection unit

20. . . Address content read/uncompress unit

twenty two. . . Address compression unit

122. . . Compressed identification code unit

124. . . Compressed cross-validation code unit

DA. . . Digital address

DD. . . Digital data

CDC. . . Compression identification code

CCC. . . Compressed cross-validation code

Claims (11)

A digital data compression/decompression system for compressing/decompressing one bit of M-bit data, comprising: a compression identification code generating unit, receiving a digital address, and the compressed identification code generating unit is based on The digital address generates a compressed identification code that is not repeated by 2 ^M pens; and a compressed identification code table unit has N ² fields for storing an accumulated result of the same field in the 2 ^M pen compressed identification code; a compressed cross-validation code table unit is composed of a compressed cross-validation code of a K ² pen, and the compressed cross-validation code is generated according to a comparison result of any field in the compressed identification code with other fields, wherein the The equal-compression cross-validation code respectively has L ² fields; the address-checking unit is used to determine by using the compressed identification code, the compressed cross-validation code, the compressed identification code table unit and the compressed cross-validation code table unit. Whether the digital address is compressed in the compressed identification code table unit and the compressed cross-certification code table unit; the address-based content reading/decompressing unit is correspondingly input according to the judgment result of the address verification unit And a location compression unit, correspondingly providing the compressed identification code and the compressed cross-validation code to the compressed identification code table unit and the compressed cross-validation code table according to the determination result of the address verification unit Adding values of the fields in the unit, or providing the compression identification code and the compressed cross-validation code respectively subtracted from the values of the fields in the compressed identification code table unit and the compressed cross-validation code table unit to complete the digital position The data of the digital data of the address is compressed. The digital data compression/decompression system according to claim 1, wherein the comparison result is when any field in the compression identification code is compared with other fields, if any column in the compression identification code When both the bit and the other fields are greater than 0, the field of the compressed cross-check code table unit corresponding to the corresponding one is incremented by one. The digital data compression/decompression system of claim 2, wherein the comparison result is when any field in the compressed identification code is compared with other fields, if any column in the compressed identification code When at least one of the bits and the other fields is equal to 0, the field of the corresponding compressed cross-validation code table unit is filled with 0. The digital data compression/decompression system of claim 1, wherein the compressed identification code generating unit further comprises a compressed identification code unit and a compressed cross-check code unit for respectively generating the compressed identification code. With this compression cross-validation code. The digital data compression/decompression system of claim 1, wherein the M, N, K, and L are integers. The digital data compression/decompression system of claim 5, wherein the M, N, K, and L are equal integers. The digital data compression/decompression system of claim 1, wherein the compressed identification code table unit is single or plural. A digital data compression/decompression method for compressing/decompressing data having one bit of M bits, the method comprising: receiving a digit address for generating 2 ^M pens without repeating and having M ² fields a compressed identification code of the data length; accumulating the same field in the compressed identification code to obtain an accumulated result and storing it in a compressed identification code table unit having N ² fields; comparing the compressed identification code generated by the digital address Any field and other fields to obtain a comparison result to form a compressed cross-validation code and stored in a compressed cross-validation code table unit having L ² fields, wherein any of the fields and other fields Comparing only one time to each other; verifying the value of the field within the unit of the compressed identification code, the compressed cross-validation code, the compressed identification code table unit, and the value of the field in the compressed cross-validation code table unit to determine Generating a comparison result, wherein the determining is based on whether the compressed identification code table unit and the value of the field in the compressed cross-validation code table unit are respectively greater than 0, equal to 0, or less than 0, and the pressure is Identifying the code table unit and the compression unit cross-validation code table whether the contents match each other, to obtain the corresponding comparison result; and means for separately performing a decompression process and a compression process based on the comparison result. The method of claim 8, wherein the decompression process further comprises: when the compressed identification code table unit is compared with a value of a field in the compressed cross-validation code table unit, greater than or equal to 0 and When the content of the compressed identification code table and the content of the compressed cross-validation code table unit are both matched, the digital data corresponding to the digital address is defined as 1, and when the compressed identification code table unit is intersected with the compression The value of the field in the verification code table unit is less than 0 after comparison and the compressed identification code table When at least one of the contents of the compressed cross-validation code table unit does not match, the digital data corresponding to the digital address is defined as 0. The method of claim 8, wherein the compression process further comprises: when the compressed identification code table unit is compared with a value of a field in the compressed cross-validation code table unit, greater than or equal to 0 and the compression Receiving, when the identification code table unit and the content of the compressed cross-validation code table unit match each other, receiving the digital address, wherein the digital address is stored in the compressed identification code table unit and the compressed cross-validation code The table unit and the content of the digit address are 1, and then according to the new content in the digit address is 1 or 0, to determine whether to update the compressed identification code table unit and the compressed cross-certification code table unit, when When the new content in the digital address is 1, it indicates that the digital address is stored in the compressed identification code table unit and the compressed cross-check code table unit, and when the new content in the digital address is 0. And subtracting the compressed identification code or the compressed cross-validation code from the value in the compressed identification code table unit and the compressed cross-check code table unit, so that the content in the digital address is updated from 1 to 0. The method of claim 8, wherein the compression process further comprises: when the compressed identification code table unit is compared with a value of a field in the compressed cross-validation code table unit, less than 0 and the compressed identification code. Receiving, when at least one of the table unit and the content of the compressed cross-validation code table unit does not match, receiving the digital address, wherein the digital address is not stored in the compressed identification code table unit and the compressed cross-validation code The table unit and the content of the digit address are 0, and according to the new address in the address The content is 1 or 0, and is used to determine whether to update the compressed identification code table unit and the compressed cross-check code table unit. When the new content in the digital address is 1, the compressed identification code table unit is And adding the value in the compressed cross-validation code table unit to the compressed identification code or the compressed cross-validation code, respectively, to update the content in the digital address from 0 to 1, and when the digital address is in the address When the new content is 0, it means that the digital address is not stored in the compressed identification code table unit and the compressed cross-check code table unit.