KR101549740B1 - Binary data compression and decompression method and apparatus - Google Patents

Abstract

The present invention is characterized in that the compression operation unit divides binary data into a predetermined number of reference bits from a least significant bit to generate at least one binary cluster; Wherein the compression operation unit performs, for each of the binary clusters, a first carry point to start a carry down event with the first carry point as a start point, Subtracting a binary number consisting only of a minimum number of 1s in each binary cluster; And repeating the step of subtracting for each of the binary clusters until the carry-down event is no longer generated while the compression operation moves the position of the first carry point by one digit to the upper digit, Wherein the carry-down event refers to borrowing a number from the top when subtracting each of the binary clusters, wherein the first carry point is a one-digit starting from the least significant digit of each binary cluster, To a higher position in the compression device.

Description

BINARY DATA COMPRESSION AND DECOMPRESSION METHOD AND APPARATUS [0002]

The present invention relates to a method and apparatus for compressing and decompressing binary data, and more particularly, to a method and apparatus for compressing and decompressing binary data, which can compress and decompress binary data effectively and efficiently through simple computation and hardware configuration. ≪ / RTI >

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 .

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

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 method and apparatus for quickly and efficiently compressing and decompressing binary data through a simple operation and a hardware configuration, And to provide a method and apparatus for compressing and decompressing data.

According to one aspect of the present invention, there is provided a method of compressing binary data of a compression apparatus, the method comprising: generating at least one binary cluster by dividing binary data from a least significant bit into a predetermined number of reference bits; Wherein the compression operation unit performs, for each of the binary clusters, a first carry point to start a carry down event with the first carry point as a start point, Subtracting a binary number consisting only of a minimum number of 1s in each binary cluster; And repeating the step of subtracting for each of the binary clusters until the carry-down event is no longer generated while the compression operation moves the position of the first carry point by one digit to the upper digit, Wherein the carry-down event refers to borrowing a number from the top when subtracting each of the binary clusters, wherein the first carry point is a one-digit starting from the least significant digit of each binary cluster, To a higher position on the basis of the result of the comparison.

In the present invention, the transmitting unit may further include transmitting the at least one compressed cluster generated by the compression computing unit to the destination apparatus.

delete

In the present invention, a binary cluster in which the number of bits of the at least one binary cluster generated by dividing the binary data from the least significant bit is smaller than the reference number of bits does not generate a corresponding compression cluster, Or a corresponding compressed cluster, and then transmits the compressed cluster together with a signal bit having information on the binary cluster.

In the present invention, a binary cluster including 0 in the most significant bit of the at least one binary cluster removes at least one contiguous sequence of 0's from the most significant bit, and then performs the compression method.

delete

delete

delete

According to another aspect of the present invention, there is provided a method for generating binary data by dividing binary data into a predetermined number of reference bits from a least significant bit to generate at least one binary cluster, and for each binary cluster, Performing a subtraction operation for subtracting a binary number consisting of a minimum number of 1s from the position of the first carry point to each of the binary clusters so as to cause a carry-down event to occur first, starting from the first carry point And a compression operation unit for generating at least one compressed cluster by repeating the subtraction operation for each binary cluster until a carry-down event is no longer generated while moving the position of the carry- The down event may be an event Wherein the first carry point refers to borrowing a number from the top position when subtracting the luster, and the first carry point moves from the least significant digit of each binary cluster to the most significant digit by one digit. do.

The present invention is further characterized by a transmitter for transmitting the at least one compressed cluster generated by the compression computation unit to a target apparatus.

delete

In the present invention, a binary cluster in which the number of bits of the at least one binary cluster generated by dividing the binary data from the least significant bit is smaller than the reference number of bits does not generate a corresponding compression cluster, Or a corresponding compressed cluster, and then transmits the compressed cluster together with a signal bit having information on the binary cluster.

In the present invention, in the case of a binary cluster in which 0 is included in the most significant bit among the at least one binary cluster, the compression calculation unit removes at least one 0 continuously arranged from the most significant bit, do.

In the present invention, the compression operation unit may include a data division unit for dividing the binary data to generate the at least one binary cluster; And a compression cluster generating unit for generating the at least one compressed cluster by repeating the subtraction operation for each binary cluster until a carry down event no longer occurs for each binary cluster.

delete

delete

delete

delete

The method and apparatus for compressing and decompressing binary data according to the present invention can quickly and efficiently decompress and decompress binary data through a simple operation and a hardware configuration, Can be increased.

1 is a block diagram of a binary data compression apparatus and a decompression apparatus according to an embodiment of the present invention.
2 is a flowchart illustrating a method of compressing binary data according to an embodiment of the present invention.
3 is a flowchart illustrating a method of decompressing binary data 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.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of a binary data compression apparatus and a decompression apparatus according to an embodiment of the present invention. Referring to FIG.

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

The compression operation unit 110 generates binary data by dividing the binary data into a predetermined number of reference bits from the least significant bit to generate at least one binary cluster, and for each binary cluster, each binary cluster starts with a first carry point as a start point And a second carry-point generating unit that performs a subtraction operation for subtracting a binary number consisting of a minimum number of 1's from the position of the first carry point to each binary cluster, And the at least one compression cluster is generated by repeating the subtraction operation for each binary cluster until the carry-down event no longer occurs. Here, the carry-down event refers to borrowing a number from the top in subtraction of each binary cluster, and the first carry point starts from the lowest position of each binary cluster and moves to the upper place by one place .

The transmitting unit 120 transmits the at least one compressed cluster generated by the compression computing unit 110 to a destination apparatus such as the decompression apparatus 200 or the like.

The compression computation unit 110 includes a data division unit 111 for dividing binary data to generate the at least one binary cluster; And a compression cluster generation unit (112) for generating the at least one compressed cluster by repeating the subtraction operation for each binary cluster until a carry down event no longer occurs for each binary cluster.

1, the binary data decompression apparatus 200 according to the present embodiment includes a reception unit 210 and a decompression calculation unit 220. [

The receiving unit 210 receives at least one compressed cluster transmitted through the transmitting unit 120 of the compression apparatus 100 and transmits the received at least one compressed cluster to the decompression computing unit 220.

The decompression arithmetic operation unit 220 determines, for each of the compressed clusters, the position of the second carry point, which causes each of the compressed clusters to cause a carry-up event for the first time starting from the second carry point as a start point And performing a summation operation for adding a binary number consisting of a minimum number of 1s to each of the compression clusters in the direction of the upper bit by shifting the position of the second carry point by one digit to a lower position, Repeating the addition operation on the compressed cluster to generate at least one decompression binary cluster, and combining the at least one decompression binary cluster to generate binary data. Here, the carry-up event means increasing the number to the top of the accumulation for each compressed cluster, and the second carry point is determined by at least 0 or more zeros arranged from the most significant digit of each compressed cluster And moves to the lower digit by one digit starting from the digit.

The decompression computation unit 220 repeats the addition operation for each compression cluster until the least significant bit is reached by moving the position of the second carry point by one digit to the lower digit for each compression cluster, An uncompressed binary cluster generating unit 221 for generating an uncompressed binary cluster; And a cluster combining unit 220 for combining the at least one decompression binary cluster to generate binary data.

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 method of compressing binary data according to an embodiment of the present invention. Referring to FIG. 2, a method of compressing binary data according to this embodiment will be described.

First, the data divider 111 of the compression computation unit 110 divides binary data into a predetermined number of reference bits from the least significant bit to generate at least one binary cluster (S201). Taking the binary data "10001010101010101111011" as an example, the compression apparatus 100 divides the binary data from the least significant bit, for example, in units of 5 bits as follows.

100/01010/10101/01011/11011

That is, as a result of the division, the binary data is divided into four binary clusters (5-bit number) and one binary cluster (3-bit number). Of course, the reference bit number can be applied not only to the number of 5 bits but also to various bits.

Next, for each binary cluster, the compression cluster generating unit 112 of the compression calculating unit 110 generates a binary number for causing each of the binary clusters to carry out a carry down event for the first time starting from the first carry point (S202).

Herein, the "carry down event" refers to a case where, when a second binary number is subtracted from a first binary number composed of a plurality of digits (bit number), a digits from the first digit are subtracted It means that a falling phenomenon occurs. For example, subtracting binary 1 from binary 101 results in 100, in which case 100 after subtraction does not fall off compared to 101 before subtraction. That is, a carry down event, which is a phenomenon of borrowing numbers from the top for subtraction, does not occur. On the other hand, if the binary number 101 is subtracted from the binary number 11, the result is 10. In this case, 10 after the subtraction is compared with 101 before the subtraction. That is, for the subtraction in the second digit, a "carry down event" occurs in which the digit 1 is borrowed from the third digit of the first digit to perform subtraction in the second digit, . This carry-down event is used not only when the number of bits of the original number itself becomes smaller, but also when the carry-down event includes the first falling-down phenomenon occurring inside. That is, if the binary number 110 is subtracted from the binary number 101, then the carry-down event is considered to have occurred by using the carry-key of 110 to 1 in the case where the second place is down.

In order to cause a carry-down event to occur with respect to the original binary number, the binary number to be subtracted is a binary number (for example, 1, 11, or 12) having a minimum number of 1s in the upper bit direction, 111, 1111, ...), hereinafter referred to as "carry key ". For example, in case of binary number 100, if 1 is subtracted, a carry down event occurs at 11, and the carry key becomes 1 at this time. However, in the case of 101, even if 1 is subtracted, the carry-down event does not occur but subtracting 11 is 10, so that the carry-down event occurs.

Here, the "first carry point" means a place where the lowest bit of the carry key for causing the carry-down event is located. As will be described later, the first carry point is the lowest position (Least significant bit), and then subtracting is repeatedly performed, and moves to the upper bit direction by one digit.

Number of digits 4 3 2 One 0 Original data One One 0 One One (-) Carrie One One One First-order sensitivity data One 0 One 0 0 (-) Carrie One Second-order sensitivity data One 0 0 One 0 (-) Carrie One

Table 1 shows an example of a process of performing compression on a binary cluster "11011 " by a subtraction operation. In the case of the binary cluster "11011 ", the first carry point becomes the" 0 "-bit position first, and the carry key causing the carry-down event for the first time through subtraction becomes" 111 ".

Next, the compression cluster generation unit 112 determines whether an additional carry down event can occur (S203). That is, the compression cluster generation unit 112 determines whether an additional carry down event can occur with respect to the carry key reduction result in step S202. Referring to the example of Table 1, in the case of Table 1, data of "10100" is generated as the first subtraction result of the carry key, and this data can be considered as a case where an additional carry down event can be generated by subtracting from the carry key .

As a result of the determination in step S203, if it is determined that an additional carry down event can occur, the compression cluster generation unit 112 shifts the first carry point by one digit in the upper bit direction (S204) S202) are repeated. That is, in the case of the second subtraction operation in step S202, the carry key is generated by shifting the first carry point by one digit in the higher bit direction than the previous step, and the subtraction operation is performed. Referring to the example of Table 1, after subtracting the first carry key, the first carry point is shifted by one digit in the upper bit direction to become the "1" -th bit position, "1" is selected as a carry key for causing the down event to occur, and a subtraction operation is performed to generate "10010 ".

Steps S202 to S204 are repeated until no carry-down event is generated. In the example of Table 1, after the second subtraction of the carry key, the first carry point is shifted by one digit in the direction of the higher bit to become the "2" -bit position, Quot; 1 "is selected as the carry key for causing the carry-down event to occur, and the subtraction operation is performed to generate" 1110 ".

On the other hand, if it is determined in step S203 that the carry-down event no longer occurs, the compression-cluster generating unit 112 transmits the resultant compressed cluster to the decompressor 200 through the transmitting unit 120 To the destination apparatus (S205). That is, the compression cluster generation unit 112 generates at least one compression cluster for each binary data, and transmits the generated compression cluster to the destination device through the transmission unit 120.

On the other hand, in the case of a binary cluster including 0 in the most significant bit, as in the binary cluster "01011 ", one or more consecutively arranged 0s are removed from the most significant bit, and then the above described compression method is performed. That is, in the "01011", 0 is firstly removed to make "1011", and compression is performed through the following process.

delete

    1011

(-) 111

-----------

     100

(-) One

------------

      10

By transmitting in this way, it is possible to increase the compression efficiency by reducing the amount of data to be transmitted, as compared with the case of including all zeros arranged beforehand. Of course, since the compressed binary representation will already have the number of bits in the original binary cluster, decompression should be done by adding a leading zeros to it.

On the other hand, in the case of the last binary cluster in which the number of bits is smaller than the reference number of bits (for example, 5 bits) among the at least one binary cluster generated by dividing the binary data from the least significant bit, It can be transmitted by other methods. That is, a signal bit (for example, 0, 00, 1,...) Is transmitted before the compression cluster of the last binary cluster is transmitted so that the original binary cluster of the compression cluster is smaller than the reference number of bits To indicate that it is the last binary cluster. For example, in the case of transmitting "0" as the signal bit, the original binary cluster of the corresponding compression cluster is data having a leading 0, and when transmitting "00" as the signal bit, the original binary cluster of the corresponding compression cluster is , And when 1 is transmitted as a signal bit, it indicates that the corresponding compression cluster itself is compressed data of the original binary cluster. In addition, according to the embodiment, since the number of the last binary clusters smaller than the reference bit number and the data amount itself are very small, they may be transmitted to the destination apparatus without compression.

FIG. 3 is a flowchart for explaining a method of decompressing binary data according to an embodiment of the present invention. Referring to FIG. 3, a decompression method of binary data according to this embodiment will be described.

First, the receiving unit 210 of the decompression apparatus 200 receives a compressed cluster from a destination apparatus such as the compression apparatus 100 (S301). That is, the decompression apparatus 200 receives at least one compressed cluster for each binary data from the transmission unit 120 of the compression apparatus 100.

Next, the decompression binary cluster generation unit 221 of the decompression calculation unit 220 adds binary numbers for causing each of the compression clusters to cause a carry-up event first as a starting point from the second carry point (S302 ). The "carry-up event" as used herein refers to a case where, when a second binary number is added from a first binary number consisting of a plurality of digits (bits), the number of the addition result at a certain position of the first binary number overflows, Which means that a carry-over phenomenon occurs. For example, if the binary number is 100 and the binary number is 1, the result is 101. In this case, 101 after addition is not compared with 100 before addition. That is, the carry-up event, which is the phenomenon of increasing the number to the top position for addition, does not occur. On the other hand, if the binary number 10 is added to the binary number 11, the result is 101. In this case, 101 after addition is compared with 10 before addition, so that a carry-up event occurs. As a result, the result of the rounding from 10 to 101 is obtained. This carry-up event is used not only in the case where the number of bits of the original number itself increases, but also in the concept including the first carry-over phenomenon occurring inside. That is, as in the case where 110 is added to the binary number 101 by 1, a carry-up event in which the carry-up is carried out using a carry key of 1 in 101 is considered to have occurred in the first place.

In order to cause the carry-up event to occur with respect to the original binary number, the binary number to be added is a binary number (for example, 1, 11, 111, 1111, ...), which can also be referred to as "carrie ". For example, in case of binary number 11, if 1 is added, a carry-up event occurs at 100, so that the carry key is 1 at this time. However, in the case of 110, even if 1 is added, if the carry-up event is not generated but 11 is added, the carry-up event occurs because the carry-up event occurs.

Here, the "second carry point" means the place where the least significant bit of the carry key for generating the carry-up event is located, and the first carry key for carrying out the carry- As the addition operation is repeatedly performed starting from the position, it moves in the lower bit direction by one digit.

Number of digits 4 3 2 One 0 Compression cluster One One One 0 (+) Carrie One Secondary transformation data One 0 0 One 0 (+) Carrie One Tertiary transformation data One 0 One 0 0 (+) Carrie One One One Decompressed data One One 0 One One

In the example of Table 2, the second carry point is determined as the "2" -th bit position. That is, the second carry point is a "2" -bit bit, and the carry key for causing the carry-up event for the first time through addition is "1"

delete

Next, the decompression binary cluster generation unit 221 determines whether an additional carry-up event can occur (S303). That is, the decompression binary cluster generation unit 221 determines whether an additional carry-up event can occur with respect to the carry-key addition result in step S302. Referring to the example of Table 2, in the table 2, the data "10010" is generated as a result of the primary addition of the carry key, and this data can be referred to as a case where an additional carry-up event can be generated by adding to the carry key .

If it is determined in step S303 that an additional carry-up event can be generated, the decompression binary cluster generation unit 221 moves the second carry point by one digit in the lower bit direction (S304) The process of step S302 is repeated. That is, in the case of the second addition operation in step S302, the carry key is generated by shifting the second carry point by one digit in the lower bit direction than the previous step, and then the addition operation is performed. Referring to the example of Table 2, the second carry point after the addition of the first carry key is shifted by one digit in the lower bit direction to become the "1" -th bit position, Quot; 1 "is selected as a carry key for causing the up event to occur, and an addition operation is performed to generate" 10100 ".

Steps S302 to S304 are repeated until a carry-up event is no longer generated. In the example of Table 2, the second carry point after the second addition of the carry key is shifted by one position in the lower bit direction to become the "0" -th bit position, "111" is selected as the carry key for causing the carry-up event to occur and the addition operation is performed to generate "11011 ".

If it is determined in step S303 that the carry-up event no longer occurs, the decompression binary cluster generation unit 221 transfers the resultant decompression binary cluster to the cluster combining unit 222, (222) combines at least one decompression binary cluster to generate binary data (S305).

On the other hand, in the case of a compression cluster having a most significant bit of 1, such as a compression cluster "10 ", decompression is performed through the following process after determining a place having the 1 as a second carry point.

      10

(+) 1

-----------

     100

(+) 111

------------

    1011

When data of 1011 is obtained in this way, the decompression binary cluster generation unit 221 adds 0 to the front of 1011 to generate data of "01011 " as the number of reference bits into the decompression binary cluster. In other words, since the number of reference bits of the original binary cluster is already agreed, decompression is performed by adding 0 in front of the compressed solution.

On the other hand, when the binary cluster after decompression is the last binary cluster whose number of bits is smaller than the reference number of bits (for example, 5 bits), the decompression binary cluster is generated using the signal bits received together with the compression cluster. For example, when "0" is transmitted as a signal bit, the corresponding uncompressed binary cluster is data having a leading 0, and when "00" is transmitted as the signal bit, the corresponding uncompressed binary cluster is preceded by 00 And when 1 is transmitted as a signal bit, the corresponding decompression binary cluster is itself a decompressed data. Also, according to an embodiment, since the number of the last binary clusters smaller than the reference bit number and the data amount itself are very small, they may be received in an uncompressed state and may be combined in the binary data synthesis as it is.

As described above, the method and apparatus for compressing and decompressing binary data according to the present invention can quickly and efficiently decompress and decompress binary data through a simple operation and a hardware configuration, The reliability of the compressed data and the decompressed data can be increased.

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: binary data compression device
110: Compression operation unit 111: Data division unit
112: compression cluster generation unit 120:
200: decompression device
210: Receiving unit 220:
221: decompression binary cluster generation unit
222:

Claims (16)

A method of compressing binary data of a compression device,
Generating at least one binary cluster by dividing the binary data by a predetermined number of reference bits from the least significant bit;
Wherein the compression operation unit performs, for each of the binary clusters, a first carry point to start a carry down event with the first carry point as a start point, Subtracting a binary number consisting only of a minimum number of 1s in each binary cluster; And
Wherein the compression computation unit repeats the step of subtracting for each binary cluster until the carry-down event no longer occurs while moving the position of the first carry point by one digit to the upper digit, And generating a control signal,
Wherein the carry-down event refers to borrowing a number from the top of the binary cluster when subtracting the binary cluster, wherein the first carry point moves from the lowest position to the highest position of the binary cluster, A method of compressing binary data of a compression device.
The method according to claim 1,
Further comprising the step of the transmitting unit transmitting the at least one compressed cluster generated by the compression computing unit to the destination apparatus.
delete 3. The method of claim 2,
A binary cluster in which the number of bits of the at least one binary cluster generated by dividing the binary data from the least significant bit is smaller than the reference bit number may be transmitted to the destination device as the original itself without generating a corresponding compression cluster, And transmitting the compressed binary data together with a signal bit having information on the binary cluster.
The method according to claim 1,
Wherein the binary cluster including 0 in the most significant bit of the at least one binary cluster performs the compression method after removing at least one continuously arranged from the most significant bit.
delete delete A binary data compression apparatus comprising:
At least one binary cluster is generated by dividing the binary data by a predetermined number of reference bits from the least significant bit, and for each binary cluster, each of the binary clusters causes a carry-down event to be generated first starting from the first carry point Performing a subtraction operation for subtracting a binary number consisting of a minimum number of 1s from the first carry point to each binary cluster, shifting the position of the first carry point by one digit to the upper digit, And a compression operation unit for generating at least one compressed cluster by repeating the subtraction operation for each binary cluster until a down event no longer occurs,
Wherein the carry-down event refers to borrowing a number from the top of the binary cluster when subtracting the binary cluster, wherein the first carry point moves from the lowest position to the highest position of the binary cluster, A binary data compression device.
9. The method of claim 8,
Further comprising: a transmitter for transmitting the at least one compressed cluster generated by the compression computation unit to a destination apparatus.
delete 10. The method of claim 9,
A binary cluster in which the number of bits of the at least one binary cluster generated by dividing the binary data from the least significant bit is smaller than the reference bit number may be transmitted to the destination device as the original itself without generating a corresponding compression cluster, And transmits the compressed cluster together with a signal bit having information on the binary cluster.
9. The method of claim 8,
Wherein the compression operation unit removes at least one zeros consecutively arranged from the most significant bit in the case of a binary cluster including 0 in the most significant bit of the at least one binary cluster, Compression device.
9. The method of claim 8,
The compression operation unit
A data dividing unit dividing the binary data to generate the at least one binary cluster; And
And a compression cluster generation unit for generating, for each binary cluster, the at least one compressed cluster by repeating the subtraction operation for each binary cluster until no carry-down event occurs any more. Data compression device.
delete delete delete

Images