KR101676420B1

KR101676420B1 - Data compression and restoration method and apparatus

Info

Publication number: KR101676420B1
Application number: KR1020150094078A
Authority: KR
Inventors: 김정훈
Original assignee: 김정훈
Priority date: 2015-07-01
Filing date: 2015-07-01
Publication date: 2016-11-15

Abstract

The present invention is characterized in that the compression unit divides the original binary data into a plurality of clusters, and divides the original binary data by 0 and 1 for each 01 included in the original binary data. A compression step of generating, for each of the plurality of clusters, a plurality of compression clusters by adding 1 after deleting 1 of the most significant bits of each cluster; And an outputting step of outputting the plurality of compressed clusters.

Description

DATA COMPRESSION AND RESTORATION METHOD AND APPARATUS [0001]

The present invention relates to a method and apparatus for compressing and restoring data, and more particularly, to a method and apparatus for compressing and restoring binary data efficiently and efficiently through simple computation and hardware configuration, And more particularly, to a method and apparatus for compressing and restoring data.

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

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

However, such a conventional compression method requires complicated processing of data compression and decompression, requires a relatively high-performance hardware device, limits the improvement of the processing speed, and increases the reliability of the compression result value there was.

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

According to an aspect of the present invention, there is provided an apparatus and method for compressing and restoring binary data quickly and efficiently through a simple operation and a hardware configuration, and also has excellent compression rate and reliability of compressed data and restored data And to provide a method and apparatus for compressing and restoring data that can improve transmission efficiency and speed in data transmission.

According to an aspect of the present invention, there is provided a method of dividing original binary data into a plurality of clusters, the method comprising: a division step of dividing the original binary data by 0 and 1 for each 01 included in the original binary data; The compression unit deletes 1 of the most significant bits of each cluster for each of the plurality of clusters and then adds 1 to generate a plurality of compression clusters or deletes 1 of the most significant bits of each cluster for each of the plurality of clusters A compression step of generating a plurality of compressed clusters; And an outputting step of outputting the plurality of compressed clusters.

In the present invention, the compression unit further includes a conversion step of converting 1 and 0 included in each compression cluster into a first transition pattern and a second transition pattern, each having a transition pattern of mutually different potentials, And outputting the compressed cluster converted by the step.

In the present invention, in the conversion step, the compression unit adds a pauses between neighboring compression clusters.

In the present invention, the transition pattern is a transition between a first potential of a positive potential and a second potential of a negative potential, the first transition pattern being a transition from the first potential to the second potential, A pattern that transitions from the second potential to the first potential; Or the first transition pattern is a pattern of transition from the second potential to the first potential and the second transition pattern is a pattern of transitioning from the first potential to the second potential.

In the present invention, the idle period is characterized in that a period of a specific potential is maintained for a predetermined period.

In the present invention, before the dividing step, the compressing unit further comprises adding 1 to the most significant bit of the original binary data and 0 after the least significant bit.

According to another aspect of the present invention, there is provided a method of generating binary data, the method comprising: dividing the original binary data into a plurality of clusters; The compressing step compresses each of the plurality of clusters to generate a plurality of compressed clusters; A conversion step of converting the 1 and 0 included in each compression cluster into a first transition pattern and a second transition pattern having a transition pattern having mutually different potentials; And outputting the compressed cluster converted by the output step in the converting step.

In the present invention, the rest period is characterized in that a section of a specific potential is maintained for a predetermined period.

According to another aspect of the present invention, there is provided a data restoration method for restoring binary data compressed by a data compression method.

According to another aspect of the present invention, there is provided a method of dividing original binary data into a plurality of clusters, each of which is divided into 0s and 1s by 01 included in the original binary data, A compression section for generating a plurality of compressed clusters by adding 1 after deleting 1 of the most significant bits of the plurality of clusters or deleting 1 of the most significant bits of each cluster for each of the plurality of clusters; And an output unit for outputting the plurality of compressed clusters.

In the present invention, the compression unit converts 1 and 0 included in each compression cluster into a first transition pattern and a second transition pattern having transition patterns with mutually different potentials, and the output unit outputs the converted compression clusters .

In the present invention, at the time of conversion into the first transition pattern and the second transition pattern, the compression section adds a rest period between neighboring compression clusters.

In the present invention, before the division of the original binary data, the compression unit adds 1 to the most significant bit of the original binary data and 0 after the least significant bit.

According to still another aspect of the present invention, there is provided a method of dividing original binary data into a plurality of clusters, compressing each of the plurality of clusters to generate a plurality of compressed clusters, 0 into a first transition pattern and a second transition pattern having mutually different potential transition patterns; And an output unit outputting the converted compressed clusters.

According to another aspect of the present invention, there is provided a data restoration apparatus for restoring binary data compressed by a data compression apparatus.

According to one aspect of the present invention, a method and apparatus for compressing and restoring data can quickly and efficiently compress and restore binary data through a simple operation and a hardware configuration, and also has excellent compression rate and reliability of compressed data and restored data The transmission efficiency and the speed of data transmission can be improved.

1 is a block diagram of a data compression apparatus and a decompression apparatus according to an embodiment of the present invention.
2 is a flowchart illustrating a data compression method according to an embodiment of the present invention.
3 is a flowchart illustrating a method of restoring data according to an embodiment of the present invention.
4 is a conceptual diagram for explaining conversion of a compression cluster into a signal of a transition pattern in this embodiment.

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

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

FIG. 1 is a block diagram of a data compression apparatus and a decompression apparatus according to an embodiment of the present invention. Referring to FIG. 1, an embodiment according to the present invention will be described below.

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

First, the compression unit 110 divides the original binary data into a plurality of clusters, and divides the original binary data by 0 and 1 for each 01 contained in the original binary data, and for each of the plurality of clusters, And then adds 1 to generate a plurality of compressed clusters. Here, before compression of the original binary data, the compression unit 110 may add 1 to the most significant bit of the original binary data and 0 after the least significant bit.

Also, for output through the output unit 120, the compression unit 110 converts 1 and 0 included in each compression cluster into a first transition pattern and a second transition pattern having a transition pattern of mutually different potentials . Wherein the transition pattern is a transition between a first potential of a positive potential and a second potential of a negative potential, the first transition pattern being a pattern that transitions from the first potential to the second potential and the second transition pattern is a transition from the first potential to the second potential To the first electric potential. The first transition pattern may be a pattern that transitions from the second potential to the first potential, and the second transition pattern may be a pattern that transitions from the first potential to the second potential.

At the same time, when the compression unit 110 converts into the first transition pattern and the second transition pattern, it is possible to identify each compression cluster in the restoration apparatus by adding a rest period between neighboring compression clusters. The rest period means that a section of a specific potential (for example, zero potential) is maintained for a certain period.

The output unit 120 outputs the converted compressed data generated by the compression unit 110 to a target device such as the data decompression apparatus 200 or the like.

1, the data decompression apparatus 200 according to the present embodiment includes an input unit 210 and a decompression unit 220. The input unit 210 receives the converted compressed data transmitted through the output unit 120 and transmits the received compressed data to the decompression unit 220. The restoring unit 220 restores the converted compressed data.

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

FIG. 2 is a flowchart for explaining a data compression method according to an embodiment of the present invention. FIG. 3 is a flowchart for explaining a data restoration method according to an embodiment of the present invention. A data compressing method and a restoring method according to the present embodiment will be described with reference to the concept of converting a compressed cluster into a signal of a transition pattern in the embodiment.

First, as shown in FIG. 2, the compression unit 110 adds 1 to the most significant bit of the original binary data and adds 0 to the least significant bit (S201). In other words, taking binary data 010010111001101100 as an example, 1 is added before the most significant bit of this binary data, 0 is added after the least significant bit

1 010010111001101100 0

Can be obtained.

Next, the compression unit 110 divides the obtained binary data into a plurality of clusters, and divides the obtained binary data by 0 and 1 for each "01" included in the binary data (S202). That is, in the above example

10/100/10/11100/110/11000

. As a result, it is possible to obtain a plurality of binary clusters each consisting of one or more 1s in the upper bit and one or more zeros in the lower bit.

Next, the compression unit 110 deletes 1 of the most significant bits of each of the plurality of clusters, and then adds 1 to generate a plurality of compressed clusters (S203). That is, since each of the plurality of clusters divided in the above-described manner includes all 1s in the most significant bit, the compression unit 110 deletes 1 in the most significant bit of each cluster, adds a binary number 1 to the result, Lt; / RTI > If the cluster is 1100, delete 1 of the most significant bit and add 1 to get 101 data. In the above example,

A plurality of compressed clusters such as 1/01/1/1101/11/1001 are generated. If you have more than one 0 on the most significant bit after compression, such as compressing 100 to 01, leave that 0 unchanged. That is, in the case of 10000, it is compressed to 0001.

On the other hand, the compression unit 110 may delete a 1 in the most significant bit of each cluster, and then generate a plurality of compressed clusters immediately without adding a binary number 1 to the resultant value. If the cluster is 1100, delete 1 of the most significant bit and get 100 data. In the above example,

A plurality of compressed clusters such as 0/00/0/1100/10/1000 are generated. Even if there is more than one 0 on the most significant bit after compression, such as compressing 100 to 00, leave that 0 unchanged. That is, in the case of 10000, it is compressed to 0000.

Next, the compression unit 110 converts 1 and 0 included in each compression cluster into a first transition pattern and a second transition pattern having different transition patterns between different potentials (S204). FIG. 4 is a conceptual diagram for explaining conversion of a compression cluster into a signal of a transition pattern in the present embodiment. The compression unit 110 converts each of the compressed clusters into a signal having a transition pattern as shown in FIG. 4, do. In the example shown in Fig. 4, a period (first transition pattern) transiting from a positive potential (+1) to a negative potential (-1) is made to correspond to 1 and a transition from a negative potential (Second transition pattern) is converted to correspond to zero. In FIG. 4, the period T of the A region corresponds to 1 since it is the first transition pattern that transits from the positive potential (+1) to the negative potential (-1). 4, the first period T of the B region is a second transition pattern that transits from the negative potential (-1) to the positive potential (+1), so that this period corresponds to 0, and the next period T) is a first transition pattern that transits from a positive potential (+1) to a negative potential (-1), so this interval corresponds to 1. Therefore, the B region corresponds to the compression cluster "01 ".

Meanwhile, in the transforming step S204, the compressing unit 110 may add a rest period between neighboring compression clusters. The idle period serves as a separator for identifying each of the plurality of compressed clusters, and corresponds to a period in which a zero potential is maintained during T / 2 between the A and B regions in FIG. By placing such a rest period, the restoration apparatus can identify each of the compressed clusters based on the rest period.

The idle period can be set to T / 2 as in the above embodiment, but can be variously determined according to the appointment between the transmitter and the receiver such as T / 4, T / 8, T / 16, Any interval that can be made can include any maintenance interval.

In the above embodiment, the first transition pattern is shifted from the positive potential (+1) to the negative potential (-1) and the second transition pattern is shifted from the negative potential (-1) to the positive potential (+1) , A transition from the positive potential (+1) to the negative potential (-1) may be referred to as a second transition pattern, and a transition from the negative potential (-1) to the positive potential (+1) may be referred to as a first transition pattern . In addition, the potential value may be different from +1, -1. Also, the potential of the resting period may be a potential other than 0 potential.

Next, the output unit 120 outputs the plurality of compressed clusters converted by the conversion step S204 to a destination apparatus such as the restoration apparatus 200 (S205).

The data compressing apparatus 100 may omit the conversion operation by the compressing unit 110 (that is, convert the compression cluster into a signal of a transition pattern) and output a plurality of compression clusters through the output unit 120 You may.

In addition, according to the embodiment, it is possible to omit the step (S201) of adding 1 and 0 before the most significant bit and the least significant bit of the original binary data, respectively, and perform the following steps. In this case, The MS 100 may perform compression only on the remaining clusters without performing compression on the most significant bit and the least significant bit portion of the plurality of clusters generated in the division step S202. Of course, in this case, no restoration process is performed on the uncompressed portion in the subsequent restoration step.

When the binary data is compressed and output through the above process, the data decompression apparatus 200 receives the converted plurality of compressed clusters through the input unit 210 and transfers the compressed clusters to the decompression unit 220. The decompression unit 220 Decodes the received plurality of compressed clusters to generate a plurality of compressed clusters (S301). That is, the decompression unit 220 decodes each of the transformed compressed clusters, that is, the transition pattern, through the process shown in FIG. 4, to generate a plurality of compressed clusters of binary numbers.

Next, the restoring unit 220 generates a plurality of restoration clusters by subtracting 1 from the most significant bits of the respective decoded compressed clusters, thereby generating a plurality of restoration clusters (S302).

Then, the restoring unit 220 combines the generated restoration clusters to restore the binary data finally (S303).

As described above, the method and apparatus for compressing and restoring data according to the present embodiment can quickly and efficiently compress and restore binary data through a simple operation and a hardware configuration, and has excellent compression rate, Not only the reliability of data can be increased, but also transmission efficiency and speed can be improved in data transmission.

While the invention has been shown and described in detail in the foregoing description, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art, Of the right.

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

Claims

Wherein the compression unit divides the original binary data into a plurality of clusters, the division step comprising dividing the original binary data by 0 and 1 per 01 included in the original binary data;
The compression unit deletes 1 of the most significant bits of each cluster for each of the plurality of clusters and then adds 1 to generate a plurality of compression clusters or deletes 1 of the most significant bits of each cluster for each of the plurality of clusters A compression step of generating a plurality of compressed clusters; And
And outputting the plurality of compressed clusters by the output unit.

The method according to claim 1,
Wherein the compression unit further includes a conversion step of converting 1 and 0 included in each compression cluster into a first transition pattern and a second transition pattern having transition patterns having mutually different potentials,
And the output unit outputs the compressed cluster converted by the conversion step.

3. The method of claim 2,
Wherein in the converting step, the compressing unit adds a rest period between neighboring compression clusters.

The method of claim 3,
Wherein the transition pattern is a transition between a first potential of positive potential and a second potential of negative potential,
The first transition pattern is a pattern that transits from the first potential to the second potential and the second transition pattern is a pattern that transitions from the second potential to the first potential; or
Wherein the first transition pattern is a pattern of transition from the second potential to the first potential and the second transition pattern is a pattern of transitioning from the first potential to the second potential.

The method of claim 3,
Wherein the idle period is maintained for a predetermined period of a predetermined potential interval.

The method according to claim 1,
Further comprising adding 1 before the most significant bit of the original binary data and 0 after the least significant bit of the original binary data before the dividing step.

delete

Dividing the original binary data into a plurality of clusters, dividing the original binary data by 0 and 1 for each 01 included in the original binary data, deleting 1 of the most significant bits of each of the plurality of clusters, For generating a plurality of compressed clusters, or for each of the plurality of clusters, deleting one of the most significant bits of each cluster to generate a plurality of compressed clusters; And
And an output unit for outputting the plurality of compressed clusters.

13. The method of claim 12,
Wherein the compression unit converts 1 and 0 included in each compression cluster into a first transition pattern and a second transition pattern having transition patterns with mutually different potentials, and the output unit outputs the converted compression clusters Compression device.

14. The method of claim 13,
Wherein the compressing unit adds a pausing unit between neighboring compression clusters when converting into the first transition pattern and the second transition pattern.

15. The method of claim 14,
Wherein the transition pattern is a transition between a first potential of positive potential and a second potential of negative potential,
The first transition pattern is a pattern that transits from the first potential to the second potential and the second transition pattern is a pattern that transitions from the second potential to the first potential; or
Wherein the first transition pattern is a pattern of transition from the second potential to the first potential and the second transition pattern is a pattern of transitioning from the first potential to the second potential.

15. The method of claim 14,
Wherein the idle period is maintained for a predetermined period of a predetermined potential interval.

13. The method of claim 12,
Wherein before the division of the original binary data, the compression unit adds 1 to the most significant bit of the original binary data and 0 after the least significant bit.

delete