KR101648674B1 - Binary data compression and decompression method - Google Patents
Binary data compression and decompression method Download PDFInfo
- Publication number
- KR101648674B1 KR101648674B1 KR1020150095215A KR20150095215A KR101648674B1 KR 101648674 B1 KR101648674 B1 KR 101648674B1 KR 1020150095215 A KR1020150095215 A KR 1020150095215A KR 20150095215 A KR20150095215 A KR 20150095215A KR 101648674 B1 KR101648674 B1 KR 101648674B1
- Authority
- KR
- South Korea
- Prior art keywords
- binary
- cluster
- bit
- significant bit
- compressed
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The method includes adding a forcing header to a binary number starting with "10 " before the most significant bit; Quot; 10 " is divided in front of "10 " every time the" 10 "is encountered for the first time while moving the binary number starting from" 10 " to the forward direction from the most significant bit to the least significant bit. Dividing a plurality of binary clusters to be transmitted in a reverse order; In the binary cluster, when the binary cluster is a 10-type binary cluster corresponding to a binary number consisting of one or more consecutive "0s " starting from" 1 ", expressing the number of "0" In the case of a 101 type binary cluster corresponding to a binary number consisting of one or more consecutive "1 " next to" 10 "in the binary cluster, after eliminating the uppermost" 10 ", the remaining binary numbers are bit- And in the case of a binary cluster of 1001 type corresponding to a binary number consisting of one or more "1 " following two or more" 0 " s after the binary bit in the binary cluster, bit inversion And a fifth step of transmitting the number of times the counter has been compressed from the first step of eliminating the most significant bit "0 " after being performed, in a binary number, and transmitting the binary number to the fifth step. A method of decompressing binary data is provided.
Description
The present invention relates to a binary data compression and decompression method, and more particularly, to a binary data compression and decompression method having an excellent processing speed and improved compression ratio.
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 transmitting binary data, the method comprising the steps of: adding a forcible header to a binary number starting from "10 "Quot; 10 " is divided in front of "10 " every time the" 10 "is encountered for the first time while moving the binary number starting from" 10 " to the forward direction from the most significant bit to the least significant bit. Dividing a plurality of binary clusters to be transmitted in a reverse order; In the binary cluster, when the binary cluster is a 10-type binary cluster corresponding to a binary number consisting of one or more consecutive "0s " starting from" 1 ", expressing the number of "0" In the case of a 101 type binary cluster corresponding to a binary number consisting of one or more consecutive "1 " next to" 10 "in the binary cluster, after eliminating the uppermost" 10 ", the remaining binary numbers are bit- And transmitting the binary number; And a 1001-type binary cluster corresponding to a binary number consisting of one or more "1 " following two or more " 1 " s after the binary bit in the binary cluster, A header that is a binary number consisting only of "1" in front of "10" that is first encountered while moving from the most significant bit to the least significant bit in the binary number of the result of the first step is shifted down to the least significant bit, and the counter is incremented by one A third step of repeating the first and second steps until there is no movement of the header; a third step of repeating the first and second steps until there is no movement of the header; A fourth step of removing the most significant bit "1" from the binary number and changing the binary number to a binary number consisting only of n-1 bits of " 0 "Attaching leads to the essence comprising: a fifth step of transmitting; containing, there is provided a binary data compression method.
The forcible header may be a binary number "10 ".
A compression binary cluster generated by compression of the binary cluster may be subjected to a digital modulation process so as to be distinguished from each other during transmission of the compression binary cluster.
The digital modulation process may be a pause transmission.
According to another aspect of the present invention, there is provided a method for decompressing binary data compressed by a binary data compression method according to an aspect of the present invention, the method comprising: sequentially receiving compressed binary clusters generated by compression of the binary clusters Performing decompression for each of the compressed binary clusters; And removing the forcible header before the most significant bit of the binary data connecting the decompressed binary clusters, wherein the step of performing decompression comprises: In case of a type compression binary cluster, decompressing is performed by adding "10" before the most significant bit after bit inversion; 0 "and" 1 "are mixed together, when the compressed binary cluster starts from" 0 " Dividing the compressed binary cluster between "1" and "1" to obtain a counter corresponding to a seed and a lower portion corresponding to the upper portion, a second step of adding "1" to the most significant bit of the seed, A third step of inverting the bit of the binary number after the second step and adding "1" before the most significant bit, a step of shifting from the least significant bit to the most significant bit in the binary number after the third step, Quot; and "1" to move the tail, which is a binary number composed only of "1" collected so far, to the most significant bit, and subtracting 1 from the binary number represented by the counter; And a fifth step of repeating steps 3 and 4 until the counter becomes "0 ", and a sixth step of bitwise inverting the binary number after the fifth step and adding" 1 &Comprising; And a compressed binary cluster starting with "1 ", when the compression binary cluster is a compression binary cluster starting with" 1 ", generates a binary number of consecutive "0" And decompressing the binary data by decompression by adding "1" before the most significant bit.
According to the binary data compression and decompression method of the present invention, the processing speed for compression and decompression can be improved, the compression rate is excellent, the reliability of the result of compression and decompression can be increased, It is possible to dramatically reduce the actual traffic of the network.
1 is a flow diagram illustrating a method for compressing binary data in accordance with one embodiment of the present invention.
2 is a block diagram illustrating an apparatus used in a binary data compression and decompression method according to an embodiment of the present invention.
3 is a flow diagram illustrating a binary data decompression method in accordance with one embodiment of the present invention.
The present invention is capable of various modifications and various embodiments, and specific embodiments are illustrated and described in detail in the drawings. 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 according to 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 flow diagram illustrating a method for compressing binary data in accordance with one embodiment of the present invention.
Referring to FIG. 1, a method of compressing binary data according to an embodiment of the present invention will now be described.
When transmitting arbitrary binary data to another device or storing it in a memory, for example, a compulsory header of binary number "10 " is added before the most significant bit (S110). For example, if there is arbitrary binary data such as "0010111010101001111100001011 "," 10 "is added as a forced header before the most significant bit," 100010111010101001111100001011 " For example, although the binary header "10" is used as the forcible header for starting the compression target binary number "10", it may be various binary numbers. For example, the "10" .
As shown in FIG. 2, the
Next, each time the "10" is first encountered while moving in the forward direction or the reverse direction from the most significant bit to the least significant bit, the plurality of binary clusters are divided in front of "10 " (S120). Here, the plurality of binary clusters is a unit of transmission, and is transmitted in the forward or reverse sequential order.
1000/1011/10/10/10/1001111/10000/1011
When each of these binary clusters is sequentially transmitted from the upper bit to the lower bit or vice versa, the type of each virgin cluster is determined (S130). These binary clusters are roughly classified into three types. Accordingly, the compression method varies depending on each binary cluster. A 10 type binary cluster, a 101 type binary cluster, and a 1001 type binary cluster. When each of these types of binary clusters is sequentially transferred, it is transmitted through each of the following steps, that is, a compression process.
In the case of 10 type binary clusters, a binary number in the form of one consisting of one " 1 "and one or more consecutive" 0 " s such as "10 ", " 100 "," to be. In the case of this type of binary cluster, for example, "00" is set to "100" when the most significant bit "1" is removed. To increase the compression efficiency, the number of "0" (S140). In the case of "10", the compressed binary cluster is "0". Since "1" is 1, "1" is transmitted. In the case of "1000", the compressed binary cluster is "000" , 11 are transmitted. 10000 ", the compressed binary cluster is "0000 ", and since there are four" 0 "s, the binary number" 100 " That is, a binary number starting with "1 " is transmitted as the final compressed binary cluster. The characteristics of this final compressed binary cluster may be heterogenous and homogenous, which must start with a "1". Table 1 below shows examples of intermediate generation and final transmission of 10 type binary clusters.
Luster
amount
The 101 type binary cluster is a binary cluster composed of binary numbers consisting of one or more consecutive "1 " s after" 10 ", such as "101 ", " 1011 "," 10111 & In the case of such a binary cluster, a compressed binary cluster represented by a binary number consisting of only "0" is generated by removing the uppermost two bits " 10 " That is, in the case of "1011 ", the compressed binary cluster is compressed to be" 00 " Table 2 below shows an example of intermediate generation and final transmission of a 101 type binary cluster. Here, bit inversion means changing "1" to "0" and "0" to "1".
cluster
In the case of a 1001 type binary cluster, "1" means a binary number consisting of one or more "1s" followed by two or more "0s", as shown in Table 3 below.
In the case of a 1001 type binary cluster, for example, a 1001 type binary cluster "10001111" is a first step, and performs bit inversion and removes the most significant bit "0" (S161) .
10001111 ==> 01110000 ==> 1110000
In the second step, a header (header) corresponding to a binary number consisting only of "1" in front of "10" which is first encountered while moving from the most significant bit to the least significant bit in the first stage compression result is shifted to the lowest bit , And increments the counter by 1 every bit of the header (S161).
1110000 ==> 1000011, Increase Counter 1
As a third step, the first and second steps are repeated. If the bit result of the compression result header in the first step does not exist, the process proceeds to step S163. In the example, there are three header bit shifts as described below, and when the compressed binary cluster is "101 ", since bit shift of the header does not occur as a result of the first stage compression, "And go to the fourth step.
[repeat]
(First step) 1000011 ==> 0111100 ==> 111100 (after performing the bit inversion, the most significant bit "0" is removed)
(Second step) 111100 ==> 100111, incrementing the counter 1 (binary number consisting of only "1" in front of "10" which is first encountered while moving from the most significant bit to the least significant bit in the first step compression result is called a header, Moves down the bit. Increment the counter by 1 for every bit move in these headers.)
[repeat]
(1st step) 100111 ==> 011000 ==> 11000
(Second step) 11000 == > 10001, Counter 1 increase
[repeat]
(1st step) 10001 ==> 01110 ==> 1110
(Second step) 1110 ==> 1011, Increment of counter 1
[repeat]
(Step 1) 1011 ==> 0100 ==> 100 (Since header does not exist after completion of Step 1, go to Step 4.)
In the fourth step, the most significant bit of "1" is removed from the n-bit binary number that starts with "1" and is made to be "0" in the third step and is changed to a binary number consisting only of "n-1" (S164). That is, 100 ==> 00. The counter value is 4 when it goes over from the third step.
In the fifth step, when the compression of the fourth step is completed, the number of bit shifts of the final header, which is counted in the second step, is followed by the binary number (S165). In this example, since the bit shift of the header occurs four times in total, "00100" which is a result of adding "100" as a binary representation of 4 to the result of the fourth stage compression "0" becomes a final compressed binary cluster. That is, an 8-bit binary cluster called "10001111" is compressed and compressed by a 5-bit compressed binary cluster called "00100 ".
In the case of a 1001 type binary cluster, as another example, a binary cluster of type 1001 named "100011" is compressed according to the above method.
According to the first step, after the bit inversion is performed, the most significant bit "0" is removed to perform 100011 ==> 011100 ==> 11100 (S161).
According to the second step, the binary number of the result of the first step is 11100 ==> 10011, and the counter 1 is incremented. That is, in the first stage compression result, a binary number consisting only of "1" in front of "10" which is first encountered while moving from the most significant bit to the least significant bit is called a header, and this header is shifted below the least significant bit. The counter is incremented by 1 each time the header bit is shifted (S162).
According to the third step, the first and second steps are repeatedly performed as described below, and if the bit shift of the header of the first stage compression result does not occur, the process moves to the fourth step (S163).
[repeat]
(1st step) 10011 ==> 01100 ==> 1100
(Second step) 1100 ==> 1001, incrementing counter 1 (current counter value 2)
[repeat]
(First step) 1001 ==> 0110 ==> 110
(Second step) 110 ==> 101, Increment of counter 1 (current counter value 3)
When the 101 ==> 010 ==> 10 process is performed by the first step after repeating the first and second steps with respect to "101 ", there is no bit shift of the header, Go to step 4 with "10". The counter result up to this point is 3.
According to the fourth step, in the binary number of n bits starting from " 1 "in the third step and consisting of only" 0 ", the most significant bit "1" (S164). At the third step, the counter is 3. Since "10" is 2 bits, it is compressed into a binary number consisting of only "0"
"10" ==> "0"
According to the fifth step, the number of bit shifts of the last header counted in the second step is added to the result of the fourth step (S165). In this example, since the bit shift of the header has occurred three times in total, "011", which is a result of pasting "11" representing the binary representation of 3 to the result "0" of the fourth step, becomes the final compressed binary cluster. That is, a 6-bit binary cluster of "100011" is a 3-bit compressed binary cluster of "011 "
Thus, in the case of a 1001 type binary cluster, it becomes a heterogeneous compressed binary cluster starting with "0 ". The heterogeneous can be defined as a mixture of "0" and "1", and homogenous can be defined as a binary number consisting of only "0" or "1".
In this way, the transmission side transmits sequentially the compressed binary clusters generated by the compression of the binary clusters to the receiving side. In this case, it is possible to represent binary numbers in the compressed binary clusters, / Storage method / communication method, the present invention can be applied. For example, a digital binary modulation process can be performed so that the boundaries of the compressed binary clusters can be distinguished for every transmission of the compressed binary clusters.
As an example of the transmission method, Manchester coding is partially modified. In the compression binary cluster, according to the existing Manchester coding, "1" in the compressed binary cluster is divided into a rising edge from a falling edge and a "0 & And the identification information of the compressed binary clusters may be physically modified so that the transmitting side and the receiving side can distinguish by sending a distinguishable zero voltage without losing synchronization.
3 is a flow diagram illustrating a binary data decompression method in accordance with one embodiment of the present invention.
Referring to FIG. 3, a method of decompressing binary data according to an embodiment of the present invention will be described as follows.
In step S210, the receiving side determines the type of the compressed binary cluster in step S220. Then, in step S220, the receiving side determines the type of the compressed binary cluster according to the type of the compressed binary cluster, Respectively. A decompression scenario exists when the received compressed binary cluster starts with "0" or starts with "1", and there is a decompression scenario when it starts with "1", and if it starts with "0" , And decompression scenarios are different depending on whether they are homogenous or not.
First, among the compressed binary clusters, there is a form in which the binary numbers of the compressed binary clusters are equally set to "0 ", which corresponds to a type 0 compressed binary cluster.
0 type compressed binary clusters are compressed binary clusters consisting of one or more consecutive "0s" such as "0", "00", "000", "0000" , The compressed binary cluster is bit-inverted and then decompressed by adding "10" before the most significant bit (S230). That is, in the case of "00 ", when the compressed binary cluster is bit inverted first, it becomes" 11 ", and "10" Examples related to this are shown below.
000 ==> 111 (bit inversion) ==> 10111 ("10" addition)
00000 ==> 11111 (bit inversion) ==> 1011111 ("10" addition)
00 ==> 11 (bit inversion) ==> 1011 ("10" addition)
Is a heterogeneous type compressed binary cluster in which "0" and "1" are mixed, as in the case of the compressed binary cluster "00100". First, when receiving a heterogeneous type compressed binary cluster at the receiving unit, as a first step, the compressed binary cluster is divided between "0" and "1" when it first encounters "1" while descending from the most significant bit to the least significant bit. The upper part is a seed and the lower part is a counter, which is as follows (S241).
The second step starts with decompression, starting from the seed. The counter is "100 ", which is 4 in decimal. Quot; 1 "is added to the most significant bit of the seed data made up of" 0 " (S242).
"00" (seed) ==> "100" (seed with "1" added before the most significant bit)
The third step inverts the binary number corresponding to the seed added with the binary number, i.e., "1 ", before the most significant bit after the second step, and adds 1 to the most significant bit (S243).
"100" ==> "011" (bit inversion) ==> "1011" (add "1" before the most significant bit)
In the fourth step, as a result of the third step, when moving from the least significant bit to the most significant bit and encountering "0" for the first time, it is divided between "0" and the immediately lower bit "1" "Is called a tail, and this tail is moved to the most significant bit. Then, 1 is subtracted from the binary number indicated by the counter (S244). The process of moving the tail is as follows.
The result of the above-mentioned tail movement process is as follows.
"1011" ==> 10/11 (tail division) ==> 1110 (tail movement), counter first decimation (current counter value 3)
In the fifth step, the third and fourth steps are repeatedly performed until the counter becomes zero (S245).
[repeat]
Step 3: 1110 ==> 0001 ==> 10001
Step 4: 10001 == 1000/1 ==> 11000, counter first difference (current counter value 2)
[repeat]
Step 3: 11000 ==> 00111 ==> 100111
Step 4: 100111 ==> 100/111 ==> 111100, counter first decimation (current counter value 1)
[repeat]
Step 3: 111100 ==> 000011 ==> 1000011
Step 4: 1000011 ==> 10000/11 ==> 1110000, counter first decimation (current counter value 0)
Here, since the counter value is 0, the process moves to the sixth step.
In the sixth step, the decompression process is terminated by adding "1" to the most significant bit after finally performing the bit inversion for the decompression result "1110000" in the fifth step as described below (S246) .
1110000 ==> 0001111 ==> 10001111
Therefore, the final decompressed binary cluster is "10001111 ". It can be seen that it is decompressed with the same result as before the compression process.
Another example of the decompression method of the present invention is as follows.
In the case of the compressed binary cluster "011 ", it is a heterogeneous type compressed binary cluster in which" 0 " Upon receipt of the heterogeneous compressed binary cluster in the receiver, according to the first step, the compressed binary cluster is divided between "0" and "1" when it encounters "1" for the first time while descending from the most significant bit to the least significant bit. And the lower part is a counter, which is as follows (S241).
Starting from the seed by the first step, decompression is started. The counter is "11" and the decimal number is 3.
The second step adds "1" to the most significant bit of the seed data made up of "0 " as shown below (S242).
"0" ==> "10" (add "1" before the most significant bit)
The third step inverts the bit of the binary cluster being decompressed and adds "1" before the most significant bit (S243), as described below.
"10" ==> "01" (bit inversion) ==> "101" (add "1" before the most significant bit)
In the fourth step, as a result of the third step, when moving from the least significant bit to the most significant bit, when the first bit of "0" is encountered, a binary number consisting of only "1" tail), and moves this tail forward to the most significant bit. Then, 1 is subtracted from the binary number indicated by the counter (S244). The movement of the tail is shown in the figure below.
The result of the tail movement process is as follows.
"101" ==> 10/1 (tail division) ==> 110 (tail shift), counter first decimation (current counter value 2)
The fifth step repeats the third and fourth steps and repeats until the counter reaches zero (S245).
[repeat]
Step 3: 110 ==> 001 ==> 1001
Step 4: 1001 == 100/1 ==> 1100, counter 1 (current counter value 1)
[repeat]
Step 3: 1100 ==> 0011 ==> 10011
Step 4: 10011 ==> 100/11 ==> 11100, counter first difference (current counter value 0)
Since the counter value is 0, the process goes to the sixth step
In the sixth step, the bit inversion is finally performed on the result "11100" as the decompression result in the fourth step, and "1" is added to the most significant bit to end the decompression process (S246).
11100 ==> 00011 ==> 100011
Therefore, the final decompressed binary cluster is "100011 ". It can be seen that it is decompressed with the same result as before the compression process.
The decompression of the compressed binary cluster starting with "1" is as follows.
Compressed binary clusters starting with "1 " can be either heterogeneous or homogenous, first transforming the binary representation represented by the compressed binary cluster into a decimal number, 0 ". ≪ / RTI > The decompression is performed by adding "1" to the most significant bit of the next generated binary number (S250). For example, if the compressed binary cluster starting with "1" is "101", the binary value "101" it represents is 5 in decimal, Quot; 1 "before the most significant bit of the binary number thus generated. The following examples are shown below.
101 (5) ==> 00000 ==> 100000
10 (2) ==> 00 ==> 100
1010 (10) ==> 0000000000 ==> 10000000000
To summarize the principle of the above-described decompression process, consideration is given to the type of each sequentially received compressed binary clusters. First, it is discriminated whether it starts with "1" or starts with "0". If it starts with "0" , Is largely heterogeneous. Homogenous "is decompressed according to each type, and when it starts with" 1 ", decompression is performed according to the corresponding method.
As described above, according to the detailed type according to each type of compression binary cluster, the receiving unit can restore all of the binary clusters that the transmitting unit wanted to transmit while decompressing, and the top of the binary data connecting the restored final binary clusters If the mandatory header before the bit is decapped (S300), the original arbitrary binary data can be completely transmitted and received, restored, and the data can be transmitted at a very high speed.
According to the binary data compression and decompression method of the present invention, the processing speed for compression and decompression can be improved, the compression rate is excellent, the reliability of the result of compression and decompression can be increased, The substantial traffic of the 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 and scope of the present 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.
11: Receiver 12: Microcomputer
13: Transmission unit 14: Memory unit
Claims (5)
Quot; 10 " is divided in front of "10 " every time the" 10 "is encountered for the first time while moving the binary number starting from" 10 " to the forward direction from the most significant bit to the least significant bit. Dividing a plurality of binary clusters to be transmitted in a reverse order;
When a binary cluster of any one of the plurality of binary clusters is a 10-type binary cluster corresponding to a binary number starting from one "1 " and one or more consecutive" 0 ", the number of & And transmitting the compressed data to the receiver or the memory unit.
If the other binary cluster among the plurality of binary clusters is a 101 type binary cluster corresponding to a binary number consisting of one or more consecutive "1 " s after" 10 ", the uppermost "10" Compressing the bits so as to reduce the number of bits by expressing them as a binary number consisting only of "0 ", and then transmitting the resultant to a receiver or a memory unit; And
When the other binary cluster among the plurality of binary clusters is a binary cluster of 1001 type corresponding to binary numbers consisting of one or more "1 " following two or more" 0s " A header that is a binary number consisting only of "1" in front of "10" which is first encountered while moving from the most significant bit to the least significant bit in the binary number of the result of the first step, A third step of repeating the first and second steps until there is no movement of the header, a step of starting from "1" passed in the third step, Quot; 1 "in the n-bit binary number consisting of only "0" Results after the first compression, which can lead to reduction of the number of bits of the counter by the number followed by a binary number in the attaching step, further comprising: a fifth step of transmitting it to the receiver unit and a memory;
/ RTI >
The forced header includes:
Binary "10 ".
And a digital modulation process is performed so that the compressed binary clusters generated by the compression of the binary clusters can be distinguished for each transmission between the compressed binary clusters upon transmission.
The digital modulation process includes:
A dormant sender, a method of compressing binary data.
Sequentially receiving compressed binary clusters generated by compression of the binary clusters, and performing decompression on each of the compressed binary clusters; And
Decrypting the forcible header before the most significant bit of the binary data connecting the decompressed binary clusters,
Wherein performing the decompression comprises:
If the compressed binary cluster is a 0 type compressed binary cluster consisting only of "0 ", decompressing by adding" 10 "before the most significant bit after bit inversion;
0 "and" 1 "are mixed together, when the compressed binary cluster starts from" 0 " And a " 1 "to obtain a counter corresponding to a seed and a lower portion corresponding to the upper portion, a second step of adding" 1 "before the most significant bit of the seed, A third step of inverting a bit of a binary number corresponding to a seed added with a " 1 "before the most significant bit by adding a " 1 " to the bit by completing the second step, When moving toward the bit direction, when the first bit of "0" is encountered, the bit is divided between "0" and the immediately preceding lower bit "1" A fourth step of subtracting 1 from the binary number indicated by the counter, a fifth step of repeating the third and fourth steps until the counter becomes "0", and a fifth step of repeating the fifth step And adding a "1" to the most significant bit; And
If the compression binary cluster is a compression binary cluster starting with "1 ", binary numbers represented by compressed binary clusters starting with" 1 " are converted into decimal numbers, and binary numbers of consecutive "0" Decompression by adding "1" before the most significant bit of this binary number;
/ RTI > The method of claim 1,
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR20150076906 | 2015-05-31 | ||
| KR1020150076906 | 2015-05-31 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| KR101648674B1 true KR101648674B1 (en) | 2016-08-16 |
Family
ID=56854654
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| KR1020150095215A KR101648674B1 (en) | 2015-05-31 | 2015-07-03 | Binary data compression and decompression method |
Country Status (1)
| Country | Link |
|---|---|
| KR (1) | KR101648674B1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10816520B2 (en) | 2018-12-10 | 2020-10-27 | General Electric Company | Gas analysis system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140136118A (en) * | 2013-05-20 | 2014-11-28 | 김정훈 | Binary data compression and decompression apparatus and method thereof |
| KR20150009831A (en) * | 2013-07-17 | 2015-01-27 | 김정훈 | Method of generating compression barcode of binary data, method of recovering binary data and the apparatus thereof |
-
2015
- 2015-07-03 KR KR1020150095215A patent/KR101648674B1/en active IP Right Grant
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140136118A (en) * | 2013-05-20 | 2014-11-28 | 김정훈 | Binary data compression and decompression apparatus and method thereof |
| KR20150009831A (en) * | 2013-07-17 | 2015-01-27 | 김정훈 | Method of generating compression barcode of binary data, method of recovering binary data and the apparatus thereof |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10816520B2 (en) | 2018-12-10 | 2020-10-27 | General Electric Company | Gas analysis system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0469841A1 (en) | Data round-off device | |
| DE69529522T2 (en) | METHOD AND DEVICE FOR IMPLEMENTING A 8B6T ENCODER AND DECODER | |
| US5694128A (en) | Tree structured binary arithmetic coder | |
| WO2009009574A2 (en) | Blocking for combinatorial coding/decoding for electrical computers and digital data processing systems | |
| CN110192366A (en) | Conversion or reconvert data-signal method and for data transmission and/or data receiver method and system | |
| RU2629455C2 (en) | Method of joint arithmetic and noise-immune coding | |
| CN108768587B (en) | Encoding method, apparatus and readable storage medium | |
| US20220005229A1 (en) | Point cloud attribute encoding method and device, and point cloud attribute decoding method and devcie | |
| US4794627A (en) | Process for the parallel-series code conversion of a parallel digital train and a device for the transmission of digitized video signals using such a process | |
| US5404138A (en) | Apparatus for decoding variable length codes | |
| KR101648674B1 (en) | Binary data compression and decompression method | |
| CN112866196B (en) | Short wave digital signal interpretation and reduction method | |
| KR101670606B1 (en) | Binary data compression and decompression method | |
| KR101723336B1 (en) | Binary data compression and decompression method | |
| DE4127225A1 (en) | DATA CODING SYSTEM | |
| KR20170092183A (en) | Method and apparatus for transfering compressed binary clusters | |
| JPS5818824B2 (en) | Fukushima Shingouno Fugoukahoushiki | |
| KR20160140285A (en) | Compressed data transfer by binary clusters | |
| KR20140145437A (en) | Binary data compression and decompression method and apparatus | |
| KR101700537B1 (en) | Binary data compression and decompression method | |
| DE60131346T2 (en) | Method and circuit for the iterative decoding of self-orthogonal codes | |
| EP0913035B1 (en) | context dependent data compression | |
| CN110865299B (en) | Folding set layered compression method and device based on forward compatibility | |
| CN110431748B (en) | Binary arithmetic decoder and binary arithmetic decoding device | |
| RU2752868C1 (en) | Method for arithmetic encoding and decoding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| E701 | Decision to grant or registration of patent right | ||
| GRNT | Written decision to grant | ||
| FPAY | Annual fee payment |
Payment date: 20191009 Year of fee payment: 4 |