KR101603866B1 - Method of data compressing, method of data recovering, and the apparatuses thereof - Google Patents

Abstract

The present invention relates to a method for compressing data, which comprises: a dividing step of dividing, by a compressing unit, binary data into a plurality of general clusters in an upper bit direction from a lowermost bit, wherein each of the general clusters has a bit length of (N multiples+1) and is a binary number of a minimum length having an own uppermost bit of 1, and N is a natural number; a compressing step of generating, by the compressing unit, a plurality of compression clusters by reducing a first binary number from each of the general clusters, wherein the first binary number is a binary number consisting of only 1 and having a bit length which is smaller as much as 1 bit than each of the corresponding general clusters; and a step of outputting, by an output unit, the compression clusters to a target device.

Description

[0001] METHOD OF DATA COMPRESSING, METHOD OF DATA RECOVERING, AND THE APPARATUS [0002] BACKGROUND OF THE INVENTION [0003]

The present invention relates to a data compression and data restoration method and apparatus, and more particularly, to a data compression and data restoration method and apparatus capable of efficiently and efficiently compressing data into transformed compressed data of various formats through simple computation and hardware configuration, To a method and apparatus for data compression and data reconstruction.

In general, since the frequency bandwidth available in a normal transmission channel is limited, various transmission systems such as a modem have used an effective data compression technique to compress or reduce the amount of transmission data in order to transmit a large amount of data.

One of the various compression schemes is the CCITT V.42 bis employed in a data transmission system such as a modem with a coding algorithm standardized by the International Telecommunication Union (ITU). The basis applied to this coding standard is a Ziv-Lempel code (ZLC). In this method, an address value of a dictionary storing the same phrase as the previous input data is formed as a codeword while adaptively forming a dictionary from the input data. Lt; / RTI > The dictionary operation performs a continuous string matching with the input data to update the dictionary by adding the unmatched characters to the maximum matching string and adding them to the dictionary.

However, such a conventional compression method is complicated and requires a relatively high-performance hardware device for processing and compressing data, and it is difficult to increase the processing speed and to increase the reliability of the compression result value .

On the other hand, a bar code is an identification code used for various purposes as an optically readable code in which alphanumeric characters or special characters are represented by a combination of vertical bars having different thicknesses in order to be expressed in a machine-readable form. However, such conventional bar codes are limited in the amount of data that can be recorded through a bar code of a certain size by storing data for expressing or storing the data as it is, and when the size of data to be expressed is large, There is a problem in that the efficiency of utilizing the barcode is decreased.

The background art of the present invention is disclosed in Korean Patent Laid-Open Publication No. 2003-0022630 (published on Mar. 17, 2003).

SUMMARY OF THE INVENTION The present invention has been made in view of the above problems, and it is an object of the present invention to provide a data compressing method and a data compressing method capable of efficiently and efficiently compressing data into various types of compressed data through a simple operation and a hardware configuration, And to provide a method and apparatus for restoring data.

According to one aspect of the present invention, there is provided a segmentation step of dividing binary data from a least significant bit to a most significant bit into a plurality of general clusters, wherein each of the general clusters has (N + 1) The most significant bit of which is a binary number having a minimum length of 1 and the N is a natural number; Wherein the first binary number is a binary number having a bit length smaller than that of each general cluster by one bit length and consisting of only one binary number, Compression step; And an outputting step of outputting the plurality of compressed clusters.

In the present invention, each of the general clusters is a binary number having a minimum length of 1, which is not a binary number consisting of only 1, and its most significant bit is 1.

In the present invention, the binary number including the most significant bit of the binary data among the binary numbers divided by the dividing step is outputted as it is without performing the compression step.

And in the outputting step, the plurality of compression clusters are sequentially output from the least significant bit or the most significant bit based on the binary data.

According to another aspect of the present invention, there is provided a method of restoring binary data compressed by the data compression method, the method comprising: receiving the plurality of compression clusters; Generating a plurality of restoration clusters by adding a first binary number of 1s having the same bit length as that of each of the compression clusters to the compression cluster; And combining the plurality of restoration clusters.

According to still another aspect of the present invention, there is provided a method of compressing binary data by dividing binary data into a plurality of general clusters in the direction from the least significant bit to an upper bit, subtracting a first binary number from each general cluster, part; And an output unit outputting the plurality of compressed clusters, wherein each of the general clusters is a (N + 1) bit length and has a minimum length of its most significant bit of 1, N is a natural number, Wherein the first binary number is a binary number having a bit length smaller by one bit than each general cluster and consisting of only one bit.

In the present invention, each of the general clusters is a binary number having a minimum length of 1, which is not a binary number consisting of only 1, and its most significant bit is 1.

In the present invention, the compression unit outputs the binary data including the most significant bit of the binary data among the divided binary data through the output unit without subtracting the first binary number.

In the present invention, the output of the plurality of compression clusters is sequentially output from the least significant bit or the most significant bit based on the binary data.

According to another aspect of the present invention, there is provided an apparatus for recovering binary data compressed by the data compression apparatus, comprising: an input unit receiving the plurality of compression clusters; And a decompression unit that adds a first binary number of 1s having the same bit length as that of each of the compressed clusters to the compressed cluster to generate a plurality of restoration clusters and combines the plurality of restoration clusters. And provides a data restoration device.

According to still another aspect of the present invention, there is provided a division step of dividing binary data in a compression part into a plurality of general clusters in a direction from a least significant bit to a most significant bit, wherein each of the general clusters has (N + 1) The most significant bit of which has a minimum length of 1 and the N is a natural number; Wherein the first binary number has the same bit length as each corresponding general cluster and the most significant bit is 1 and the remaining bits are 0, A compression step, which is a binary number; And an outputting step of outputting the plurality of compressed clusters.

In the present invention, the binary number including the most significant bit of the binary data among the binary numbers divided by the dividing step is outputted as it is without performing the compression step.

And in the outputting step, the plurality of compression clusters are sequentially output from the least significant bit or the most significant bit based on the binary data.

According to another aspect of the present invention, there is provided a method of restoring binary data compressed by the data compression method, the method comprising: receiving the plurality of compression clusters; Generating a plurality of restoration clusters by adding a second binary number that is longer by one bit length than each of the compressed clusters and has a most significant bit of 1 and a remaining bit of 0 to the corresponding compressed cluster; And combining the plurality of restoration clusters.

According to still another aspect of the present invention, there is provided a method of compressing binary data by dividing binary data into a plurality of general clusters in the direction from the least significant bit to an upper bit, subtracting a first binary number from each general cluster, part; And an output unit outputting the plurality of compressed clusters, wherein each of the general clusters is a (N + 1) bit length and has a minimum length of its most significant bit of 1, N is a natural number, Wherein the first binary number is a binary number whose bit length is the same as that of each general cluster and whose most significant bit is 1 and the other bits are 0.

In the present invention, the compression unit outputs the binary data including the most significant bit of the binary data among the divided binary data through the output unit without subtracting the first binary number.

In the present invention, the output of the plurality of compression clusters is sequentially output from the least significant bit or the most significant bit based on the binary data.

According to another aspect of the present invention, there is provided an apparatus for recovering binary data compressed by the data compression apparatus, comprising: an input unit receiving the plurality of compression clusters; And a second binary number that is longer by one bit than the respective compressed clusters and has a most significant bit of 1 and a remaining bit of 0 to the corresponding compressed cluster to generate a plurality of restored clusters, And a data restoring unit for restoring the data.

The data compression and data decompression method and apparatus according to the present invention can effectively and efficiently compress data into transformed compressed data in various formats through simple computation and hardware configuration and restore data from the transformed compressed data, Format conversion The amount of information to be transferred through compressed data can be increased and the performance and utilization of data compression and decompression can be increased. Particularly, it is possible to transmit binary data by dividing compressed data in units of N times, thereby enabling efficient transmission in a system for transmitting data in a specific multiple unit such as packet transmission.

1 is a block diagram of a data compression apparatus and a decompression apparatus according to an embodiment of the present invention.
2 is a flowchart illustrating a data compression method according to an embodiment of the present invention.
3 is a flowchart illustrating a data restoration method according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art can easily carry out the present invention. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

Throughout the specification, when an element is referred to as "comprising ", it means that it can include other elements as well, without excluding other elements unless specifically stated otherwise.

2 is a flowchart illustrating a data compression method according to an embodiment of the present invention. FIG. 3 is a flowchart illustrating a data compression method according to an embodiment of the present invention. FIG. 4 is a flowchart illustrating a data restoration method according to an embodiment of the present invention. Referring to FIG.

As shown in FIG. 1, the data compression apparatus 100 according to the present embodiment includes a compression unit 110 and an output unit 120.

The compression unit 110 divides the binary data into a plurality of general clusters in the direction from the least significant bit to the most significant bit and subtracts the first binary number from each general cluster to generate a plurality of compressed clusters. The output unit 120 outputs the generated plurality of compressed clusters to a destination apparatus such as the restoration apparatus 200 or the like.

In this case, when dividing the binary data while shifting from the least significant bit to the most significant bit, each of the general clusters has a (N + 1) bit length and is a binary number having a minimum length of 1 , And N is a natural number.

Wherein the first binary number is a binary number i) the bit length is a binary number that is smaller by one bit than the corresponding general cluster and is only one, and ii) the first embodiment has a bit length equal to each corresponding general cluster, Which is a binary number of 0, can be categorized into the second embodiment.

First, considering the first embodiment (first binary number: a binary number whose bit length is smaller by one bit than the corresponding general cluster and is only one), for example, when N = 3, the original binary data is "1010 ... 1101001 "(3 * 1 + 1 bit length) of" 1001 "(3 * 1 + 1 bit length) and 4 bits length (N * 1 + 1) in the direction from the least significant bit to the upper bit. The general clusters are separated in order. Here, the 7-digit portion "1011001" of the least significant bit portion also satisfies the condition of "(N multiples + 1) bit length" since its bit length is (3 * 2 + 1) Since "1001" already satisfies the general cluster condition, it satisfies the condition of "binary length of minimum length" among the conditions of "(N multiple number + 1) bit length and binary number of minimum length having its most significant bit of 1" "1011001" is not obtained as a general cluster.

In the case of the first embodiment, each of the general clusters is not a binary number consisting of only one. That is, even if the bit length is (N times + 1) bits and the MSB is the minimum length of 1, the number of 1's such as "1111" is excluded from the general cluster. This is to make a practical compression. For example, in a general cluster such as 11111 ... 1, if the first binary number shorter by one bit length is subtracted from 1111 ... 1, then 10000 ... 0 is obtained, It does not occur. We will look into this in more detail later.

Next, regarding the second embodiment (the first binary number: a binary number whose bit length is the same as that of each general cluster and the most significant bit is 1 and the other bits are 0), in the case of the second embodiment, The separation into a general cluster is the same. However, in the case of the second embodiment, each of the general clusters may be a binary number consisting of only one. For example, when N = 3, the first binary number becomes "1000" when the general cluster is "1101" having 4 bits (3 * 1 + 1) Quot; 101 "is obtained (1-bit reduction).

The compression unit 110 may output the binary data including the most significant bit of the binary data among the divided binary data through the output unit 120 without subtracting the first binary number.

The data compression apparatus 100 may sequentially output, from the least significant bit or the most significant bit, the binary data based on the output of the plurality of compression clusters. Of course, as described above, since the last most significant bit portion remaining as a result of the division operation performed by the compression unit 110 does not perform compression (subtraction) separately, the binary portion is sequentially transmitted together with the compression cluster. Thus, in the restoration apparatus 200, the clusters (binary numbers) transmitted first or last among the plurality of clusters (binary numbers) sequentially input in accordance with the cluster transmission rule are stored in the most significant bit portion of the uncompressed original binary data And the remaining binary numbers are known as compression clusters.

1, the data restoration apparatus 200 according to the present embodiment includes an input unit 210 and a restoration unit 220.

The input unit 210 receives a plurality of compressed clusters transmitted from the output unit 120 and the like.

The restoring unit 220 may be configured so that a second binary number (in the first embodiment) having a bit length equal to that of the corresponding compression cluster and a binary number consisting of only one bit, or a bit length larger by one than each corresponding compression cluster, (In the second embodiment) to the corresponding compressed cluster to generate a plurality of restoration clusters, and restores the original binary data by combining the plurality of restoration clusters.

The operation and operation of the present embodiment thus configured will be described in detail with reference to Figs. 1 to 3. Fig.

FIG. 2 is a flowchart for explaining a data compression method according to an embodiment of the present invention, and a data compression method according to this embodiment will be described with reference to FIG.

First, the compression unit 110 divides the original binary data into a plurality of general clusters in the direction from the least significant bit to the most significant bit (S201).

A general cluster means a binary number having a length of (N times + 1) bits and having a length of its own most significant bit of 1. In this case, N can be set to various numbers such as 3, 6, 9, 12, 24, 300, and 18 without any even and odd numbers, and can be variously set according to the system designer and compression conditions. For example, if N = 3, the compression unit 110 divides the original binary data into a general cluster having a length of (3k + 1) bits such as a length of 4 bits, a length of 7 bits, a length of 10 bits, do.

In addition, the general cluster is a binary number having a length of (N times + 1) bits as described above, and at the same time, the most significant bit value of its own must be "1", and when dividing from the least significant bit to the upper bit direction, It is a binary number with length. This is for subtracting the first binary number in the compression step described later so that a substantial compression effect occurs. For example, when N = 3, data such as "0111 " has a length of (3k + 1) bits, but can not be called a general cluster because its most significant bit is zero. Further, in the case of a binary number "100 1101 ", the bit length is 7 (3k + 1) bits long and the most significant bit value is also 1, but before starting to divide by this bit, starting from the least significant bit of the binary number to "1101"Quot; 100 1101 "can not be regarded as a binary cluster having a minimum length satisfying the above condition, and thus can not be regarded as a general cluster.

If N = 3 is set and the binary number "11 1010100011 1010 1001" is taken as an example, the division step S201 will be described in more detail. Since the number is 1, a general cluster of "1001" is obtained. Then, starting from the next bit again, a general cluster of "1010" is obtained because the number of the 4th bit position (3k + 1, k = 1) is 1.

Then, starting from the next bit again, the number of the 4th bit position (3k + 1, k = 1) is 0, so that "0011" = 1), the number of the 10th bit position (3k + 1, k = 3) is "1" Quot; 1010100011 "is obtained. The remaining remaining bits "11" are not a general cluster but are obtained as a result of division.

On the other hand, the general cluster may or may not be a binary number consisting of only one, depending on which type of number is used as the first binary number to be used in the following compression step. That is, the first binary number i) is a binary number having a bit length smaller than that of each general cluster by one bit length and consisting of only 1, ii) the first embodiment has a bit length equal to each corresponding general cluster, And the bit is a binary number of zero. Of course, whether the first binary number corresponds to the first embodiment or the second embodiment is previously set in the compression apparatus and the decompression apparatus, and compression and decompression processes are performed accordingly.

First, if we look at the first embodiment (first binary number: a binary number whose bit length is smaller by one bit than each corresponding general cluster and is only one), "1111", "1111111", ... And so on can not be said to be a general cluster. The reason for this definition is to subtract the first binary number in the compression step described later so as to generate a substantial compression effect. For example, when the general cluster is "1111111 ", the first binary number described later becomes" 111111 ", so that the subtraction result "1000000 "

On the other hand, in the second embodiment (first binary number: a binary number whose bit length is the same as that of each general cluster and whose most significant bit is 1 and the other bits are 0), in the case of the second embodiment, Clustering into clusters is the same. However, in the case of the second embodiment, each of the general clusters may be a binary number consisting of only one. For example, when the general cluster is "1101" having 4 bits (3 * 1 + 1) at N = 3, the first binary number becomes "1000" as described later, and the first binary number When compression is performed by subtraction, compressed data of "101" is obtained (1 bit reduction). Of course, even when the general cluster is "1111 " in which the general cluster is 4 bits (3 * 1 + 1) when N = 3, the first binary number becomes" 1000 ", and compression for subtracting the first binary number Quot; 111 "is obtained (1-bit reduction).

Next, the compression unit 110 generates a plurality of compressed clusters by subtracting the first binary number from each of the general clusters (S202). Here, the first binary number may be a binary number of a first embodiment (a first binary number: a binary number whose bit length is one bit shorter than the corresponding general cluster and is only one), or the second embodiment (first binary number: A binary number having the most significant bit equal to 1 and the remaining bit equal to 0).

For example, if a general cluster has a 7-bit length (3k + 1, k (k), 1k (k) = 2), the first binary number becomes "111111 ", which is a binary number consisting of only one of six bits (3k, k = 2). As described above, when the first binary number (a binary number shorter by one bit than the corresponding general cluster and a binary number consisting of only one) is subtracted from the general cluster, the resultant value is reduced by a length of one bit to obtain a compressed cluster.

Taking the above-mentioned binary data "11 1010100011 1010 1001" as an example, "1001", "1010", and "1010100011" are obtained from the least significant bit to the general cluster and the corresponding first binary numbers are "111" Quot; 111 "and" 111111111 ". Then, by subtracting the first binary number from each general cluster, compression clusters "010 "," 011 ", and "010100100" On the other hand, the compression unit 110 does not perform compression on the last most significant bit part "11" remaining as a result of the division step S201.

For example, if a general cluster has a 7-bit length (3k + 1) and a 2-bit length (3k + 1, k = 2), the first binary number is "1000000" which is a binary number of 7 bits in length (3k + 1, k = 2), with the most significant bit being 1 and the remaining bits being 0. As described above, when the first binary number is subtracted from the general cluster, the resultant value is reduced by a length of one bit to obtain a compressed cluster.

Taking the above-described binary data "11 1010100011 1010 1001" as an example, "1001", "1010", and "1010100011" are obtained from the least significant bit to the general cluster and the corresponding first binary numbers are "1000" Quot; 1000 "and" 1000000000 ". When the first binary number is subtracted from each general cluster, compression clusters of "001 "," 010 ", and "010100011" On the other hand, the compression unit 110 does not perform compression on the last most significant bit part "11" remaining as a result of the division step S201.

Next, the output unit 120 outputs the plurality of compressed clusters to a destination apparatus such as the data restoration apparatus 200 (S203). In this case, the output unit 120 sequentially outputs the generated plurality of compression clusters from the least significant bit or the most significant bit according to a preset output rule (transmission rule) when the original binary data is regarded as a reference. That is, in the case of the first embodiment described above, the output unit 120 may be set to sequentially output from the least significant bit in the order of "010", "011", "010100100" . By sequentially outputting a plurality of pieces of compressed data, the restoring device 200 sequentially restores a plurality of input compression clusters in a predetermined order so that the original binary data can be normally obtained.

Of course, as described above, since the last most significant bit portion remaining as a result of the division step S201 is not separately compressed, the binary portion is sequentially output together with the compression cluster. That is, in the above example, the most significant bit part "11" remaining as a result of the division step (S201) is output without any additional compression. By this output, it can be seen that the cluster (binary number) input first or last in the cluster according to the cluster input rule out of the plurality of clusters (binary numbers) sequentially input in the restoration device is the most significant bit part of the uncompressed original binary data And the remaining binary numbers are known as compression clusters.

3, the data decompression apparatus 200 receives the compressed cluster through the input unit 210 and transmits the compressed cluster to the decompression unit 220 (S301 ).

The restoring unit 220 may be configured so that the second binary number (in the first embodiment), which is a binary number whose bit length is the same as that of each compression cluster and is only one, or the bit length is one greater than each compression cluster, (In the case of the second embodiment) to the corresponding compressed clusters to generate a plurality of restoration clusters (S302). When the compressed clusters are input in the order of "010", "011", and "010100100" in the above-described first embodiment, the restoring unit 220 outputs "111" Quot ;, " 111111111 ", respectively, to create a restoration cluster of "1001 "," 1010 ", and "1010100011 ". For example, if the compressed cluster is input in the order of "001", "010", and "010100011" in the second embodiment, the restoring unit 220 obtains "1000" Quot ;, " 1000 ", and "1000000000 ", respectively, to create a restoration cluster of" 1001 ", "1010 ", and" 1010100011 ".

Of course, since the remaining uppermost bit portion "11" remaining uncompressed in the data compression apparatus 100 will be inputted at the end or the beginning according to the promised rule, the restoring unit 220 restores this data to another restoration Accept it without work.

Finally, the restoring unit 220 finally restores the original binary data by combining the plurality of restoration clusters and the uncompressed clusters (S303).

As described above, the data compression and data restoration method and apparatus according to the present embodiment effectively and efficiently compresses data into transformed compressed data of various formats through a simple operation and a hardware configuration, It is possible to increase the amount of information to be transferred through the converted compressed data in various formats and to increase the utilization of data compression and restoration.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, It belongs to the scope of right.

100: Data compression device
110: compression section 120: output section
200: data restoration device
210: input unit 220:

Claims (18)

Wherein the compression unit divides the binary data into a plurality of general clusters in the direction from the least significant bit to the most significant bit, wherein each of the general clusters has a (N + 1) bit length and a binary length And N is a natural number;
Wherein the first binary number is a binary number having a bit length smaller than that of each general cluster by one bit length and consisting of only one binary number, Compression step; And
And outputting the plurality of compressed clusters by the output unit.
The method according to claim 1,
Wherein each of the general clusters is a binary number having a minimum length of 1 and not having a binary number of only one.
The method according to claim 1,
Wherein a binary number including the most significant bit of the binary data among the binary numbers divided by the dividing step is output as it is without performing the compression step.
The method according to claim 1,
Wherein in the outputting step, the plurality of compression clusters are output sequentially from the least significant bit or the most significant bit based on the binary data.
A method for restoring binary data compressed by a data compression method according to any one of claims 1 to 4,
Receiving the plurality of compressed clusters;
Generating a plurality of restoration clusters by adding a first binary number of 1s having the same bit length as that of each of the compression clusters to the compression cluster; And
And combining the plurality of restoration clusters.
A compression unit for dividing binary data into a plurality of general clusters in a direction from a least significant bit to an upper bit and subtracting a first binary number from each of the general clusters to generate a plurality of compressed clusters; And
And an output unit outputting the plurality of compressed clusters,
Each of the general clusters is a binary number having a length of (N times + 1) bits and having a most significant bit of its own at 1, the N being a natural number,
Wherein the first binary number is a binary number having a bit length smaller by one bit length than the corresponding general cluster and consisting of only one bit.
The method according to claim 6,
Wherein each of the general clusters is a binary number having a minimum length of 1, the most significant bit of which is not a binary number consisting of only one.
The method according to claim 6,
Wherein the compression unit outputs the binary data including the most significant bit of the binary data among the divided binary data through the output unit without subtracting the first binary number.
The method according to claim 6,
And outputs the binary data from the least significant bit or the most significant bit sequentially on the basis of the binary data when outputting the plurality of compressed clusters.
An apparatus for restoring binary data compressed by the data compression apparatus according to any one of claims 6 to 9,
An input unit receiving the plurality of compressed clusters; And
And a decompression unit for adding a first binary number of 1s having the same bit length as that of each of the compression clusters to the compression cluster to generate a plurality of restoration clusters and combining the plurality of restoration clusters Restoration device.
Wherein the compression unit divides the binary data into a plurality of general clusters in the direction from the least significant bit to the most significant bit, wherein each of the general clusters has a (N + 1) bit length and a binary length And N is a natural number;
Wherein the first binary number has the same bit length as each corresponding general cluster and the most significant bit is 1 and the remaining bits are 0, A compression step, which is a binary number; And
And outputting the plurality of compressed clusters by the output unit.
12. The method of claim 11,
Wherein a binary number including the most significant bit of the binary data among the binary numbers divided by the dividing step is output as it is without performing the compression step.
12. The method of claim 11,
Wherein in the outputting step, the plurality of compression clusters are output sequentially from the least significant bit or the most significant bit based on the binary data.
A method for restoring binary data compressed by the data compression method according to any one of claims 11 to 13,
Receiving the plurality of compressed clusters;
Generating a plurality of restoration clusters by adding a second binary number that is longer by one bit length than each of the compressed clusters and has a most significant bit of 1 and a remaining bit of 0 to the corresponding compressed cluster; And
And combining the plurality of restoration clusters.
A compression unit for dividing binary data into a plurality of general clusters in a direction from a least significant bit to an upper bit and subtracting a first binary number from each of the general clusters to generate a plurality of compressed clusters; And
And an output unit outputting the plurality of compressed clusters,
Each of the general clusters is a binary number having a length of (N times + 1) bits and having a most significant bit of its own at 1, the N being a natural number,
Wherein the first binary number is a binary number whose bit length is the same as that of the corresponding general cluster and whose most significant bit is 1 and the other bits are 0.
16. The method of claim 15,
Wherein the compression unit outputs the binary data including the most significant bit of the binary data among the divided binary data through the output unit without subtracting the first binary number.
16. The method of claim 15,
And outputs the binary data from the least significant bit or the most significant bit sequentially on the basis of the binary data when outputting the plurality of compressed clusters.
An apparatus for restoring binary data compressed by the data compression apparatus according to any one of claims 15 to 17,
An input unit receiving the plurality of compressed clusters; And
A restoration unit that adds a second binary number that is longer by one bit length than each of the compression clusters and has a most significant bit of 1 and the remaining bits of 0 to the compressed cluster to generate a plurality of restoration clusters, The data restoration apparatus comprising:

Images