KR20170112612A - Binary data compressed transfer method and appratus thereof - Google Patents

Abstract

According to the present invention, in any binary data,
A type binary cluster and a hidden A type binary cluster, which are binary clusters composed of one or more "0s" and one "1", are compressed and transmitted, and three types of 10type, 101 type and 1001 type binary clusters As an invention that significantly improves compression efficiency and speed compared to a transmission method,
S] process: Moving from the top to the bottom, when "01" is encountered for the first time, "01" separates the binary number between the next bits, and the separated binary number is called binary cluster.
Binary clusters separated by the above rule are divided into A type and B type.
A type is composed of one or more consecutive "0" s and one "1" s,
B type is not A type.
First discrete binary cluster has a special operation process when directly separated into A type forms without, the bit length of the binary cluster representing the "0" count, or the same number of discrete binary cluster by selecting any one of the first value (L) is converted into a binary number as a compressed binary cluster. At this time, the compressed binary cluster has characteristics starting with " 1 ".
Of course, in the case of the B type binary cluster to be described later, when the hidden A type binary cluster generated after the operation processing is made into the compressed binary cluster, the compression binary cluster is bit-inverted to have the characteristic of starting with "0" By reversing the setting, the type A binary cluster can be transformed into a compressed binary cluster starting with " 0 ", and the hidden type A binary cluster can be made into a compressed binary cluster starting with " 1 ".

Description

Binary Data Compressed Transfer Method (10 types-10type continuous type) {BINARY DATA COMPRESSED TRANSFER METHOD AND APPRATUS THEREOF}

Line coding, data compression

Line coding, data compression

Detailed description of specific embodiments for carrying out the invention

Detailed description of specific embodiments for carrying out the invention

Detailed description of specific embodiments for carrying out the invention

For any binary data, for any particular range of binary data

... 001011100011111001010101000000011110111 ...

[ [0050] ]

< first Compressed binary  Cluster Transport>

[S] Procedure: When moving from the top to the bottom, when "01" is encountered for the first time, "01"

001/011100011111001010101000000011110111

A binary number such as "001" is called a binary cluster.

Binary clusters separated by the above rule are divided into A type and B type.

A type is composed of one or more consecutive "0" s and one "1" s,

B type is not A type.

At this time, it is possible to modify the Latter part through various promises, and all the methods that are advantageous for data compression can be modified. In case of decoding, it is necessary to decode it through the reverse process. In this embodiment, the process of modifying the latter part was not performed separately.

If the first discrete binary cluster is directly separated into A type form without special calculation process, the discrete binary cluster

1 of the binary cluster indicating the number of "0" or the same number, and converts the value obtained by converting this value (L) into binary number as an compressed binary cluster. At this time, the compressed binary cluster has characteristics starting with &quot; 1 &quot;.

Of course, in the case of the B type binary cluster to be described later, when the hidden A type binary cluster generated after the operation processing is made into the compressed binary cluster, the compression binary cluster is bit-inverted to have the characteristic of starting with "0" By reversing the setting, the type A binary cluster can be transformed into a compressed binary cluster starting with &quot; 0 &quot;, and the hidden type A binary cluster can be made into a compressed binary cluster starting with &quot; 1 &quot;.

For example, in the above, "001" becomes L = 2, and if L is converted into binary, "10", which is the first transmission target compressed binary cluster.

This value is transmitted.

Then, the binary cluster is removed from the binary data to be compressed, and the binary data remaining is repeated from the [S] process again.

001/011100011111001010101000000011110111

< second Compressed binary  Cluster Transport>

Now, if you continue the remaining data from step [S]

011100011111001010101000000011110111

[S] process,

01/1100011111001010101000000011110111

1 " as the " first transmission &quot;, and the binary number &quot; 1 &quot; obtained by converting L into binary numbers is transmitted as a compressed binary cluster.

< third Compressed binary  Cluster Transport>

Now, if you continue the remaining data from step [S]

1100011111001010101000000011110111

[S] The process If you go through, down  Same thing,

110001/1111001010101000000011110111

, And the separated binary cluster is " 110001 " The remaining binary region is called the Latter part.

When the separated binary cluster is B type,

[1] Transforms B type binary clusters into bit inverted inverted binary clusters and combines them with the remaining binary data.

  In other words, make an inverted binary cluster with 110001 ===> 001110, and recombine it.

  001110/1111001010101000000011110111

At this time, it is possible to modify the Latter part through various promises, and all the methods that are advantageous for data compression can be modified. In case of decoding, it is necessary to decode it through the reverse process. In this embodiment, the process of modifying the latter part was not performed separately.

[2] Next, we separate the binary clusters through the above process [S].

[S], it is divided into "001" binary clusters as shown below, which is an A type binary cluster.

001/1101111001010101000000011110111

Thus, the separated binary cluster is always of type A. Let us call this binary cluster a Hidden A type binary cluster.

[3] For a hidden A type binary cluster, if L is obtained, L = 2 is obtained, and if it is converted to binary, it is "10". In case of Hidden A type binary cluster, bit inversion is made to "01" &Quot;, and then transmits the compressed binary cluster.

<4th Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

1101111001010101000000011110111 ==> S course ==>

1101/111001010101000000011110111 ==> B type binary cluster

0010111001010101000000011110111 ==> inverted binary cluster ==> [S] course

001/0111001010101000000011110111 ==> hidden A type binary cluster ==> L = 2 ==> compressed binary cluster ("10") ==> final compressed binary cluster ("01"

<5th Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

0111001010101000000011110111 ==> S course ==>

01/11001010101000000011110111 ==> A type binary cluster ==> L = 1 ==> Final compression binary cluster ("1") transfer

<6th Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

11001010101000000011110111 ==> S course ==>

11001/010101000000011110111 ==> B type binary cluster

00110010101000000011110111 ==> inverted binary cluster ==> [S] course

001/10010101000000011110111 ==> hidden A type binary cluster ==> L = 2 ==> compressed binary cluster ("10") ==> final compressed binary cluster ("01"

< Seventh Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

1001/0101000000011110111 ==> 01100101000000011110111 ==> 01/100101000000011110111 ==> L = 1 ==> "0"

< Eighth Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

1001/01000000011110111 ==> 011001000000011110111 ==> 01/1001000000011110111 ==> L = 1 ==> "0"

< Ninth Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

1001/000000011110111 ==> 0110000000011110111 ==>

01/10000000011110111 ==> L = 1 ==> "0" transmission

< Tenth Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

1000000001/1110111 ==> 01111111101110111 ==>

01/111111101110111 ==> L = 1 ==> "0" transmission

<11th Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

111111101/110111 ==> 000000010110111 ==>

00000001/0110111 ==> L = 7 (compressed binary cluster "111") ==> Invert to send "000"

<12th Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

01/10111 ==> L = 1 ==> Compressed binary cluster "1" transmission

<13th Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

101/11 ==> 01011 ==> 01/011 ==> L = 1 (compressed binary cluster "1") ==>

<14th Compressed binary  Cluster Transport>

After the binary cluster is removed and then removed, the compressed binary cluster transmission process is repeated for the remaining binary data

01/1 ==> L = 1 ==> Compressed binary cluster "1" transmission

<Last Compressed binary  Cluster Transport>

Now, we can find out if we can see "01" for the remaining data through the [S] process again. If we can not find "01" as in the following case, or if we see "01"

[0100] If it is necessary to meet "01" according to the setting, it can be solved by attaching "01" after the least significant bit of the transmission target binary data at the beginning of transmission. At this time, it is necessary to remove the last "01" do.

[2] Otherwise, when the last binary cluster is transmitted, there is a method of transmitting the binary cluster without any additional compression process.

In the present embodiment, if the method of transmission is used as it is, in the case of the last cluster on the decoding side, it is regarded as the original without decompression.

1 ===> "1" is finally transmitted

Therefore,

00101 11000 11111 00101 01010 00000 01111 In the case of 39-bit data of 0111,

14 compressed binary clusters and one original cluster of 10/01/01/01/01/0/0/0/0/000/1/0/1/1.

21 bits, and 14 pieces of compression binary clustering information are added to the total 35 clocks, so that the effect of 4 clocks is improved rather than 39 clocks of 39 bits. In this case, the division information &quot; / &quot; is called a CBCD (Compressed Binary Cluster Delimiter) in the present invention, and any duration can be used as long as it can be detected by not only 1 clock but also a receiver,

In the case of Manchester code line coding, "1" is expressed as a rising edge and "0" as a falling edge, and "/" may be expressed as a no transition in a 1/2 bit period. For example, if the compressed transport code is:

E.g,

000/0/1/00101/0/0/11/111001/11

Such data streaming can be converted to Manchester code and transmitted at Layer 0 as follows.

In addition, the present invention can be applied to any transmission method in which a separate method other than the method of expressing the division information &quot; / &quot; and the other method is implemented physically or temporally.

[Receiver]

The receiving unit can sequentially distinguish compressed binary clusters from the received compressed binary according to a physical transmission method from clusters and compressed binary cluster identification information as shown below.

10/01/01/01/01/0/0/0/000/1/0/1/1

Compressed binary clusters are identical to the original without the need for a separate decompression process, unless the last compressed binary cluster has a special nature, unless "01" is added after the least significant bit in compression.

Next,  There are two methods.

[One] 0  Starting Compressed binary  Cluster and starting with 1 Compressed binary  There is a cluster, Compressed binary  All clusters After receiving , How to decode while moving from the last binary cluster to the top

First of all,

(1) decompression from the lowest compression binary cluster,

In this embodiment, the lowest binary cluster, which is the compressed binary cluster 15, is the least significant bit without a separate decoding process.

therefore,

  "One"

(2) Next, since compressed binary cluster 14 starts with &quot; 1 &quot;, L = 1 and decompression is performed on binary clusters &quot; 01 &quot; do.

And attaches it to the most significant bit of the immediately preceding decoded bit.

Therefore, "01" / "1" ===> "011"

(3) Next, since the compression binary cluster 13 starts with "0"

1) When the compressed binary cluster is bit-inverted first, it is &quot; 1 &quot;, so L = 1, and therefore the binary cluster becomes &quot; 01 &quot;.

If this is done before the most significant bit of the immediately preceding decoded bit,

 "01" / "011" ==> "01011".

2) *** In this case, when the compressed binary cluster starts with "0", one step process is further added. In the case where "10" is encountered for the first time while moving from the top to the bottom of the currently generated decoding data , as "subjected to the bit inversion with respect to the range including the" 10111 "to complete the decoding process.

(4) Next, 12 compressed binary clusters are &quot; 1 &quot;, and L = 1, so decompression is &quot; 01 &quot; If you stick,

  "01" / "10111" ==> "0110111".

(5) Next, the 11th compressed binary cluster starts with "000" and starts with "0", so if the bit is inverted, it is "111" and L = 7 because it is 7 in decimal. Therefore, if the decompression is "00000001" and it is attached to the most significant bit of the immediately preceding decoded bit,

 "00000001" / "0110111" ==> "000000010110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 000000010 110111"==> 111111101 110111 "

(6) Next, the 10th compressed binary cluster is "0" and starts with "0", so when the bit is inverted, it is "1" and L = 1 because it is 1 in decimal. Therefore, when decompressed, it is "01" and it is attached to the most significant bit of the immediately preceding decoded bit as follows.

"01" / "111111101110111" ==> "01111111101110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 0111111110 1110111"==>" 1000000001 1110111"

(7) Next, the 9th compression binary cluster is also "0" and starts with "0", so that if bit inversion is performed, it is "1" and L = 1 because it is 1 in decimal. Therefore, when decompressed, it is "01" and it is attached to the most significant bit of the immediately preceding decoded bit as follows.

"01" / "10000000011110111" ==> "0110000000011110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 0110 000000011110111"==>" 1001 000000011110111"

(8) Next, the 8th compression binary cluster is also "0" and starts with "0", so if the bit is inverted, it is "1" and L = 1 because it is 1 in decimal. Therefore, when decompressed, it is "01" and it is attached to the most significant bit of the immediately preceding decoded bit as follows.

"01" / "1001000000011110111" ==> "011001000000011110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 0110 01000000011110111"==>" 1001 01000000011110111"

(9) Next, the 7th compression binary cluster is also "0" and starts with "0", so if the bit is inverted, it is "1" and L = 1 because it is 1 in decimal. Therefore, when decompressed, it is "01" and it is attached to the most significant bit of the immediately preceding decoded bit as follows.

"01" / "100101000000011110111" ==> "01100101000000011110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 0110 0101000000011110111"==>" 1001 0101000000011110111"

(10) Next, the compressed binary cluster of number 6 is "01" and starts with "0", so that if the bit is inverted, it is "10" and L = 2 because it is 2 in decimal. Therefore, when decompressed, it is "001", which is attached to the most significant bit of the immediately preceding decoded bit, as follows.

"001" / "10010101000000011110111" ==> "00110010101000000011110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 00110 010101000000011110111"==>" 11001 010101000000011110111"

(11) Next, the 5th compressed binary cluster is "1", which is 1 in decimal, so L = 1. Therefore, when decompressed, it is "01" and it is attached to the most significant bit of the immediately preceding decoded bit as follows. As described above, the compression binary cluster starting with "1 &quot; ends the decoding process.

"01" / "11001010101000000011110111" ==> "0111001010101000000011110111"

(12) Next, compressed binary clusters of No. 4 are "01", and compressed binary clusters starting with "0" are "10" when bits are inverted, and L = 2 because they are 2 in decimal. Therefore, when decompressed, it is "001", which is attached to the most significant bit of the immediately preceding decoded bit, as follows.

"001" / "0111001010101000000011110111" ==> "0010111001010101000000011110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 0010 111001010101000000011110111"==>" 1101 111001010101000000011110111"

(13) Next, the compressed binary clusters of the third compression binary cluster are also "01", and the compression binary clusters starting with "0" are "10" when the bits are inverted. Therefore, when decompressed, it is "001", which is attached to the most significant bit of the immediately preceding decoded bit, as follows.

"001" / "1101111001010101000000011110111" ==> "0011101111001010101000000011110111"

As described above, when the compressed binary cluster starts with &quot; 0 &quot;, a one-step process is further added. In the case where &quot; 10 &quot; is first encountered while moving from the top to the bottom of the currently generated decoding data , The decoding process is completed by performing bit inversion on the included range .

" 001110 1111001010101000000011110111"==>" 110001 1111001010101000000011110111"

(14) Next, the second compressed binary cluster is &quot; 1 &quot;, which is 1 in decimal, so L = 1. Therefore, when decompressed, it is "01" and it is attached to the most significant bit of the immediately preceding decoded bit as follows.

"01" / " 110001 1111001010101000000011110111"==>"011100011111001010101000000011110111"

As described above, the compression binary cluster starting with "1 " ends the decoding process.

(15) Finally, the first compressed binary cluster is &quot; 10 &quot;, which is 2 in decimal, so L = 2. Therefore, when decompressed, it is "001", which is attached to the most significant bit of the immediately preceding decoded bit, as follows.

"001" / "011100011111001010101000000011110111" ==> "001011100011111001010101000000011110111"

As described above, the compression binary cluster starting with "1 " ends the decoding process.

In conclusion, the results of decoding after 1 to 15 steps are as follows,

&Quot; 001011100011111001010101000000011110111 &quot; This is the same decoding right as the first compressed transmission data source.

"001011100011111001010101000000011110111"

[2] The receiving unit sequentially Receiving, as 1  Starting Compressed binary  Cluster Every time , A method of decoding after being immediately decoded in reverse order

In the decoding method [1], all the compressed data is received from the receiving unit, and the receiving unit data is decoded from the lowest to the highest direction. [2] is a compressed binary cluster starting with &quot; 1 &quot; The received data is decoded and pasted to the lower bits of the existing decoded data. The advantage is that it can be decoded without receiving all the data, and it is possible to decode it in a relatively sequential manner.

According to the above method,

(1) First, the first received compressed binary cluster starts with "1" as "10". Therefore, if decoding is performed immediately, "10" is 2 in decimal, Therefore, it is decompressed to "001".

(2) Since the compression binary cluster of number 2 starts with "1" also as "1", if decoding is performed immediately, L = 1 since "1" is a decimal number of 1. Therefore, it is decompressed to "01" Appended after the least significant bit of the decoded result .

Therefore, "001" / "01" ==> "00101".

(3) The compressed binary cluster # 3 is "01" and starts with "0". Therefore, the next compressed binary cluster is first received without performing decoding immediately .

(4) The fourth compressed binary cluster starts with "0" as "01", so that the next compressed binary cluster is first received without performing decoding immediately .

(5) Compressed binary clusters of number 5 start as "1" and start with "1", so they are decompressed. Compressed binary clusters received after direct sub-decoding in reverse order from the currently received compressed binary clusters are decompressed And pastes it after the least significant bit of the currently decoded data.

Since the compressed binary clusters # 3, # 4, and # 5 are 01/01/1,

1) First, "5" is "1" and L = 1, so decompressing is "01".

2) Next, "01" is written in case of 4, "10" in case of inverting, so L = 2 and decompression is "001".

 "001" / "01" ==> "00101"

Next, when "10" is first encountered from the top to the bottom, the bit is inverted to the area including "10"

" 0010 1"==>" 1101 1"

3) Next, if "3" is "01" and if it is inverted, L = 2 because it is "10" and if it is decompressed "001"

 "001" / "11011" ==> "00111011"

Next, when "10" is first encountered from the top to the bottom, the bit is inverted to the area including "10"

" 001110 11"==>" 110001 11"

If there is no compressed binary cluster requiring further sub-decoding, if the sub-decoded result is concatenated after the least significant bit of the existing decoded result,

It is as follows.

"00101" / " 110001 11"==>"00101 110001 11"

(6) Because the compressed binary cluster number 6 is "01" and starts with "0", the next compressed binary cluster is read without further decoding

(7) Since the compressed binary cluster No. 7 is "0" and starts with "0", the next compressed binary cluster is read without further decoding.

(8) The 8th compressed binary cluster is "0", so it starts with "0", so the next compressed binary cluster is read without further decoding

(9) Since the compressed binary cluster No. 9 is "0" and starts with "0", the next compressed binary cluster is read without further decoding

(10) The 10th compressed binary cluster is "0", so it begins with "0", so the next compressed binary cluster is read without further decoding

(11) The 11th compression binary cluster is "000", so it starts with "0", so the next compressed binary cluster is read without further decoding

(12) Since the compressed binary cluster 12 is "1", it starts with "1", and subdiffes the read compressed binary clusters together in reverse order.

1) Since 11 is compressed binary cluster is "1", L = 1 and decompression is "01".

2) Since compression binary cluster 10 is "000", if bit inversion is "111" and decimal number is 7, L = 7 Therefore, decompression is "00000001". This is prefixed to the most significant bit of the sub-decoded result.

"00000001" / "01" ==> "0000000101"

Next, when moving from the top to the bottom of the sub-decoded result and encountering "10" for the first time, the bits are inverted to the range including "10".

" 000000010 1"==>" 111111101 1"

3) Compressed binary cluster No. 9 is "0", so if bit inversion is "1" and decimal number is 1, L = 1 Therefore, decompression is "01" .

&Quot; 01 &quot; / &quot; 1111111011 &quot; Next, when moving from the top to the bottom of the sub-decoded result and when &quot; 10 &quot; is encountered for the first time,

" 0111111110 11"==>" 10000000011 1"

4) Since compression binary cluster 8 is "0", if bit inversion is "1" and decimal number is 1, L = 1 Therefore, decompression is "01" Stick.

01 &quot; / &quot; 100000000111 &quot; Next, when moving from the top of the sub-decoded result to the lowest direction, and when "10" is encountered for the first time,

"01100000000111"==>" 1001 0000000111"

5) Compressed binary cluster No. 7 is "0", so if bit inversion is "1" and decimal number is 1, L = 1 Therefore, decompression is "01" Stick.

&Quot; 01 &quot; / &quot; 10010000000111 &quot; Next, when moving from the top to the bottom of the sub-decoded result and when &quot; 10 &quot; is encountered for the first time,

"01" / "10010000000111"==>" 1001 010000000111"

6) Compressed binary clusters are "01", so if bit inversion is "10" and decimal is 2, L = 2 Therefore, decompression is "001" Stick.

001 &quot; / &quot; 1001010000000111 &quot; Next, when the first time the &quot; 10 &quot; is encountered while moving from the top to the bottom of the subdecoded result, the bits are inverted to the range including &quot; 10 &quot;

"0011001010000000111"==>" 11001 01010000000111"

7) Since there is no compressed binary cluster requiring further sub-decoding, if the sub-decoded result is concatenated after the least significant bit of the existing decoded result,

 Now, if we conclude with (5) and concatenate the results of the sub-decoding afterwards, the result is as follows.

"0010111000111" / " 11001 01010000000111"==>"0010111000111 11001 01010000000111"

(13) The 13th compressed binary cluster is "0", so the next compressed binary cluster is read without further decoding.

(14) Since the compressed binary cluster 14 is "1", the compressed binary clusters read up to immediately before are sub-decoded in reverse order

  1) L = 1 is compressed since the compressed binary cluster 14 is "1", and is decompressed to "01" when decompressed.

  2) Since the 13th compression binary cluster is "0", if the bit is inverted, it is "1" and therefore L = 1. 01 "and" 01 "==>" 0101 "if it is placed before the most significant bit of the sub-decoded result.

Now, when the first occurrence of "10" in the top-to-bottom direction of the sub-decoded result is first encountered, the range including "10" is bit-reversed.

" 010 1"==>" 101 1"

  3) Since there are no compressed binary clusters that need further sub-decoding, the sub-decoded result is concatenated after the least significant bit of the existing decoded result as follows.

"00101110001111100101010000000111" / " 101 1"==>"00101110001111100101010000000111 101 1"

(15) The 15th compression binary cluster &quot; 1 &quot; is the last binary cluster,

Without any additional decompression process, it is pasted just after the least significant bit of the existing decoded result.

"001011100011111001010100000001111011" / "1" ==> "0010111000111110010101000000011110111"

The results decoded by the above processes (1) to (15)

&Quot; 0010111000111110010101000000011110111 &quot;, and it is found that the original data completely coincide with the original data before compression transmission.

001011100011111001010101000000011110111

Claims (1)

The scope of claims for domestic priority claims is not specified separately.