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

Abstract

The present invention provides an apparatus for compressing binary data, an apparatus for decompressing the binary data and a method for compressing and decompressing the binary data, in which the apparatus for compressing binary data includes: a compression calculating unit and a transmitting unit. The compression calculating unit repeats a basic compression process of: extracting a binary cluster including a binary number between a 10 positioned at an upper bit than a carry point and the carry point, based on the carry point, which is a start bit for generating a carry down event that borrows a number from an upper digit, for a subtraction from a lower digit of the binary number of binary data; extracting a carry key corresponding to the binary number having a minimum size among binary numbers including only 1 for generating the carry down event with respect to the binary cluster; subtracting the carry key from the binary number of the binary data a predetermined number of times. Also, the compression calculating unit repetitively performs the basic compression process a predetermined number of times, based on a new carry point set by moving the carry point to a preceding digit, with respect to the binary number obtained by repetitively performing the basic compression process the predetermined number of times and performs the process of moving the carry point to the preceding digit until the carry down event is generated for the first time to repetitively perform the basic compression process based on each carry point. The transmitting unit transmits the data with respect to the binary number, to which the compression is completed by the compression calculation unit, to a target device.

Description

[0001] Binary data compression and decompression apparatus and method [0002]

The present invention relates to a binary data compression and decompression apparatus and method, and more particularly, to a binary data compression and decompression apparatus and method having excellent compression and decompression efficiency of binary data.

Generally, a binary number refers to a binary number expressed by 0 and 1, and is used for processing and representation of data used in a computer or the like.

Binary data consisting of such binary numbers are required to be compressed in consideration of their processing speed and storage capacity. Conventional methods of compressing and decompressing binary data are disclosed in Korean Patent Publication No. 10-1999-022960 entitled " And a parallel compression and restoration processor, which is a method of compressing a binary code, comprising serial multiplication of a coded signal bit value and an orthogonal coding function value, products, the discrete value of the function is used as an encoding function, the function is a piecewise continuous function which is in the form of a Gaussian pulse with a frequency, and the encoding transformation And the discrete values of the data input flow and the encoding function are used as independent variables of the above sequence It is used as a waterway.

However, such a method of compressing binary data has a problem in that it is difficult to improve the processing speed and the reliability of the resultant value because of a complicated process for compressing and decompressing the data.

In order to solve the problems of the prior art as described above, it is an object of the present invention to improve the processing speed for compression and decompression, to provide an excellent compression ratio, and to improve the reliability of the result of compression and decompression have.

Other objects of the present invention will become readily apparent from the following description of the embodiments.

According to an aspect of the present invention, there is provided a method for decoding a binary number of binary data, the method comprising: Extracts binary clusters consisting of binary numbers between 10 and carry points located at higher order bits based on a carry point and extracts a binary cluster consisting of only one binary number that causes a carry down event for the binary cluster, Extracting the carry key from the binary number of the binary data, extracting the binary cluster, extracting the carry key, and subtracting the carry key from the binary number of the binary data, , And the basic compression process For a binary number obtained by repeatedly performing a predetermined number of times, the basic compression process is repeatedly performed a predetermined number of times based on a new carry point set by moving the carry point to the previous position, and the carry point is moved to the previous position A compression operation unit that repeatedly performs the basic compression process based on each of the carry points by performing the process until the carry-down event does not occur for the first time; And a transmitter for transmitting data on the binary number that has been compressed by the compression calculation unit to the destination apparatus.

Wherein the compression operation unit comprises: a first cluster extracting unit for extracting the binary cluster from the binary data; A first carry key extracting unit for extracting the carry key causing the carry down event for the binary cluster extracted by the first cluster extracting unit; A carry-down operation unit for performing an operation of subtracting the carry key extracted from the first carry key extracting unit from a binary number; A first number counter for counting the number of basic compression processes including extraction of a binary cluster by the first cluster extraction unit, extraction of a carry key by the first carry key extraction unit, and calculation by the carry down calculation unit; A first carry point recognizing unit for calculating extraction and movement of the carry point; A first period counter for counting a moving period of the carry point; And a carry carry-down operation merge unit for attaching bits without any change other than the carry-down event operation result by the carry-down operation unit.

In order to transfer the carry point position data immediately before the end of compression by the transmission unit, the compression calculation unit can transfer all the "1" s of the upper bits of the finally compressed data from the carry point immediately before completion of compression to "0" have.

The transmitter may transmit data on the number of repetitions within the cycle and the number of repetitions immediately before the end of compression in the final period to the destination apparatus together with the binary number finally compressed by the compression calculation unit.

According to another aspect of the present invention, a carry-up event may be generated in which the compressed binary data is received from the binary data compression device and the number is incremented from the back position to the top position in the compressed binary number Extracts binary clusters consisting of binary numbers between 10 and carry points located at higher order bits based on a carry point which is a start bit of the binary cluster, Extracting a carry key corresponding to a binary number having a minimum size from the binary numbers, adding the carry key to the compressed binary number, extracting the binary cluster, extracting the carry key, and adding the carry key. The decompression process can be repeated a predetermined number of times. Performing the basic decompression process repeatedly a predetermined number of times based on a new carry point set by moving the carry point to a previous position for a binary number obtained by repeatedly performing the basic decompression process a predetermined number of times, A decompression operation unit for repeatedly performing the basic decompression process by a predetermined number of times based on each of the carry points by performing the process of moving the carry point to a previous position by a predetermined period; And an output unit for outputting data of a binary number decompressed by the decompression calculation unit.

And a receiver for transmitting the compressed binary number together with the predetermined number of repetitions within the period and the number of repetitions immediately before the end of compression in the final period to the decompression calculation unit.

Wherein the decompression calculation unit comprises: a second cluster extraction unit for extracting the binary cluster from the compressed binary number; A second carry key extracting unit for extracting the carry key causing the carry-up event for the binary cluster extracted by the second cluster extracting unit; A carry-up operation unit for performing an operation of adding a carry key extracted from the second carry key extracting unit to a binary number; A second number counter for counting the number of basic decompression processes, which include extraction of a binary cluster by the second cluster extraction unit, extraction of a carry key by the second carry key extraction unit, and calculation by the carry-up operation unit; A second carry point recognizing unit for calculating extraction and movement of the carry point; A second period counter for counting a moving period of the carry point; And a non-carry-up operation merging unit for directly attaching bits having no change other than the calculation result of the carry-up event by the carry-up operation unit.

Wherein the decompression arithmetic unit sets the position of the first encountered "1" in the process of shifting from the most significant bit to the least significant bit in the compressed binary number as the carry point position immediately before the end of compression so as to obtain the carry point position immediately before the end of compression, It is possible to change the upper bit "0" to "1" rather than the position of "1".

According to another aspect of the present invention, there is provided a method for decoding a binary number of a binary data, the method comprising: a first step of performing a carry-down event on the basis of a carry- Extracting binary clusters composed of binary numbers between 10 and carry points positioned at higher order bits by a compression operation unit; Extracting, by the compression operation unit, a carry key corresponding to a binary number having a minimum size out of binary numbers consisting of only 1 that causes the carry-down event for the binary cluster; Subtracting the carry key from the binary number of the binary data by the compression operation unit; Performing a basic compression step including a step of extracting the binary cluster, a step of extracting the carry key, and a step of subtracting the carry key by the compression operation unit by a predetermined number of times; The basic compression step is repeatedly performed by a predetermined number of times based on a new carry point set by shifting the carry point to a previous position for a binary number obtained by repeating the basic compression step by a predetermined number of times by the compression operation unit step; And performing the basic compression step repeatedly on the basis of each carry point by performing the process of moving the carry point to the previous position by the compression operation unit until the carry down event does not occur for the first time A binary data compression method is provided.

In order to transfer the carry point position data immediately before the end of compression by the transmission unit, all of "1" of higher bits than the carry point immediately before completion of compression in the binary data finally compressed by the compression operation unit is changed to "0" The method comprising the steps of:

The method may further include transmitting data to the destination apparatus by the transmitter in the form of a predetermined number of repetitions within a period and a repetition number immediately before the end of compression in the final period together with the compressed binary number obtained by completing all of the steps have.

According to another aspect of the present invention, there is provided a carry-up event in which binary data compressed by the binary data compression method is received and a number is incremented from the back position to the top position in the compressed binary number Extracting, by a decompression arithmetic unit, a binary cluster consisting of a binary number between 10 and a carry point located at a higher order bit based on a carry point which is a start bit that can be generated; Extracting, by the decompression computation unit, a carry key corresponding to a binary number having a minimum size out of binary numbers consisting of only 1 that causes the carry-up event for the binary cluster; Adding the carry key to the compressed binary number by the decompression operation unit; Performing a basic decompression step including a step of extracting the binary cluster, a step of extracting the carry key, and a step of adding the carry key by the decompression operation unit by a predetermined number of times; The basic decompression step is repeatedly performed for a predetermined number of times by the decompression operation unit, and the basic decompression step is repeatedly performed a predetermined number of times based on the new carry point set by moving the carry point to the previous position ; And performing the basic decompression step repeatedly a predetermined number of times based on each of the carry points by performing the process of moving the carry point to the previous position by the decompression operation unit by a predetermined period, A release method is provided.

In order to obtain the carry point position immediately before the end of compression, the position of "1" which is first encountered in the process of shifting from the most significant bit to the least significant bit in the compressed binary number is set as the carry point position immediately before the end of compression , And changing the " 0 " of higher order bits to the position of " 1 "

The receiving unit may transmit the compressed binary number together with the predetermined number of repetition times within the period and the number of repetition times immediately before the end of the compression in the final period to the decompression calculation unit.

According to the binary data compression and decompression apparatus and method according to the present invention, the processing speed for compression and decompression can be improved, the compression rate can be improved, the reliability of the result of compression and decompression can be increased, The substantial traffic of the data transmission can be remarkably reduced.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram showing a binary data compression apparatus and a binary data decompression apparatus according to the present invention,
2 is a flowchart illustrating a binary data compression method according to the present invention,
3 is a flow chart illustrating a method for decompressing binary data according to the present invention.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It is to be understood, however, that the invention is not to be limited to the specific embodiments, but is to be understood to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention, And the scope of the present invention is not limited to the following examples.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings, wherein like or corresponding elements are denoted by the same reference numerals, and redundant explanations thereof will be omitted.

1 is a block diagram showing a binary data compression apparatus and a binary data decompression apparatus according to the present invention.

As shown in FIG. 1, the binary data compression apparatus 100 according to the present invention may include a compression calculation unit 120 and a transmission unit 130.

The compression operation unit 120 performs a compression operation based on a carry point which is a start bit for generating a carry down event in which a digit is borrowed from a leading digit for subtraction from a binary digit in binary data, And a carry key corresponding to a binary number having a minimum size among the binary numbers consisting of only 1 that causes a carry down event for the binary cluster, The basic compression process including extracting the binary cluster, extracting the carry key, and subtracting the carry key from the binary number of the binary clusters is repeatedly performed a predetermined number of times, and the basic compression process is repeatedly performed a predetermined number of times For binary numbers, move the carry point forward The basic compression process is repeatedly performed a predetermined number of times based on the new carry point set and the process of moving the carry point to the previous position is performed until the carry-down event does not occur for the first time, The compression process is repeatedly performed.

The compression operation unit 120 may perform the compression process on the binary data as described above for a predetermined period with a fixed number of times as one cycle. Further, when the compression process reaches a state in which the carry-down event can not be generated for the first time Lt; / RTI >

The compression computation unit 120 includes a first cluster extraction unit 121 for extracting binary clusters from binary data, a carry key generating a carry down event for the binary cluster extracted by the first cluster extraction unit 121, A carry-down operation unit 123 for performing an operation of subtracting the carry key extracted from the first carry key extracting unit 122 from a binary number, a first carry extracting unit 122 A first number counter 124 for counting the number of basic compression processes, which is the extraction of binary clusters by the first carry key extractor 122, the extraction of the carry key by the first carry key extractor 122, and the calculation by the carry down operator 123, A first cycle counter 126 for counting a carry period of a carry point, a carry period determiner 126 for calculating a carry down event by the carry down operation unit 123, Of And a non-carry-down operation merging unit 128 for directly attaching bits having no change other than the operation result. Here, the first carry key extracting unit 122 may determine whether or not a carry down event is possible. Also, the movement period of the carry point may mean the number of times to move the carry point.

Also, in order to transmit the carry point position data immediately before the end of compression by the transmission unit 130, the compression calculation unit 120 extracts all "1" s of higher order bits from the finally compressed data from the carry point just before completion of compression, &Quot;

The compression operation unit 120 may further include a control unit (not shown) for control according to compression, and may further include a first memory unit 127 for storing programs and data necessary for driving.

The transmission unit 130 transmits the binary-number data compressed by the compression calculation unit 120 to a destination device, for example, the binary data decompression device 200, or a process device or a memory device requiring other compressed binary data . Here, the transmitting unit 130 may be formed of a wire or cable according to a communication method of a destination apparatus, and may transmit signals by wire, or may be formed of communication modules such as Bluetooth, Wi-Fi, 3G, LTE, and the like and wirelessly transmit signals.

The transmission unit 130 receives the number of repetitions in the cycle, i.e., the number of subtractions in each of the carry points, the number of repetitions in the period excluding the final period, The number of bits of the original binary data or the number of bytes, the carry point position immediately before the end of compression, and the like to the destination apparatus.

Meanwhile, the binary data compression apparatus 100 according to the present invention may be a wire, a cable, or a communication module for wired or wireless communication in order to receive binary data from an external device 1, for example, a separate process apparatus or a memory device. The receiving unit 110 may further include a receiving unit 110. Here, the external device 1 refers to an apparatus that is distinguished from the binary data compression apparatus 100. The external apparatus 1 may be composed of a single apparatus together with the binary data compression apparatus 100, or may be separate from the binary data compression apparatus 100 Lt; / RTI >

As shown in FIG. 1, the binary data decompression apparatus 200 according to the present invention decompresses compressed binary data transmitted by the binary data compression apparatus 100 according to the present invention, The apparatus for extracting binary data may include a decompression calculation unit 220 and an output unit 230.

The decompression operation unit 220 may receive a compressed binary data from the binary data compression apparatus 100 and may carry out a carry up event in which the binary number is incremented from the back position to the top position for addition A binary cluster consisting of binary numbers between 10 and carry points located at higher order bits on the basis of a carry point which is a start bit is extracted and a binary cluster consisting of only 1 which causes a carry- , Extracts a carry key corresponding to a binary number having a minimum size, adds a carry key to the compressed binary number, and extracts a binary cluster, extracts a carry key, and adds a carry key to a predetermined number of iterations , And the basic decompression process is repeated a predetermined number of times The basic decompression process is repeatedly performed a predetermined number of times based on the new carry point set by moving the carry point to the previous position, and the process of moving the carry point to the previous position is performed for a predetermined period , For example, up to a final carry point position at the time of termination of compression, on the basis of each carry point, by a predetermined number of times. Here, the predetermined number of times may be the number of times that one period is made in the cycle immediately before the last cycle from the initial cycle, and may be the number of times until the carry down event is not generated first in the final cycle of the compression process in the final cycle.

The decompression computing unit 220 includes, for example, a second cluster extracting unit 221 for extracting a binary cluster from the binary number compressed by the above-mentioned method, and a second cluster extracting unit 221 for extracting a binary cluster extracted by the second cluster extracting unit 221, A carry-up operation unit 223 for performing an operation of adding a carry key extracted from the second carry-key extracting unit 222 to a binary number, a second carry-key extracting unit 222 for extracting a carry- The number of times of the basic decompression process including the extraction of the binary cluster by the second cluster extracting unit 221, the extraction of the carry key by the second carry key extracting unit 222 and the calculation by the carry-up operation unit 223 are counted A second count counter 224 for counting the carry period of the carry point, a second carry counter 224 for counting the carry period of the carry point, (223) Attaching the operation result with no other change bit as the ratio of the re-up event may include a carry-up operation merging unit 228. The Further, the decompression arithmetic operation unit 220 may further include a control unit (not shown) for controlling the decompression, and may further include a second memory unit 227 for storing programs and data necessary for driving have.

Also, in order to acquire the carry point position immediately before the end of compression, the decompression arithmetic operation unit 220 sets the position of the first encountering "1" in the process of moving from the most significant bit to the least significant bit in the compressed binary number as the carry point position immediately before the end of compression , It is possible to change the upper bit "0" to "1" above the position of "1".

The output unit 230 outputs the binary number data decompressed by the decompression calculation unit 220 to the second memory unit 227, a separate memory device, a process device, or the like. Here, the output unit 230 may be a wire, a cable, a wireless communication module, or the like in order to output data.

The binary data decompression apparatus 200 according to the present invention may be implemented as a wire, a cable, a wireless communication module, or the like in order to receive data on binary numbers compressed by the transmission unit 130 of the binary data compression apparatus 100, And may further include a receiving unit 210. Here, the receiving unit 210 receives the compressed binary number, the predetermined number of repetitions in the cycle, i.e., the number of subtractions in each carry point, the number of repetitions in the period excluding the final period, the number of repetitions before the end of compression in the final period, The number of bits of the original binary data, the number of bytes, the carry point position immediately before the end of compression, and the like to the decompression arithmetic operation unit 220.

The binary cluster, the carry key, the carry down event, the carry-up event, the carry point, and the like described above will be described in more detail, and both the binary data compression method and the binary data decompression method described below can be applied.

For example, in the case of binary number 101, subtracting 1 as a binary number results in 100. In this case, in the case of 100, which is a binary number of three digits, the downward phenomenon does not occur as compared with 101. In other words, there is no borrowing of numbers from the top for subtraction. Then subtract the binary number 11 and the result is 10. In this case, 101, which is a 3 digit binary number, is 11, which is borrowed from 1 to 2 of the third digit, and the value of 10 is obtained through the operation of the second digit of 1, which is called a carry down event. In the present invention, a carry down event is defined as a first carry down phenomenon occurring in the smallest numerical value such as 1, 11, 111, 1111, ... called a carry key. At this time, the carry-down event may include not only the case where the number of bits of the original number itself becomes small, but also the first falling-down occurring inside. In other words, if the binary number 110 is subtracted from the binary number 1, it becomes 101, and the occurrence of the falling in the second digit is also considered to have occurred as a carry key of 110 to 1.

In binary 101, if the smallest one of the carry keys is added, the result is that the number overflows at the first digit of the binary method as in 110, which carries up the next digit. This is called a carry-up event.

For example, in the case of 1101010101010 which is a binary number, such a carry-up event and a carry-down event can be grouped in a minimum unit for generating such as 110/10/10/10/10/10. Here, the first 110 is called a head binary cluster. As another example, in the case of a binary number of 100101101011, separation into 100/101/10/1011 is possible. At this time, the first 100 is the head binary cluster. On the other hand, the head binary cluster may or may not include one or more consecutive "1 " s in front of 10, and a general cluster may exist after the head binary cluster.

The method of binding clusters can be performed by the compression identification unit 121. For example, when descending from the last binary number to the previous binary number, the first bit is scanned and then the first 10 is output, It can be performed by finding a position up to the front position.

For example, as shown in Table 1 below, in the case of 11010, scanning is performed from E bit to A bit, and from the D bit appearing first at 10 to the immediately preceding 10 position (E at the position of the last bit when there is no previous 10) D ~ E can be made by concatenation.

A B C D E One One 0 One 0

(B to C), which is the 10-bit high-order bit of the immediately preceding 10 (C position), which is the 10th start position that is encountered while moving to the left from the D-1 position (C position) Since there are no more 10 in front of it, it is called Head Binary Cluster (A to C) including all of A.

The binary clusters after the head binary cluster all belong to the general cluster. The head binary cluster and the general cluster are collectively referred to as a binary cluster.

The carry key generating the carry down event and the carry up event is infinite like 1, 11, 111, ..... At this time, the carry key differs according to the listed patterns of 1 and 0 of the binary data to be compressed. However, the total number of changing bits varies depending on the size of the carry key generating the carry down event and the carry up event, which is called carry event entropy. For example, in the binary number 10010, as shown in Table 2 below, the carry-down event can be made to occur using carry-key 1, the result being 10001. Also, for the same original binary data 10010, a carry-up event can be generated using the carry key 11, the result being 10101

A B C D E One 0 0 One 0

However, when comparing these two cases, the number of bits in the first case changed from 10 to 01 in the D and E bits, and 010 in the C, D and E bits changed to 101 in the second case It changed. In this example, the carrie-down event is compressed and decompressed by selecting the carrie-key 1 that causes less change in entropy among the carry-up events in the compression-undelete event.

A carry point is the position of the start bit where a carry-down or carry-up event can occur with a particular carry key. For example, in the case of a binary cluster as shown in Table 3 below, a carry-down event may be generated from the C bit to the carry key 11, or a carry-up event may occur from the C bit to the carry key 1, Is a C bit, which is called a carry point.

A B C One 0 One

In addition, the cycle can perform a predetermined number of times, that is, a carry-up event or a carry-down event, in a number of the same number as the number of movements of the carry point.

2 is a flowchart illustrating a binary data compression method according to the present invention.

As shown in FIG. 2, a binary data compression method according to the present invention includes a carry-in point (a start bit) in which a carry-down event that borrows a digit from the top for subtraction from a binary digit of binary data occurs (S11) of extracting, by a compression arithmetic operation unit (120), a binary cluster consisting of the closest 10 and a binary number between carry points located at higher order bits on the basis of a carry point A step S12 of extracting a carry key corresponding to a binary number having a minimum size from among the binary numbers consisting of only 1 that causes an event by the compression operation unit 120 and a step of extracting a carry key from the binary number of the binary data by the compression operation unit 120 Subtracting step S13, extracting a binary cluster S11, extracting a carry key S12 by the compression calculating unit 120, And a step S13 of subtracting the carry key from each other. The step S15 repeatedly performs a basic compression step consisting of the steps of: (S16) moving the carry point to the previous position, performing the basic compression step repeatedly based on the set new carry point a predetermined number of times, and moving the carry point to the previous position by the compression operation unit 120 S16) until the carry-down event does not occur for the first time (S14), and repeatedly performing the basic compression step based on each of the carry points.

In addition, the compression operation unit 120 may increase the number of cycles and move the carry point to the previous position (step S17).

Further, in order to transmit the carry point position data immediately before the end of compression by the transmission unit 130, all of the upper bits " 1 " of the carry point immediately before the end of compression in the finally compressed binary data by the compression calculation unit 120 are "Quot; 0 " and deliver it.

On the other hand, in addition to the compressed binary numbers obtained by finishing all the steps S11 to S17, the number of repetitions predetermined in the cycle, i.e., the number of subtractions at each carry point, excluding the final cycle, , The number of repetitions before the end of compression in the final cycle, the number of bits or bytes of the original binary data, the carry point position immediately before the end of compression, and the like, to the destination device by the transmitter 130 .

3 is a flow chart illustrating a method for decompressing binary data according to the present invention.

As shown in FIG. 3, the method for decompressing binary data according to the present invention is a method for decompressing compressed binary data transmitted by the binary data compressing method according to the present invention. A carry point, which is a start bit for receiving a binary data compressed by the data compression method and generating a carry up event in which compressed digits are incremented from the back position to the top position for addition, (Step S21) of extracting binary clusters composed of binary numbers between 10 and carry points located at higher order bits by the decompression arithmetic operation unit 220, Among the binary numbers, a carry key corresponding to a binary number having a minimum size is decompressed A step S23 of adding a carry key to the binary number compressed by the decompression arithmetic unit 220 and a step S23 of extracting the binary cluster by the decompression arithmetic unit 220 A step S24 of repeatedly performing a basic decompression step including a step of extracting a carry key S22 and a step S23 of adding a carry key to the decompression arithmetic operation unit 220 by a predetermined number of times; Step of repeatedly performing the basic decompression step for a predetermined number of times based on the new carry point set by moving the carry point to the previous position for the binary number obtained by repeatedly performing the step repeatedly, (S25), the basic decompression step is performed for a predetermined number of times based on each of the carry points It may include the step of repeatedly performed. Here, the predetermined number of times may be the number of times that one period is made in the cycle immediately before the last cycle from the first cycle, and may be the number of times until the carry down event occurs in the last cycle of the compression process in the final cycle.

In order to obtain the carry point position immediately before the end of compression, the decompression arithmetic unit 220 sets the position of the first encountering "1" in the process of moving from the most significant bit to the least significant bit in the compressed binary number to the carry point position , And changing the " 0 " of the upper bit from the position of the " 1 " to " 1 ".

On the other hand, in addition to the compressed binary number, the number of repetitions in the cycle, i.e., the number of subtractions given in each of the carry points, the predetermined repetition number in the cycle, the repetition number immediately before the end of compression in the final cycle, And a carry point position immediately before the end of compression, to the decompression calculation unit 220 by the reception unit 210. Therefore, the decompression arithmetic operation unit 220 not only performs the above-described steps S21 to S27 so as to correspond to a predetermined number of times and periods, but also performs the above-described steps (S21 to S27).

The binary data compression method and the binary data decompression method according to the present invention will be described as an example.

First, the compression process will be described. When binary 11010100 is taken as an example, the binary cluster is divided into 110/10/100. If a carry-down event is generated at each carry-point by setting the number of repetitions (repetition times) to 4 in advance, the compression operation starts from carry-point 0. If four carry-down events Carry Point You can proceed based on the nearest binary cluster.

At this time, the number of repetition times can be appropriately determined in consideration of the size of the original binary data. The number of iterations is the most important factor that determines the compression rate and compression time. If the number is counted from 1 to the designated number, it repeats the process of 1 cycle and then initialization to 0 again. For example, if the original binary data is very large, 100,000,000 bits of data can be specified to repeat at least 100,000 times, or more. Therefore, the number of iterations can be specified in consideration of the compression time and the compression efficiency according to the capacity size of the original binary data. The compression efficiency and the compression time are calculated in advance according to the number of repetitions using the information processing means, It can also be specified through calculation.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Number of repetitions A One One 0 One 0 One 0 0 B (-) One One C One One 0 One 0 0 One One D (-) One One One 2 E One One 0 0 One One 0 0 F (-) One 3 G One One 0 0 One 0 One One H (-) One One 4 I One One 0 0 0 One 0 0

After four repetition times, the carry point moves to the left carry point 1 by 1 bit and carries out the next cycle (second cycle), so that four carry down events are carried out again at carry point 1 Lt; RTI ID = 0.0 > cluster. ≪ / RTI >

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Number of repetitions I One One 0 0 0 One 0 0 J (-) One One K One One 0 0 0 0 One 0 L (-) One One 2 M One 0 One One One One 0 0 N (-) One 3 O One 0 One One One 0 One 0 P (-) One One 4 Q One 0 One One 0 One 0 0

When the repetition number of four times is completed again, the carry point is shifted to carry point 2 as shown in Table 6 below, and the third cycle is performed to perform the fourth round again based on the closest binary cluster at carry point 2 .

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Number of repetitions Q One 0 One One 0 One 0 0 R (-) One One One S One 0 One 0 One 0 0 0 T (-) One 2 U One 0 One 0 0 One 0 0 V (-) One One 3 W One 0 0 One One 0 0 0 X (-) One 4 Y One 0 0 One 0 One 0 0

When the number of repetitions of four times is completed, the carry point is shifted to carry point 3 again, as shown in Table 7 below, and the fourth cycle is performed again based on the closest binary cluster at carry point 3. As shown in Table 7 below, when the number of repetitions is four, the effect of decreasing the bit by one bit can be confirmed when compression reaches to carry point 3 (see AG row). If the number of repetitions is 40, the effect of decreasing the bit can be confirmed even before reaching carry point 3.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Number of repetitions Y One 0 0 One 0 One 0 0 Z (-) One One AA One 0 0 0 One One 0 0 AB (-) One One 2 AC One One One 0 One 0 0 AD (-) One 3 AE One One 0 One One 0 0 AF (-) One One 4 AG One 0 One 0 One 0 0

In this way, as shown in Table 8 below, the operation is continued for the specified number of repetitions based on the closest binary cluster for each carry point, while moving the carry point to 4-> 5-> 6-> 7.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Number of repetitions AG One 0 One 0 One 0 0 AH (-) One One One AI One 0 0 One 0 0 AJ (-) One 2 AK One 0 One 0 0

As with the end of compression, as shown in Table 8, although the carry point is at 4, but after the second iteration, as in the case of the AK row, there is no data in the higher bits than the carry point 4, Additionally, if a carry down event can not occur at the carry point, the compression process ends. Information indicating the end of the number N of repetition times in the last cycle and binary numerical information (10100 in the AK row) remaining through the compression process are left as compression information.

In this example, since the carry-down event can not be generated any more at the carry-down point 4, the second iteration of the repetition period 5 times, and the second iteration, the compression is finally finished. Therefore, the compressed information to be transmitted has a period of 5 (or a carry point of 4 since the carry point starts from 0 and ends at 4), the compressed binary data information is 10100, The number of times information is 2).

For example, in the case of 100 million bits of binary data, if the repetition period is set to 10,000,000, the final compression information will be greatly reduced, and the cycle information will be concisely represented by the information of Pth (the key point has moved to P) Since the position of the final carry pointer can also be expressed concisely with the information of the bit (P + 1-th bit), it has a large compression effect.

As described above, the direct transmission unit 130 may transmit the carry point position at the end of the compression process to the receiving unit 210, or the carry pointer at the end of the compression process may be transmitted. It is possible to check the position of the first "1" to be encountered while descending to the lower bit, and then transmit all of the upper bits of this position to "0" to transmit the compressed data. Accordingly, the decompression device of the transmission unit 130 can recognize the position of the carry pointer at the end of the compression process as the compressed data itself. For example, if the number of repetitions determined in a cycle is 1, the compression of the original data 1010010 can not occur at the number of repetitions of 0 in the third cycle. At this point, the carry point is at 2. At this time, if the upper bits of the compressed data 111111 are all set to 0 rather than the carry point 2 position, 000111 is obtained. The compressed data thus transformed is transmitted to the transmission unit. In this case, the compressed data and the predetermined number of repetitions in the cycle and the repetition number in the final cycle can be transmitted to the decompression unit.

The decompression process begins with the result of the AK row, as in the previous example. Since the original bit is 8 bits, the carry point can be set from 0 to 7. The final carry-point information at the time of compression is 4, and the compression progresses to the second number of repetitions during 5 cycles (the carry-point increases from 0 to 4 and thus becomes 5 cycles in this example). At this time, when receiving the modified compressed data with respect to the last carry point position at the end of the compression process, the position of the first carry "1" can be set to the position of the final carry point while moving from the most significant bit to the lower bit, Quot; 0 " of the position before the " 1 " position can be converted to " 1 ", and the " modified " compressed data can be reduced back to the " normal " compressed data. For example, if the " modified " compressed data is 000111, it acquires and stores the position of 000 " 1 " 11 as the final carry point position and converts all the " 0 " And can return to the normal compressed data of the 111111 type.

By using the thus obtained " normal " compressed data, the last carry point position, the repetition number information within the repetition period, and the repetition number information in the final repetition cycle, As shown in Table 9 below, the start point of the decompression starts from the carry point 0 with respect to the compressed data 10100, repeats the carry-up event at the period and the number of times, reaches the carry point up to 4, The decompression ends. This process is illustrated in Table 9 below.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Cycle One 0 One 0 0 A (+) One One One One B One One 0 One One C (+) One 2 D One One One 0 0 E (+) One One One 3 F One 0 0 0 One One G (+) One 4 H One 0 0 One 0 0

Since the number of repetitions of four times has been completed, the carry point is shifted to 1 as shown in Table 10 below, and the fourth cycle is repeated as the second cycle.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Cycle H One 0 0 One 0 0 I (+) One One One J One 0 One 0 One 0 K (+) One 2 L One 0 One One 0 0 M (+) One One 3 N One One 0 0 One 0 O (+) One 4 P One One 0 One 0 0

Since the repetition number of four times is completed again, the carry point is shifted to 2 as shown in Table 11 below to repeat the fourth carry-up event again in the third period.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Cycle P One One 0 One 0 0 Q (+) One One R One One One 0 0 0 S (+) One One 2 T One 0 0 0 One 0 0 U (+) One 3 V One 0 0 One 0 0 0 W (+) One One 4 X One 0 One 0 One 0 0

Since the repetition number of 4 repetitions is completed again, the carry point is shifted to 3 as shown in Table 12 below, and the repetition is repeated so as to generate the carry-up event 4 times in the fourth cycle again.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Cycle X One 0 One 0 One 0 0 AA (+) One One One AB One One 0 One One 0 0 AC (+) One 2 AD One One One 0 One 0 0 AE (+) One One 3 AF One 0 0 0 One One 0 0 AG (+) One 4 AH One 0 0 One 0 One 0 0

Since the number of repetitions is 4, move the carry point to 4 as shown in Table 13. However, since the information that the carry point is 4 is the information received at the time of compression, it is decompressed only up to the second repetition cycle using the information that the second of the final cycles is the last repetition frequency. In this example, since compression has been performed up to the second compression number of four cycles during compression, decompression is terminated when the second number of times is reached at the decompression. Therefore, the decompression result is 11010100, which is the decompression result, which is identical to the original binary data in compression.

Carry point
7 Carry point
6 Carry point
5 Carry point
4 Carry point
3 Carry point
2 Carry point
One Carry point 0 Cycle AH One 0 0 One 0 One 0 0 AI (+) One One AJ One 0 One 0 0 One 0 0 AK (+) One One 2 AL One One 0 One 0 One 0 0 End

On the other hand, the determination of a certain number of iterations in the cycle can be performed by the user in consideration of the size of the binary data. The greater the number of repetitions in the cycle, the more efficient the compression. The method of finding a certain number of iterations in the optimal period is to find n 'value (1 <= n') which shows the maximum compression efficiency by performing compression for a certain number of iterations in each cycle for arbitrary natural numbers from 1 to n, < = n) can be considered. In addition, the compression-related information to be transmitted to the transmission unit after compression can be represented by a method other than a binary method (for example, a 256-ary method or a decimal method) in order to further enhance the efficiency of expression, , Or other unused space such as a separate disk or memory.

According to the apparatus and method for decompressing and decompressing binary data according to the present invention, a binary cluster is used to repeatedly perform a subtraction operation repeatedly to generate a carry down event at the same carry point as the number of times specified by the user, Moving the point forward and repeatedly performing a subtraction operation so that a carry-down event occurs repeatedly, the compression proceeds. As a result, when the carry-down event can not be generated for the first time, it becomes the final cycle, and the number of repetitions in the last cycle, the compressed binary number result, and the carry point position (bit number or byte number) Information is returned to the previous data again.

Although the present invention has been described with reference to the accompanying drawings, it is to be understood that various changes and modifications may be made without departing from the spirit of the invention. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined by the scope of the appended claims and equivalents thereof.

1,2: External device 110: Receiver
120: compression operation unit 121: first cluster extracting unit
122: First carry key extracting unit 123: Carry down operation unit
124: first count counter 125: first carry point recognizer
126: first period counter 127: first memory unit
128: non-carry-down operation merging unit 130:
210: Receiving unit 220:
221: second cluster extracting unit 222: second carry key extracting unit
223: carry down operation unit 224: second times counter
225: second carry point recognizing unit 226: second period counter
227: second memory unit 228: non-carry-up operation merging unit
230: Output section

Claims (14)

10, which is located at a higher bit with respect to a carry point which is a start bit at which a carry down event that borrows a digit from the upper position for subtraction from the binary digit of the binary data occurs, Extracting a binary cluster consisting of binary numbers between the carry points and extracting a carry key corresponding to a binary number having a minimum size from binary numbers consisting of only 1 which causes a carry down event for the binary cluster, Extracting the binary cluster, extracting the carry key, and subtracting the carry key are repeatedly performed a predetermined number of times, and the basic compression process is repeatedly performed a predetermined number of times For one binary number, Performing the basic compression process repeatedly a predetermined number of times based on a new carry point set by moving the point to the previous position and moving the carry point to the previous position until the carry down event does not occur for the first time A compression operation unit that repeatedly performs the basic compression process on the basis of each of the carry points; And
And a transmitting unit for transmitting the data on the binary number that has been compressed by the compression calculating unit to the destination device. 2. The image processing apparatus according to claim 1,
A first cluster extracting unit for extracting the binary cluster from the binary data;
A first carry key extracting unit for extracting the carry key causing the carry down event for the binary cluster extracted by the first cluster extracting unit;
A carry-down operation unit for performing an operation of subtracting the carry key extracted from the first carry key extracting unit from a binary number;
A first number counter for counting the number of basic compression processes including extraction of a binary cluster by the first cluster extraction unit, extraction of a carry key by the first carry key extraction unit, and calculation by the carry down calculation unit;
A first carry point recognizing unit for calculating extraction and movement of the carry point;
A first period counter for counting a moving period of the carry point; And
And a carry carry-down operation merging unit for attaching the bits without any change other than the calculation result of the carry-down event by the carry-down operation unit. 2. The image processing apparatus according to claim 1,
In order to transfer the carry point position data immediately before the end of compression by the transmission unit, all the "1" s of higher order bits than the carry point immediately before the compression end are transferred from the finally compressed binary data to "0" Device. 2. The apparatus of claim 1,
And transmits the data on the number of repetitions in the cycle and the number of repetitions immediately before the end of compression in the final cycle to the destination device together with the binary number finally compressed by the compression calculation unit. A carry up event for receiving compressed binary data from the binary data compression device according to any one of claims 1 to 4 and for incrementing the number from the back position to the top position in the compressed binary number Extracting a binary cluster consisting of a binary number between 10 and a carry point positioned at a higher bit with respect to a carry point which is a possible start bit, 1, extracting a carry key corresponding to a binary number having a minimum size, adding the carry key to the compressed binary number, extracting the binary cluster, extracting the carry key, and adding the carry key The basic decompression process is repeatedly performed a predetermined number of times Performing the basic decompression process repeatedly a predetermined number of times based on a new carry point set by moving the carry point to a previous position for a binary number obtained by repeatedly performing the basic decompression process a predetermined number of times, A decompression operation unit for repeatedly performing the basic decompression process by a predetermined number of times based on each of the carry points by performing the process of moving the carry point to a previous position by a predetermined period; And
And an output unit for outputting binary data decompressed by the decompression operation unit. 6. The apparatus of claim 5, further comprising a receiver for transmitting to the decompression computation unit data on a predetermined number of repetitions within a period and a repetition number immediately before the end of compression in the final period together with the compressed binary number, Decompression device. 6. The information processing apparatus according to claim 5,
A second cluster extracting unit for extracting the binary cluster from the compressed binary number;
A second carry key extracting unit for extracting the carry key causing the carry-up event for the binary cluster extracted by the second cluster extracting unit;
A carry-up operation unit for performing an operation of adding a carry key extracted from the second carry key extracting unit to a binary number;
A second number counter for counting the number of basic decompression processes, which include extraction of a binary cluster by the second cluster extraction unit, extraction of a carry key by the second carry key extraction unit, and calculation by the carry-up operation unit;
A second carry point recognizing unit for calculating extraction and movement of the carry point;
A second period counter for counting a moving period of the carry point; And
And a non-carry-up operation merging unit for directly attaching bits having no change other than the operation result of the carry-up event by the carry-up operation unit. 6. The information processing apparatus according to claim 5,
In order to obtain the carry point position immediately before the end of compression, the position of the first encounter "1" in the process of shifting from the most significant bit to the least significant bit in the compressed binary number is set to the carry point position immediately before the end of compression, And &quot; 0 &quot; of a higher order bit to &quot; 1 &quot;. 10, which is located at a higher bit with respect to a carry point which is a start bit at which a carry down event that borrows a digit from the upper position for subtraction from the binary digit of the binary data occurs, Extracting binary clusters composed of binary numbers between carry points by a compression calculation unit;
Extracting, by the compression operation unit, a carry key corresponding to a binary number having a minimum size out of binary numbers consisting of only 1 that causes the carry-down event for the binary cluster;
Subtracting the carry key from the binary number of the binary data by the compression operation unit;
Performing a basic compression step including a step of extracting the binary cluster, a step of extracting the carry key, and a step of subtracting the carry key by the compression operation unit by a predetermined number of times;
The basic compression step is repeatedly performed by a predetermined number of times based on a new carry point set by shifting the carry point to a previous position for a binary number obtained by repeating the basic compression step by a predetermined number of times by the compression operation unit step; And
Performing the basic compression step repeatedly based on each of the carry points by performing the process of moving the carry point to the previous position by the compression operation unit until the carry down event does not occur for the first time , A method of binary data compression. 10. The data compression method according to claim 9, wherein in order to transmit the carry point position data immediately before the end of compression by the transmission unit, all of the upper bits &quot; 1 &quot;Quot; 0 &quot; and transmitting the binary data. 10. The method according to claim 9, wherein the transmitter transmits a predetermined number of repetitions within the period and a repetition number immediately before the end of compression in the final period, together with the compressed binary number obtained by finishing all the steps, to the destination apparatus &Lt; / RTI &gt; further comprising the steps of: A method for compressing binary data by a binary data compression method according to any one of claims 9 to 11, the method comprising: receiving a carry-up event for incrementing a digit from a back position to an upper position in a compressed binary number Extracting, by a decompression operation unit, binary clusters each consisting of a binary number between 10 and a carry point located at higher order bits based on a carry point which is a start bit that can be generated by the decompression operation unit;
Extracting, by the decompression computation unit, a carry key corresponding to a binary number having a minimum size out of binary numbers consisting of only 1 that causes the carry-up event for the binary cluster;
Adding the carry key to the compressed binary number by the decompression operation unit;
Performing a basic decompression step including a step of extracting the binary cluster, a step of extracting the carry key, and a step of adding the carry key by the decompression operation unit by a predetermined number of times;
The basic decompression step is repeatedly performed for a predetermined number of times by the decompression operation unit, and the basic decompression step is repeatedly performed a predetermined number of times based on the new carry point set by moving the carry point to the previous position ; And
And performing the basic decompression step by a predetermined number of times based on each of the carry points by performing the process of moving the carry point to the previous position by the decompression operation unit by a predetermined period. How to release. 13. The method according to claim 12, wherein, in order to obtain the carry point position immediately before the end of compression, the position of "1" which is first encountered in the process of moving from the most significant bit to the least significant bit in the compressed binary number, And changing the &quot; 0 &quot; of higher order bits to a position of &quot; 1 &quot; than the position of the &quot; 1 &quot;. 13. The method of claim 12, further comprising transmitting, by the receiving unit, the decompression calculation unit, with the compressed binary number, a predetermined number of repetitions within a period and a repetition number immediately before the end of compression in the final period. How to decompress binary data.

Images