KR20160065432A - Binary data compression and decompression apparatus and method thereof - Google Patents

Abstract

The present invention relates to a device for compressing/decompressing binary data, comprising: a compression calculation unit extracting an initial general cluster, acquiring a compression cluster by eliminating a carry key, separately obtaining the compression cluster by consecutively moving from a rear portion of the general cluster to a front portion of the general cluster, and acquiring the compression cluster with regard to a head binary cluster; and a transmission unit consecutively transmitting the compression cluster, consecutively acquired by the compression calculation unit, to an object device. According to the present invention, reliability of a compression/decompression result value may be improved and actual binary data transmission traffic may be substantially reduced.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a binary data compression and decompression apparatus and method using a phase change of a clock signal and a signal level range information,

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.

In order to achieve the above object, according to an aspect of the present invention, there is provided a method of extracting a first general cluster consisting of 10 and a binary number located first after moving from a back position to a front position in binary data, Subtracting a carry key corresponding to a binary number having a minimum size from a binary number consisting of only 1 that causes a carry down event to borrow a number from the top to subtract from the cluster to obtain a compression cluster, Moving from the first general cluster to the first cluster sequentially moves from back to forth with respect to all the generic clusters consisting of a binary number between 10 and 10 that have been encountered and a binary number containing 10 that is currently encountered, each Deukhago, for a final general cluster in the binary data, a compression unit for acquiring the compressed cluster with respect to the rest of the binary number binary cluster head (head binary cluster) including a position in front; And a transmission unit sequentially transmitting the compressed clusters sequentially obtained by the compression calculation unit to a target device.

Wherein the compression operation unit is operable to generate, from the general cluster or the head binary cluster, a second result value obtained by first subtracting a carry key of a minimum size causing the carry down event from a second And if the first result value can not cause the carry-down event any more , convert all of the ones constituting the first result value to a number of digits equal to the number of digits in the first result value, And a signal bit for identifying the case where the binary data starts with 0 and the case where the binary data starts with 1 can be transmitted by the transmission unit.

Wherein the compression operation unit comprises: a compression identification unit for identifying the general cluster and the head binary cluster from the binary data; A primary carry down operation unit for obtaining the first result value by operation from the general cluster and the head binary cluster identified by the compression identification unit; A secondary carry-down operation unit for obtaining the compressed cluster as the second result value by the carry-down event operation or the conversion to O from the first resultant value obtained by the primary carry-down operation unit; And a compression transmission unit for sequentially transmitting the compressed clusters acquired by the secondary carry-down operation unit to the transmission unit, and transmitting the signal bits by the transmission unit .

According to another aspect of the present invention, there is provided a binary data compression apparatus comprising: a binary data compression unit for generating a carry up event for incrementing a number of bits in a compression cluster sequentially received from the binary data compression apparatus, A decompression computation unit for acquiring a general cluster and a head binary cluster, respectively, And a memory unit for sequentially arranging and storing the general cluster and the head binary cluster sequentially obtained by the decompression operation unit.

Wherein the decompression arithmetic operation unit adds a fourth result value obtained by adding a carriage key of a minimum size that causes the carry-up event to the third result value, Cluster, or the head binary cluster, and when the compression cluster is composed of only 0, it is converted into 1, which is the same as the number of digits of O, as the third result value, and when the binary data starts with 0 and 1 , And when the first bit of the head binary cluster is 0 through the signal bit, it can be converted into 0 via the signal bit.

Wherein the decompression calculation unit comprises: a decompression identification unit for sequentially identifying the compression clusters; A first order carry operation unit for obtaining the third result value from the compression cluster identified by the decompression identification unit by the carry-up event operation or the conversion to 1; A secondary carry operation unit for obtaining the general cluster and the head binary cluster as the fourth result value by the carry-up event operation from the third result value obtained by the primary carry-up operation unit; And a decompression transmission unit for sequentially transmitting the general cluster and the head binary cluster obtained by the secondary carry-up operation unit to the memory unit, wherein the decompression identification unit receives the signal bit, If the first bit of the head binary cluster is 0 through a bit, it can be converted into a bit and transmitted by the decompressing transmission unit.

According to another aspect of the present invention, there is provided a method for extracting a first general cluster consisting of binary data 10 and a binary data which are first encountered while moving from a back position to a front position in binary data, Obtaining a compressed cluster by a compression operation unit by subtracting a carry key corresponding to a binary number having a minimum size from a binary number consisting of only 1 causing a carry down event to borrow a number; Transmitting a compressed cluster obtained by the compression calculation unit to a destination apparatus by a transmission unit; While moving in the binary data by the binary number and order from back to front with respect to all the general cluster composed of a binary number containing 10 currently met between 10 ran to 10 and just prior to see while moving in the front seat from the first general cluster acquisition of the compressed cluster And repeatedly performing transmission of the compressed cluster; And comprising to perform the final case of the general cluster, the front of which comprises the rest of the binary number which is located the head binary cluster acquisition of the compressed cluster for (head binary cluster) and transmission of the compressed cluster in the binary data A binary data compression method is provided.

Wherein the step of acquiring the compressed cluster further includes a step of, by the compression operation unit, generating, from the general cluster or the head binary cluster, a first result obtained by first subtracting a carry key of a minimum size causing the carry- And if the first result value can not cause the carry-down event to occur any more, then all the ones constituting the first result value are acquired as the first cluster value, And a signal bit for identifying the case where the binary data starts with 0 and the case where the binary data starts with 1 can be transmitted by the transmission unit.

According to another aspect of the present invention, there is provided a data compression method comprising: receiving a compression cluster sequentially transmitted by the binary data compression method and generating a carry up event for incrementing a number to the top of the compression cluster; Adding a carry key corresponding to a binary number having a minimum size among the binary numbers consisting of only the binary number to each of the general cluster and the head binary cluster by the decompression operation unit; And a step of successively arranging the general cluster and the head binary cluster sequentially obtained by the decompression operation unit and storing the general cluster and the head binary cluster in a memory unit.

Wherein the step of acquiring the general cluster and the head binary cluster further includes a step of, by the decompression computing unit, repeatedly transmitting the carry-up event to the third result value obtained by firstly adding a minimum-size carry key causing the carry- wherein the causing the fourth result value obtained by adding a carry key, the smallest second drive, but obtained as the general cluster or the head binary cluster, if the compression cluster is only made to 0, it is converted into one of the same number of digits and number of digits to the right of O and the third And receives a signal bit for identifying the case where the binary data starts with 0 and the case where it starts with 1, and when the first bit of the head binary cluster is 0 through the signal bit, can do.

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 configuration 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 extracts the first general cluster consisting of the first 10 and subsequent binary numbers moving from the back position to the front position in the binary data, and extracts a number from the top position for subtraction from the first general cluster Subtracting a carry key corresponding to a binary number having a minimum size from a binary number consisting of only 1 that causes a carry down event to obtain a compression cluster and moving from the first general cluster to the first binary data in the binary data with respect to meeting 10 and just before all general clusters (general cluster) made of a binary number including a binary number and the currently met 10 between 10 met in while moving forward in sequence behind obtain a compression cluster, respectively, and a final general cluster in the binary data In the case of , And a head binary cluster including the remaining binary numbers ("1") located in front. Also, the compression operation unit 120 may make the final general cluster a head binary cluster if the final 10 bits are the leftmost bits.

For example, in a binary number of 101011101011, 10/1011/10/1011 can be divided into binary clusters. On the right side, three clusters are general binary clusters and the head side is a head binary cluster. It can also have a generic cluster type. Of course, another "0" before "10" can never exist at this time. Or 110101010101, there may be one or more consecutive " 1 " s preceded by " 10 " such as 110 as in the case of the first head binary cluster such as 110/10/10/10 / Of course, another "0" before "10" can never exist.

The compression computation unit 120 computes a second result value obtained by subtracting, from the general cluster or the head binary cluster, the first result value obtained by first subtracting the carry key of the minimum size causing the carry down event, For example, if the head binary cluster was 100, and if the first result value is changed to 11 after the first carry-down event, if the first result value can not cause a carry-down event any more , All 1s constituting the first resultant value can be converted into 0, which is the same number of digits as the number of digits of the first resultant value, and can be obtained as a compressed cluster, thereby replacing the second carry-down event operation Is changed to 00), binary data starts with 0 and starts with 1 It can be transmitted by a signaling bit to the transmitter-specific (130).

On the other hand, when generating compressed binary clusters, it is not essential in the present invention in the process of generating compressed binary clusters over the second order. The first resultant value is sufficiently effective for compression, and after the first resultant value is transmitted from the transmitting unit to the receiving unit as the final compressed binary cluster, the original data can be recovered through the single decompression operation also in the compression operation canceling unit. However, the compression effect itself may be smaller than the second compression compressed binary cluster up to the second result value.

The compression computation unit 120 includes a compression identification unit 121 for identifying a general cluster and a head binary cluster from binary data, and a compression / decompression unit 121 for computing, from a binary cluster and a head binary cluster identified by the compression identification unit 121, A first carry-down arithmetic operation unit 122 for obtaining a result value, and a second carry-down operation unit 122 for obtaining a compression cluster as a second result value from the first result value obtained by the first carry-down operation unit 122 by a carry- A compression transfer unit 124 for sequentially transmitting the compressed clusters obtained by the secondary carry-down calculation unit 123 and the compression cluster obtained by the secondary carry-down calculation unit 123 to the transmission unit 130 and transmitting the signal bits by the transmission unit, ). The compression operation unit 120 may further include a control unit (not shown) for control according to compression, and may further include a memory unit (not shown) for storing programs and data necessary for driving.

The transmission unit 130 transmits the compressed clusters sequentially obtained by the compression calculation unit 120 to a target device such as the binary data decompression device 200 or a process device or a memory device requiring other compressed data Sequentially. 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.

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, a binary data decompression apparatus 200 according to the present invention decompresses a compressed cluster sequentially transmitted by the binary data decompression apparatus 100 according to the present invention, And may include a decompression arithmetic operation unit 220 and a memory unit 230.

The decompression arithmetic operation unit 220 generates a carry up event for incrementing a number in the compression cluster sequentially received from the binary data compression apparatus 100, To obtain a general cluster and a head binary cluster, respectively.

The decompression arithmetic operation unit 220 outputs a fourth result value obtained by adding a carriage of the minimum size that causes a carry-up event to the third result value, which is a first-order addition of the carry-key event, When the compression cluster is composed of only 0 in the primary decompression operation or in the secondary decompression operation, it is converted into 1, which is the same number as the number of digits of O, to obtain as the third result value, and the binary data The signal bit for identifying the case where the first bit of the head binary cluster is 0 and the case of beginning of 1 can be received and converted to 0 when the first bit of the head binary cluster is 0 through the signal bit.

In the meantime, the concept of signal bits and head binary clusters can make the invention cumbersome. Therefore, the most significant bits of binary data are preceded by "10", "101", "1000", "10111" "And one binary cluster consisting of one or more consecutive" 0s " and zero or more consecutive "1s " is selected and forcedly added, the head binary cluster will not occur and all of the binary clusters are divided into general binary clusters The compressed clusters can be generated and transmitted. On the other hand, if the bit value constituting the binary cluster is selected, the original data can be completely recovered from among the most significant bits in the streaming data decompressed by the decompression computation unit of the receiving unit.

The decompression arithmetic unit 220 includes a decompression identification unit 221 for sequentially identifying the compression clusters, a compression / decompression unit 221 for extracting compressed clusters from the compression clusters identified by the decompression identification unit 221, A primary carry-up operation unit 222 that obtains a result of the carry-up operation from the first carry-up operation unit 222 and a third result value obtained by the primary carry-up operation unit 222 A secondary carry-up operation unit 223 and a decompression transfer unit 224 for sequentially transmitting the general cluster and the head binary cluster obtained by the secondary carry-up operation unit 223 to the memory unit 230 The decompression identification unit 221 receives the signal bit, and when the first bit of the head binary cluster is 0 through the signal bit, it is converted into 0, Lt; RTI ID = 0.0 & gt ; 224 & lt ; / RTI & gt ; Further, the decompression arithmetic operation unit 220 may further include a control unit (not shown) for controlling the decompression operation. Further, the decompression arithmetic operation unit 220 may use the memory unit 230 or a separate memory And the like.

The memory unit 230 temporarily or permanently stores the generic clusters and the head binary clusters successively obtained by the decompression computing unit 220 in a sequential manner. The memory unit 230 may be formed as a single unit with the decompression unit 220, And may be performed separately from the release operation unit 220. The memory unit 230 may also serve as a buffer for temporarily storing the compression clusters received by the reception unit 210 and providing the decompression calculation unit 220 to decompress.

The binary data decompression apparatus 200 according to the present invention receives data for a compression cluster from the transmission unit 130 of the binary data compression apparatus 100 by wire or wireless and transmits the data to the decompression identification unit 221, And may further include a receiving unit 210 including a wire, a cable, or a wireless communication module.

The general cluster, the head binary cluster, the carry key, the carry down event, the carry-up event, and the like described above will be described in detail, and both the binary data compression method and the binary data decompression method will be described later.

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. This separation is done by shifting one bit forward from the farthest backwards, separating two 10 bits at a time. At this time, the first 100 is the head binary cluster. On the other hand, a head binary cluster needs to include one 10, which is the same as a general cluster, but unlike a general cluster, there may be a plurality of 1s in succession. Of course, depending on the binary data of the original data, one may not come in consecutively. In this case, the head binary cluster will have the same form as the general binary cluster.

The method of binding clusters may be performed by the compression identification unit 121. For example, if a bit is scanned while moving from the last binary number to the previous binary number, 10 ", in particular the position before" 1 "), find the next 10 leading positions (especially the position of" 1 "), and then use the binary numbers between these two 10s to determine the cluster Can be performed in a bundling manner. However, when the first 10 is encountered, it is obvious that the binary number between the position of " 1 " and the first bit will be the first general cluster. For example, in the case of 101011, 10/1011 means that 1011 general cluster, "10" is the first one, so it means "1011" by grouping binary numbers up to the first digit. It is obvious that "10" is a head binary cluster.

For example, as shown in Table 1 below, in the case of 11010, scanning from E bit to A bit, finding the E bit from the D bit where 10 first appears, making D ~ E successively the first general cluster, and D -1, that is first encountered in the 10 is moved to the left from the position C back to B bits can be called again for the second general cluster B ~ C. However , at this time, since there are no more 10 to the B-1 position, i.e., the A position, it can be defined that the second general cluster including all 1s to the B-1 position, that is, the A position becomes the head binary cluster (A to C) have.

A B C D E One One 0 One 0

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, there are various kinds of carry key considering the efficiency of compression. However, according to the size of the carry key generating the carry down event and the carry up event, the total number of bits whose values change before and after the operation differs, which is called a 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. You can also use the carry key 11 to raise a carry-up event, the result is 10101. It is also possible to generate a carry-up event using the carry key 11 for the same 10010, the result being 10101. This same binary number can cause both a carry-up event and a carry-down event, depending on whether the carry key is added or subtracted.

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 the carry-up event and the carry-down event, an important factor in the present invention is the absolute size of the entropy. In decompression or compression, a carry key that causes less change in entropy according to clusters is selected and compressed or decompressed. Select the carry-up event for the compacted presentation, but select the key with the smallest entropy at the carry-up event.

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

As shown in FIG. 2, the binary data compression method according to the present invention extracts a first general cluster consisting of 10 and a binary number located next to the first while moving from a back position to a front position in binary data, Subtracting a carry key corresponding to a binary number having a minimum size from among binary numbers consisting of only 1 that causes a carry down event to borrow a number from the top for subtraction from the cluster, (S12) of transmitting the compressed cluster acquired by the compression computation unit 120 to the destination apparatus by the transmission unit 130, and shifting the binary data from the first general cluster to the first position And the binary number between 10 that we met before and 10 that we met now Eojineun to perform the determination when (S13), transmission (S12) of all with respect to the general cluster while moving forward in sequence behind the acquisition of the compressed cluster (S11) and the compressed cluster, wherein the binary data to be used by other general clusters present in an iterative In the case of the final general cluster in the binary data, the acquisition of the compressed cluster S11 and the transmission of the compressed cluster S12 are performed for the head binary cluster including the remaining binary numbers located in front of the binary cluster (Step S14).

The step S11 of acquiring a compressed cluster is a step of acquiring a minimum value of a carry-down event that causes a carry-down event to occur again to a first result value obtained by first subtracting a carry-down event of a minimum size from a general cluster or a head- The second result value obtained by subtracting the carry key of the size from the second result value is obtained as the compression cluster, and when the first result value can not cause the carry down event any more , all the ones constituting the first result value are equal to the number of digits of the first result value The binary result is replaced with a signal bit for identifying the case where the binary data starts with 0 and the case where the binary data starts with 1 by the transmitting unit 130 It can be transmitted.

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 acquiring a general cluster and a head binary cluster from a compression cluster sequentially transmitted by the binary data compression method according to the present invention. A carry key corresponding to a binary number having a minimum size among the binary numbers consisting of only 1 which causes a carry up event in which a number is raised to the top position for addition in a compression cluster sequentially transmitted by the binary data compression method according to the present invention, (S21) of obtaining a general cluster and a head binary cluster by a decompression arithmetic unit 220, a general cluster and a head binary cluster sequentially obtained by the decompression arithmetic unit 220, 230), and the step (S22) May be repeatedly performed until the final compressed cluster is received by the receiving unit 210 (S23).

In step S21 of acquiring the general cluster and the head binary cluster, the decompression arithmetic unit 220 performs a carry-up event on the third result value obtained by first adding the minimum size carry key causing the carry-up event from the compression cluster but obtaining causing the fourth results 2 obtained by adding drive a carry key of the minimum size as a general cluster or head binary cluster, if the compression cluster is only made to 0, is converted into one of the same number of digits and number of digits to the right of O to obtain a third result value , Receives a signal bit for identifying whether the binary data starts with 0 or starts with 1, and converts the signal bit to 0 when the first bit of the head binary cluster is 0 through the signal bit.

In the case of a binary number 100101011101010101001101010, a binary cluster, that is, a head binary cluster and a general cluster can be divided. In a binary data compression method and a binary data decompression method according to the present invention, Moving forward, when the first 10 types come out, the clusters are partitioned. Therefore, the above binary numbers can be divided into 100/10/1011/10/10/10/10/1001/10/10/10. The first cluster is a head binary cluster and the other is a general cluster do. The carry-down event is generated by a carry key of the minimum size for each of the divided binary clusters.

In the case of 100/10/1011/10/10/10/10/100/10/10/10, the minimum size carry key causing the carry- 1/1/1/1/1/1/110/1/1/1 when these carry keys are subtracted from the binary clusters.

Next, a carry down event is generated once again in the currently classified binary cluster. If the carry-down event can not be generated again with the carry key as in the case of the binary cluster such as 11, the carry down event is converted to 00. Therefore, when the secondary carry down event is generated, it is expressed as 00/0/11/0/0/0/0/101/0/0/0. Thus, the original binary data of 27 bits is compressed into 15 bits of information while forming 11 binary clusters. In this case, it is assumed that the transmitting unit is divided into clusters, and 11 binary clusters are known during the transmission process.

A method for transferring the converted information from a source device having original data to a destination device for storing target data in units of binary clusters through a wired or wireless network device or a data transmission device, , The data is transmitted to the destination apparatus in units of bits per binary cluster, and the receiving unit 210 transmits the received data to the decompression arithmetic unit 220 using the minimum size carry key to perform two consecutive carry-up events It can be decompressed into the original binary data and stored in the memory unit 230. At this time, when the original data received by the decompression arithmetic operation unit 220 is 0, 00, 000, the carry-up event is not applied automatically, and the first data is automatically converted into 1, 11, Up event.

The above procedure is carried out for binary clusters of all original binary data at 1: 1, and data is transmitted.

If such a method is applied, the transmitting unit 130 converts the carry-down event by using the twice-consecutive data and the zero exception process, and transmits a much smaller amount of data than the original binary data to the receiving unit 210, The receiving unit 210 finally converts the original binary data into the original data using the zero exception process and the carry-up event, and returns the original binary data to the original data. Therefore, substantial traffic of data transmission can be remarkably reduced.

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.

The present invention is not a method of attaching all the compression clusters as they are and transferring the compression clusters to the receiving unit at once, but instead of generating compression binary clusters from the original data, sequentially compressing binary clusters from the memory of the transmission unit 130 side The receiving unit 210 transmits the data to the receiving unit 210. On receiving the data, the receiving unit 210 decompresses the data through the carry-up calculation as soon as the receiving unit 210 receives the data, and stores the data in the memory unit 230. Then, And then the original data is correctly recovered through the process of attaching the compressed data to the receiver.

For example, in order to transmit 100 balls with a full airflow from the A (transmitting side) to the B side (receiving side), first, in A, after subtracting the wind of each ball, To B, and B restores the original ball through the process of filling the wind of the wind with the wind.

Such a sequential transmission scheme can be implemented in various ways.

For example, under a communication environment in which a binary data compression apparatus transmits a combined compressed cluster through a plurality of transmission channels, the decompression apparatus may independently or separately transmit Each of the combined compressed clusters must be received and decompressed. In this case, therefore, a separate identifier is not required,

A combination of two types of modulation and demodulation of physical waves can be used. In one method, a cluster type can be transmitted in a different manner, or a transmission method in which data in a cluster is classified. Alternatively, a physical transmission energy or a transmission voltage / The difference between the clusters and the clusters in the clusters can be determined by the difference of the currents.

Alternatively, each compression cluster may be encoded and transmitted according to a known algorithm according to the type of the compression cluster, or may be transmitted by mapping each compression cluster to a universal code

On the other hand, there are many ways in which such compressed binary clusters can be transmitted using a physical communication network.

For example, in a variety of communication systems, a clock signal and a data signal are transmitted together. In a clock signal, a normal clock is transmitted together with data as shown below so that data can be transmitted without errors in transmission and reception of data with various devices.

By achieving the purpose of the clock signal through the phase modulation of the clock signal transmitted in the "same phase" and distinguishing each of the binary clusters, a separate clock or a separate transmission signal is added to separate each cluster I do not want to. A clock signal (English: clock signal) refers to a square wave signal in which the logic states H (high, logic 1) and L (low, logic 0) appear periodically.

In many cases, digital circuits in electronics are used for synchronous processing to process signals in response to clock signals. The clock is necessary at the flip flop of the sequential circuit. Even though several flop flops operate asynchronous clocks, clock input is required. As the logic circuit becomes larger, it needs several clocks, so it operates with synchronous and asynchronous design. In larger circuits such as FPGAs, clock signals may be specified separately [1] A separate clock input is determined, and a dedicated signal line exists in each logic module through a clock network from the inside.

The elements of the clock signal are: the magnitude of the signal, the frequency that determines the period, and the duty ratio, which is the time ratio of states H and L for one period.

Since the clock signal is often used in digital circuits, the magnitude of the signal appears as a voltage. In digital circuits, the voltage is usually designed to be equal to the voltage of the logic gate. Normally, the reference voltage condition is 0 V (ground) to L state and Vcc to H state. H depends on logic gates such as 5V and 3.3V and is fixed at the first chip design. Although 5V was used initially, it tends to be lowered to 3.3V.

Frequency is usually determined by digital circuit design requirements. A digital circuit with a large scale usually requires various frequencies, and it is used by frequency conversion by an internal counter circuit. Therefore, the fastest frequency needed is created and distributed with a crystal oscillator. When the oscillation frequency of the crystal oscillator is faster than the oscillation frequency of the crystal oscillator, a high frequency is oscillated in the chip through a circuit configuration of a PLL circuit.

In the clock signal, a square wave with a duty ratio of 50%, which is the time ratio of H and L, is used for one cycle. The point at which the signal is reflected in the digital circuit is often made at a short time when the state of the signal changes. It often operates at the rising edge, which is the moment when the state changes from L to H, or the falling edge, which changes from H to L. [ Flip-flop is input on the rising or falling edge is reflected in the output. Usually a microprocessor uses a duty ratio of 50%, but in some cases it is not 50%:

Duty ratio 50%, single-phase clock: Z80 [2], 8085, 8051

Duty ratio 50% similar, two-phase clock: 6809 [3]

In the present invention, a method of transmitting a data signal in binary in transmitting a secondary compression cluster, and transmitting a division (/) between secondary compression binary clusters using a phase change of a clock signal will be described. As shown in the figure below, the clock signal is normally synchronized at the rising edge or falling edge as shown below,

In the present invention, the phase of the clock signal is not generated in the same manner as described below,

As shown in the figure below, the clock signal can be generated by modulating the phase of the clock so that the rising edge and the falling edge are repeated variously. If the edge is recognized only once in the corresponding T with the duty ratio being constant, the kind of the edge can be recognized every T intervals.

If the state of the edge is recognized by recognizing the change of the edge at intervals of T, it is possible to know that the type of the secondary compression cluster is classified, and if not, the data is transmitted in the same secondary compression cluster. Below you can see the outline.

As shown in the above figure, the clustered contents are shown according to the classification of the edge state.

Therefore, the transmission speed and the compression transmission efficiency can be expected by effectively transmitting to the secondary compression cluster of the present invention through the phase change of the clock transmission signal.

On the other hand, when considering the communication signal level,

In the case of RS232C signal, the noise margin reaches 10V as shown below, and it is strong against noise because it has the area where the SPACE area and MARK area are equal and wide. For example, in the case of RS-232C signals, Space and Mark are allocated to areas of +15 to -5, +5 to -5, and -5 to -15 V, respectively, and an No- Since the binary cluster noise margin becomes zero or very narrow using the margin section information, there is a high possibility that an error occurs in transmission. However, according to the present invention, it is possible to transmit binary identification information between binary clusters when a range indicating interval information between binary clusters is allocated to a range of noise margin of + 5V to -5V interval . Accordingly, the secondary compression cluster information of the present invention can be transmitted by allocating a range for dividing the communication signal level to a binary cluster. It is to be noted that the area to be allocated to the signal level interval is determined in various ways according to the characteristics of each signaling method, and the present invention can be used to select an appropriate area from among these areas and to use it for the purpose of distinguishing between binary clusters. For example, if three compressed binary clusters of 00/0/11 are transmitted, the signal levels are transmitted as follows, but the interval between the binary clusters In this case, the noise margin may be reduced by that much, which may be somewhat weakened by the error. However, considering the compression effect, the cost / effect analysis can be used to determine whether or not to apply it. In particular, when the original cluster is equal to "101 ", the primary compression cluster becomes" 10 ", the secondary compression cluster becomes "1" There is an effect that one bit is reduced in a net.

(+ 5 to + 15) (+ 5-15) (+5 to -5) (+ 5 to + 15) (+ 5 to -15) (-5 to -15) (-5 to -15)

1,2: External device 110: Receiver
120: compression operation unit 121: compression identification unit
122: Primary carry down operation unit 123: Secondary carry down operation unit
124: compression transmission unit 130: transmission unit
210: Receiving unit 220:
221: decompression identification unit 222: primary carry-up operation unit
223: secondary carry-up operation unit 224: decompression transfer unit
230: memory unit

Claims (10)

In binary data, subtracting the carry key corresponding to the minimum number of binary digits from the binary number consisting of only 1 that carries a carry down event that borrows a number from the top for subtraction from the general cluster, The binary clusters sequentially acquire the compressed clusters from back to forth in the binary data, and in the case of the final general cluster in the binary data, the head binary clusters including the remaining binary numbers located in front of the general clusters a compression operation unit for obtaining the compressed cluster with respect to a head binary cluster; And
And a transmission unit that sequentially transmits the compressed clusters sequentially acquired by the compression calculation unit to a destination device. 2. The image processing apparatus according to claim 1,
And a first result value obtained by subtracting a carry key of a minimum size that causes the carry down event from the general cluster or the head binary cluster as a first cluster is obtained as the compressed cluster. 3. The image processing apparatus according to claim 2,
A compression identification unit for identifying the general cluster and the head binary cluster from the binary data;
A primary carry down operation unit for obtaining the first result value by operation from the general cluster and the head binary cluster identified by the compression identification unit;
And
And sequentially transmits the compression clusters acquired by the primary carry-down operation unit to the transmission unit. A binary data compression apparatus as set forth in any one of claims 1 to 3, characterized by comprising: means for generating a carry-up event for incrementing a number to the top in order to add to a compression cluster sequentially received, A decompression arithmetic unit for acquiring a general cluster and a head binary cluster, respectively, by adding a carry key corresponding to a binary number having a binary number; And
And a memory unit for sequentially arranging and storing the general cluster and the head binary cluster sequentially obtained by the decompression calculation unit. 5. The image processing apparatus according to claim 4,
And a third result value obtained by first adding a minimum-size carry key that causes the carry-up event from the compressed cluster as the general cluster or the head binary cluster.
6. The information processing apparatus according to claim 5,
A decompression identification unit for sequentially identifying the compressed clusters;
A first order carry operation unit for obtaining the third result value from the compression cluster identified by the decompression identification unit by the carry-up event operation or the conversion to 1;
And
And a decompression transmission unit for sequentially and independently transmitting the general cluster and the head binary cluster obtained by the primary carry-up operation unit to the memory unit. A carry tree corresponding to a binary number having a minimum size among the binary numbers consisting of only one which extracts a general cluster from binary data and causes a carry down event to borrow a number from the top position for subtraction from the general cluster, Subtracting a carry key from the compressed cluster to obtain a compressed cluster;
Transmitting a compressed cluster obtained by the compression calculation unit to a destination apparatus by a transmission unit;
Repeatedly acquiring the compressed cluster and transmitting the compressed cluster successively back and forth to all the general clusters in the binary data; And
For the final General cluster in the binary data, with respect to the rest of the head binary cluster (head binary cluster) containing the binary which is located in front of which comprises to carry out the acquisition and transmission of the compressed cluster of the compression cluster, Binary data compression method. 8. The method of claim 7, wherein acquiring the compressed cluster further comprises:
Wherein the compression operation unit obtains, as the compression cluster, a first result value obtained by first subtracting a carry key of a minimum size causing the carry down event from the general cluster or the head binary cluster. A binary data compression method as set forth in claim 7 or 8, characterized by comprising the steps of: receiving a compression cluster sequentially transmitted and causing a carry up event to raise the number to the top position for addition to the compression cluster Adding a carry key corresponding to a binary number having a minimum size among binary numbers to obtain a general cluster and a head binary cluster by a decompression calculation unit, respectively; And
And sequentially storing the general cluster and the head binary cluster, which are successively obtained by the decompression operation unit, in a memory unit.
10. The method of claim 9, wherein acquiring the general cluster and the head binary cluster, respectively,
And a third result value obtained by firstly adding a minimum-size carry key causing the carry-up event from the compression cluster to the general cluster or the head binary cluster by the decompression calculation unit.

Images