JP5001458B1 - Recording medium on which a two-part processing compression program is recorded - Google Patents

Abstract

【Task】
The purpose is to improve the compression rate in lossless compression technology. In the case of a compressed file to which irreversible compression is applied, the purpose is to reduce the amount of use of irreversible compression and to improve the compression rate compared to the conventional irreversible compression.
[Solution]
Create a two-part array for when the number indicating the position of the data in the array from which the file to be compressed is read is odd and even, and run-length-compress the file into an array containing only the data at the even position. Provides a method to obtain a high compression ratio by compressing.
[Selection] Figure 1

Description

The present invention relates to a file compression technique used in a computer.

There is [Non-Patent Document 1] as a document relating to compression technology.
Okumura Haruhiko and Yamazaki Satoshi LHA and ZIP Compression Algorithm x Introduction to Programming Softbank Publishing Co., Ltd. 2003/12/6 First Edition Kameyama Wataru, Kaneko Masaru, Watanabe Hiroshi The latest technology that I want to know there Introduction to audio and video compression Impress R & D Co., Ltd.

This [Non-Patent Document 1] describes in detail the compression technology in the LZH and ZIP formats, but the process of dividing the file to be compressed into two, like a recording medium recording the two-part processing compression program of the present invention. The process is not described. [Non-Patent Document 2] is a book that covers non-reciprocal compression techniques, but also describes basic compression techniques. However, the file to be compressed is divided into two as in the recording medium on which the two-division processing compression program of the present invention is recorded both in the basic compression technique described and in the description part of the non-reciprocal compression technique. Processing steps are not described.

Both lossless compression technology and lossy compression technology are aimed at improving the compression rate. In the case of the irreversible compression technology, an object is to provide a clear image and a high-sounding sound by reducing the amount of use of the irreversible compression technology.

The present invention is titled as a recording medium on which a two-part processing compression program is recorded, but is a recording medium that can be read by a computer on which a two-part processing compression program is recorded. In addition, text characters commonly used in computers (in Japan, two-byte characters representing one character with two ASCII codes and one-byte characters representing one ASCII code) are abbreviated as text characters. And A text character is sometimes called a character code. In addition, the machine language normally used in computers is abbreviated as machine language. Machine language commonly used in computers refers to statements that are scheduled to be processed by a central processing unit called a CPU installed in computers. In addition, numerical values called machine languages include 4-bit numerical values called BCD numerical values, and there is a character code generally called EBCDIC that is created based on the 4-bit BCD numerical values. The character code generally called EBCDIC is also called EBCDIC in this document.

An array refers to a data that can be assigned from one to a plurality of data, and an array size refers to the number of data that can be assigned to the array. The size of the array is sometimes called the array size. Data assigned to an array is called an array element or array element, and the total number of array elements or array elements is called an array element number or array element number. In addition, the size of the array is sometimes called the array size. The type of array means the number of bits or bytes used in the main memory in the computer that uses one piece of data that can be assigned to the array. This type is specified when an array is created, and is applied to all areas where data of the created array can be assigned. The above-mentioned meaning “applies to all of the areas” means that data of different types cannot be mixed in an area where array data can be assigned. Variables have the same type as arrays, and the meaning of variable types is exactly the same as for array types. An array index may also be called an array subscript or an array number. Hereinafter, an array index may be referred to as an array index or array number. When creating an array without specifying the array index, such as creating the array index from the time of creating the array, the index that is assigned to the first position of the area where the array data can be assigned is usually number 0 The numerical value with the number incremented by 1 is automatically assigned by the compiler to each array position where array data can be substituted. In other words, the array index is a number indicating the position of data to be assigned to the array. This allows the programmer to easily specify the position of the data assigned to the array by specifying the array index. When acquiring an index, it is acquired as a numerical value. In the present invention, all variables and arrays are created with a 1-byte type. Then, we decided to assign an index to a variable or array created with a 1-byte type. In some cases, the expression of the first position of the area into which the array data can be substituted is abbreviated as the first position of the array. In some cases, the last position of the area into which the array data can be substituted is abbreviated as the last position of the array.

When reading a file in binary format, it means reading into the array as ASCII code one byte at a time. When reading a file in text format, it means reading one text character at a time. When reading a file in text format, the single-byte character is 1 byte, but normally, even if it is a single-byte character due to processing speed, it is read in 2 byte units. Therefore, when reading a file in text format, it will be read 2 bytes at a time. In the following, there are cases in which the position to be assigned is shifted one by one each time assignment is made from the first position of the array, and the data is assigned to the array one by one, etc. To be exact, when reading a file in binary format as described above, it is 1 byte, and when reading a file in text format, it is 2 bytes. There is also a format specification when creating a file. That is, when recording and saving in a file in binary format and when recording and saving in a file in text format. Each expression data used when recording and saving in a binary format file is 1 byte. Each expression data used when recording and saving to a file in text format is 2 bytes. However, there are cases where 4 bits of data are assigned to arrays and variables. When 4 bits of data is assigned to this array or variable, each data is 4 bits.

Assuming a Japanese kana file in which the character string “Aiueo” is written, this file cannot be compressed at all in the normal compression process. Run-length compression is expressed in a short way by expressing “A” as 5 characters when the same characters as “AAAAAA” continue. This short expression is a compression method. There is also dictionary compression. This is a method of expressing a character string that has already appeared for the second time by making the character string the same as how many characters before. In other words, in the case of a file in which the word “Let's play in the park” appears twice, it will be the same as, for example, seven characters ten characters before when it appears twice. The recorded contents can be expressed by numerical values 2 bytes of 10 and 7. Therefore, dictionary compression cannot be performed for a file in which the character string “Aiweo” is recorded. This is because there is no exact character string. Slide dictionary compression is a new type of dictionary compression and is basically the same as dictionary compression. In this way, there are character strings that cannot be compressed at all by conventional compression techniques. However, if the character is divided into two parts using the character code characteristics as described below, the character can be compressed. When Japanese is converted to text on a computer, it is written in a file with character codes. If the character string “aiueo” is used as a character code in Japanese kana, it will be as follows.
131
65
131
67
131
69
131
71
131
73
The character code 131 is always written alternately. Therefore, if 131 is put together, a compression rate of 50% can be obtained by simple calculation. In the case of Japanese sentences, in most cases, such a combination of character codes is used, so that a considerably high compression rate can be expected. Therefore, as a pre-compression process, create an array with the first character data assigned and an array with the second character data assigned, and the data assigned to the array is compiled into only the first character. We decided to provide a program that improved the compression rate by providing a program that compresses files by performing run-length compression on this array. The compression process for performing compression using the ASCII code of the present invention is sometimes called text level compression. In addition, a decoding process for decoding a file compressed by the technique of the present invention may be referred to as tesquite level decoding.

An array is created with a size that allows substitution of all the data read in the binary format, and this array is called an A array. Each time you assign from the first position of the A array that was created by reading the file in 1 byte in binary format, the position to be assigned is shifted by 1 byte, and the data is assigned to the A array by 1 byte. Two arrays are created, and each array is called a first array and a second array. Each time the data of the first character (data assigned to the even index of the A array) is assigned to the first array from the first position of the first array, the position to be assigned is shifted by 1 byte and assigned to the first array. Then, every time the data of only the second character (data assigned to the odd index of the A array) is assigned to the second array from the first position of the second array, the position where the 1 byte is substituted is shifted, and the second array By substituting into, an array with the same numerical values can be created in either the first array or the second array.

It is considered that other computers that do not use the ASCII code can do the same as the recording medium on which the two-division processing compression program of the present invention is recorded. As a first method, when using a code that represents a single character with a fixed number of bits and a single character with a two-character value, either one character is used as a reference. In the case of a character code that can be classified (meaning that it is very similar to a character that represents one character with two ASCII codes), the first character (assigned to the even index of the array) in exactly the same way Data) and the second character (data assigned to the odd index of the array) can be divided into two. As a second method, it is considered that other computers that do not use the ASCII code can do the same as the software of the present invention by creating a special character code for division for division. In this case, the special character code for division for dividing should be the same as the ASCII code, and converted to the special character code for division for dividing the character code of other computers that do not use the ASCII code. This should be possible. The text level compression of the present invention is performed on another computer that does not use the ASCII code. Both the first method and the second method are recording media on which the two-division processing compression program of the present invention is recorded. I make a statement. Also, it is the same method as the second method, but by using a method that performs encryption by creating a special character code, etc., the computer using the ASCII code and the ASCII code are used. A method that enables high-efficiency compression on both of the computers that have not been considered is conceivable. In this case as well, it is clearly stated that the recording medium is recorded with the two-division processing compression program of the present invention. Explain what it means to perform high-efficiency compression, such as by creating a special character code. To explain this, it is explained when a character code using all numeric values (binary numbers from 000000000 to 111111111, decimal numbers from 0 to 511) that can represent binary numbers in 9 bits is explained. I will do it. By combining two created character codes, there is a way to increase the probability that the same code will appear continuously in each of 9 bits (even part) on the left side and 9 bits (odd part) on the right side. is there. ASCII code uses all binary numbers that can be expressed in 8 bits. (Numeric value from 00000000 to 11111111 in binary number, numeric value from 0 to 255 in decimal number) Therefore, the character code for encryption can not be expressed by the combination of 8-bit binary number. All used encryption was used. However, in the sense of creating a compressed file, some problems may remain. This is because the ASCII code is 16 bits for 2 characters, but if it is 2 characters with 9 bits as one character, it will be 18 bits, which increases the number of bits of the original character code. Although there is still room for research, the probability that the same character code continues in the even and odd parts will still double. The following is a list of issues that still have room for research. Binary numbers that can be expressed in 16 bits are decimal numbers from 0 to 65535. Representing one character using a combination of two characters that can be expressed in 16 bits is meaningless if it is limited to compressing a text file written in Japanese. This is because 65535 characters are not used in Japanese, so it is only possible to perform run-length compression on either the even part or the odd part, and the compression rate stops at 50% at the maximum. Because it becomes. If the compression rate is 50%, the original ASCII code is 16 bits when using 2 characters per character and representing one character, so if it is a character code representing one character using 2 characters as one character in 16 bits, Since it is only the number of bits used in the original ASCII code, compression fails. So there is no meaning. However, the other side that has not been run-length compressed can be compressed by a method such as dictionary compression. However, in the case of languages with a large number of characters such as Chinese, it may make sense. If it is meaningless in 16 bits, I will wonder if it is a binary number that can be expressed in 15 bits. A binary number that can be expressed in 15 bits is a decimal number from 0 to 32767. A binary number that can be expressed in 14 bits is a decimal number from 0 to 16383. A binary number that can be expressed in 13 bits is a decimal number from 0 to 8191. A binary number that can be expressed in 12 bits is a decimal number from 0 to 4095. The binary number that can be expressed by 11 bits is a decimal number from 0 to 2047. The binary number that can be expressed in 10 bits is a decimal number from 0 to 1023. Among the character codes that change the number of bits representing one character, the character code is adjusted according to the problem of which character code produces the highest compression rate and the number of frequently used characters. Various methods such as adjusting the character code so that the highest compression rate can be obtained with respect to the number of all character types appearing in the file to be compressed can be considered. It is a question of how many bits of a binary code are combined with a character code for encryption which can obtain the highest compression rate by these various methods. The creation of character code tables for encryption with room for research by all these methods, but the compression method using these character code tables for encryption and the compressed files created by that compression method are restored. Both of the decoding methods are clearly described as recording media on which the two-division processing compression program of the present invention is recorded. In addition, there is a numerical value that represents one character made up of 8 bits of ASCII code by combining two special 4-bit binary numbers similar to EBCDIC. It is considered that the same processing can be performed even if this special 4bit binary number is used. It is clearly stated that even if similar processing is performed using this special 4-bit binary number, the recording medium is recorded with the two-division processing compression program of the present invention. Paragraph [0011] describes a numerical value representing an ASCII code by combining two special 4-bit binary numbers similar to the above-mentioned EBCDIC. This number is calculated by using Visual Stadio2005 C # compiler from MicroSoft Corporation.
The compiler called Stadio2005 C # has a program called BitArray that can process data bit by bit using this BitArray program. In other words, the program used when processing data bit by bit is a program called BitArray. When using this BitArray program with ASCII code, first assign the ASCII code to the array one byte at a time. The BitArray program cannot be used unless it is assigned to the array by 1 byte. If the numerical value of the ASCII code assigned to the array is processed by the BitArray program and acquired one bit at a time, it is acquired in a special format of true and false. Visual
According to the instruction manual of Stadio2005 C #, the obtained true is ON, and false is 0FF. When the acquired data expressed as true and false is converted into a binary number format expressed by numerical values of 0 and 1 for 4 bits, a special 4-bit numerical value in paragraph [0011] is acquired. The acquired special 4-bit numerical value is a completely reverse binary number, but it is clearly stated that the combination of the normal binary numbers is a recording medium on which the two-division process compression program of the present invention is recorded. In addition, the two special 4-bit values in paragraph [0011] are separated by a space. However, even if the left 4 bits and the right 4 bits separated by a space are used, the two-part processing compression of the present invention is used. It is stated that the program is a recording medium on which the program is recorded.

0000 0000 is ASCII code 0.
1000 0000 is the ASCII code 1.
0100 0000 is the ASCII code 2.
1100 0000 is the ASCII code 3.
0010 0000 is ASCII code 4.
1010 0000 is the ASCII code 5.
0110 0000 is 6 of the ASCII code.
1110 0000 is the ASCII code 7.
0001 0000 is ASCII code 8.
1001 0000 is the ASCII code 9.
0101 0000 is the ASCII code 10.
1101 0000 is the ASCII code 11.
0011 0000 is the ASCII code 12.
1011 0000 is the ASCII code 13.
0111 0000 is 14 of the ASCII code.
1111 0000 is 15 of the ASCII code.
0000 1000 is the ASCII code 16.
1000 1000 is the ASCII code 17.
0100 1000 is 18 of the ASCII code.
1100 1000 is 19 of the ASCII code.
0010 1000 is the ASCII code 20.
1010 1000 is the ASCII code 21.
0110 1000 is the ASCII code 22.
1110 1000 is the ASCII code 23.
0001 1000 is 24 of the ASCII code.
1001 1000 is 25 of the ASCII code.
0101 1000 is ASCII code 26.
1101 1000 is ASCII code 27.
0011 1000 is ASCII code 28.
1011 1000 is the ASCII code 29.
0111 1000 is the ASCII code 30.
1111 1000 is the ASCII code 31.
0000 0100 is the ASCII code 32.
1000 0100 is the ASCII code 33.
0100 0100 is ASCII code 34.
1100 0100 is the ASCII code 35.
0010 0100 is 36 of the ASCII code.
1010 0100 is the ASCII code 37.
0110 0100 is ASCII code 38.
1110 0100 is the ASCII code 39.
0001 0100 is the ASCII code 40.
1001 0100 is the ASCII code 41.
0101 0100 is ASCII code 42.
1101 0100 is the ASCII code 43.
0011 0100 is 44 of the ASCII code.
1011 0100 is 45 of the ASCII code.
0111 0100 is 46 of the ASCII code.
1111 0100 is the ASCII code 47.
0000 1100 is 48 of the ASCII code.
1000 1100 is the ASCII code 49.
0100 1100 is the ASCII code 50.
1100 1100 is the ASCII code 51.
[0010] 1100 is 52 of the ASCII code.
1010 1100 is the ASCII code 53.
0110 1100 is ASCII code 54.
1110 1100 is the ASCII code 55.
0001 1100 is ASCII code 56.
1001 1100 is 57 of the ASCII code.
0101 1100 is ASCII code 58.
1101 1100 is the ASCII code 59.
[0011] 1100 is 60 of the ASCII code.
1011 1100 is 61 of the ASCII code.
0111 1100 is the ASCII code 62.
1111 1100 is the ASCII code 63.
0000 0010 is the ASCII code 64.
1000 0010 is the ASCII code 65.
0100 0010 is ASCII code 66.
1100 0010 is 67 of the ASCII code.
0010 is ASCII code 68.
1010 0010 is 69 of the ASCII code.
[0110] The ASCII code is 70.
1110 0010 is ASCII code 71.
0001 0010 is 72 of the ASCII code.
1001 0010 is 73 of the ASCII code.
0101 0010 is ASCII code 74.
1101 0010 is 75 of the ASCII code.
0010 0010 is ASCII code 76.
1011 0010 is 77 of the ASCII code.
0111 0010 is 78 of the ASCII code.
1111 0010 is ASCII code 79.
0000 1010 is the ASCII code 80.
1000 1010 is the ASCII code 81.
0100 1010 is the ASCII code 82.
1100 1010 is the ASCII code 83.
[0010] 1010 is ASCII code 84.
1010 1010 is the ASCII code 85.
0110 1010 is ASCII code 86.
1110 1010 is the ASCII code 87.
0001 1010 is the ASCII code 88.
1001 1010 is the ASCII code 89.
0101 1010 is the ASCII code 90.
1101 1010 is the ASCII code 91.
[0011] 1010 is the ASCII code 92.
1011 1010 is the ASCII code 93.
0111 1010 is the ASCII code 94.
1111 1010 is the ASCII code 95.
0000 0110 is 96 of the ASCII code.
1000 0110 is the ASCII code 97.
0100 0110 is ASCII code 98.
1100 0110 is the ASCII code 99.
0010 0110 is the ASCII code 100.
1010 0110 is 101 of the ASCII code.
0110 0110 is 102 of the ASCII code.
1110 0110 is 103 of the ASCII code.
0001 0110 is the ASCII code 104.
1001 0110 is 105 of the ASCII code.
0101 0110 is 106 of the ASCII code.
1101 0110 is 107 of the ASCII code.
0011 0110 is 108 of the ASCII code.
1011 0110 is 109 of the ASCII code.
0111 0110 is the ASCII code 110.
1111 0110 is the ASCII code 111.
0000 1110 is the ASCII code 112.
1000 1110 is the ASCII code 113.
0100 1110 is the ASCII code 114.
1100 1110 is 115 of the ASCII code.
[0010] 1110 is ASCII code 116.
1010 1110 is the ASCII code 117.
[0110] 1110 is the ASCII code 118.
1110 1110 is the ASCII code 119.
0001 1110 is the ASCII code 120.
1001 1110 is the ASCII code 121.
0101 1110 is the ASCII code 122.
1101 1110 is the ASCII code 123.
[0011] 1110 is the ASCII code 124.
1011 1110 is the ASCII code 125.
0111 1110 is the ASCII code 126.
1111 1110 is the ASCII code 127.
0000 0001 is 128 of the ASCII code.
1000 0001 is ASCII code 129.
0100 0001 is the ASCII code 130.
1100 0001 is the ASCII code 131.
[0010] 0001 is the ASCII code 132.
1010 0001 is the ASCII code 133.
[0110] 0001 is the ASCII code 134.
1110 0001 is 135 of the ASCII code.
0001 0001 is the ASCII code 136.
1001 0001 is the ASCII code 137.
0101 0001 is the ASCII code 138.
1101 0001 is ASCII code 139.
0001 0001 is the ASCII code 140.
1011 0001 is the ASCII code 141.
0111 0001 is the ASCII code 142.
1111 0001 is the ASCII code 143.
0000 1001 is the ASCII code 144.
1000 1001 is the ASCII code 145.
0100 1001 is ASCII code 146.
1100 1001 is the ASCII code 147.
[0010] 1001 is the ASCII code 148.
1010 1001 is ASCII code 149.
0110 1001 is the ASCII code 150.
1110 1001 is the ASCII code 151.
0001 1001 is the ASCII code 152.
1001 1001 is the ASCII code 153.
0101 1001 is ASCII code 154.
1101 1001 is the ASCII code 155.
[0011] 1001 is the ASCII code 156.
1011 1001 is the ASCII code 157.
0111 1001 is ASCII code 158.
1111 1001 is the ASCII code 159.
0000 0101 is the ASCII code 160.
1000 0101 is 161 of the ASCII code.
0100 0101 is the ASCII code 162.
1100 0101 is 163 of the ASCII code.
[0010] 0101 is the ASCII code 164.
1010 0101 is the ASCII code 165.
0110 0101 is the ASCII code 166.
1110 0101 is the ASCII code 167.
0001 0101 is the ASCII code 168.
1001 0101 is ASCII code 169.
0101 0101 is 170 of the ASCII code.
1101 0101 is 171 of the ASCII code.
[0011] 0101 is ASCII code 172.
1011 0101 is ASCII code 173.
0111 0101 is ASCII code 174.
1111 0101 is ASCII code 175.
0000 1101 is ASCII code 176.
1000 1101 is ASCII code 177.
0100 1101 is ASCII code 178.
1100 1101 is ASCII code 179.
[0010] 1101 is the ASCII code 180.
1010 1101 is ASCII code 181.
0110 1101 is ASCII code 182.
1110 1101 is the ASCII code 183.
0001 1101 is the ASCII code 184.
1001 1101 is the ASCII code 185.
0101 1101 is the ASCII code 186.
1101 1101 is the ASCII code 187.
[0011] 1101 is the ASCII code 188.
1011 1101 is ASCII code 189.
0111 1101 is 190 of the ASCII code.
1111 1101 is ASCII code 191.
0000 0011 is the ASCII code 192.
1000 0011 is the ASCII code 193.
0100 0011 is the ASCII code 194.
1100 0011 is the ASCII code 195.
0011 0011 is ASCII code 196.
1010 0011 is ASCII code 197.
0110 0011 is ASCII code 198.
1110 0011 is the ASCII code 199.
0001 0011 is the ASCII code 200.
1001 0011 is 201 of the ASCII code.
“0101” is the ASCII code 202.
1101 0011 is 203 of the ASCII code.
[0011] 0011 is the ASCII code 204.
1011 0011 is 205 of the ASCII code.
0111 0011 is 206 of the ASCII code.
1111 0011 is the ASCII code 207.
0000 1011 is the ASCII code 208.
1000 1011 is the ASCII code 209.
0100 1011 is 210 of the ASCII code.
1100 1011 is 211 of the ASCII code.
[0010] 1011 is the ASCII code 212.
1010 1011 is the ASCII code 213.
0110 1011 is the ASCII code 214.
1110 1011 is ASCII code 215.
0001 1011 is ASCII code 216.
1001 1011 is ASCII code 217.
0101 1011 is ASCII code 218.
1101 1011 is the ASCII code 219.
[0011] 1011 is the ASCII code 220.
1011 1011 is the ASCII code 221.
0111 1011 is the ASCII code 222.
1111 1011 is the ASCII code 223.
0000 0111 is ASCII code 224.
1000 0111 is the ASCII code 225.
0100 0111 is ASCII code 226.
1100 0111 is ASCII code 227.
0010 0111 is ASCII code 228.
1010 0111 is ASCII code 229.
0110 0111 is ASCII code 230.
1110 0111 is ASCII code 231.
0001 0111 is ASCII code 232;
1001 0111 is ASCII code 233.
0101 0111 is ASCII code 234.
1101 0111 is ASCII code 235.
0011 0111 is ASCII code 236.
1011 0111 is the ASCII code 237.
0111 0111 is ASCII code 238.
1111 0111 is ASCII code 239.
0000 1111 is the ASCII code 240.
1000 1111 is ASCII code 241.
0100 1111 is ASCII code 242.
1100 1111 is the ASCII code 243.
[0010] 1111 is ASCII code 244.
1010 1111 is ASCII code 245.
0110 1111 is ASCII code 246.
1110 1111 is the ASCII code 247.
0001 1111 is ASCII code 248.
1001 1111 is ASCII code 249.
0101 1111 is the ASCII code 250.
1101 1111 is ASCII code 251.
[0011] 1111 is ASCII code 252.
1011 1111 is the ASCII code 253.
0111 1111 is the ASCII code 254.
1111 1111 is the ASCII code 255.

The recording medium on which the two-division processing compression program of the present invention is recorded is an application for filing two inventions together. In the first invention, when compressing a file written in text characters, the file to be compressed is read 1 byte in binary format, and each time the read data is substituted from the first position of the array, the position to substitute 1 byte Shift and assign to the array one byte at a time. The index indicating the position of the array from which the data of the file to be compressed is read is divided into an odd number and an even number. Two arrays are created, and an array is created by collecting only data when the index indicating the position of the array from which the file to be compressed is read is an even number, and this is tentatively referred to as a first array. An array in which only data when the index indicating the position of the array into which the file to be compressed is read is an odd number is collected is referred to as a second array. This is a program that compresses a file by performing a run-length compression process on one of the first array and the second array that is left unremained as a reference. In the example, data assigned to the first array was run-length compressed. The second invention is a program for performing a decoding process for restoring a file compressed by the method of the first invention.

In the embodiment, the compression process of the text level compression uses a file recorded with text characters “Aiweo” as a test file. This test file is temporarily referred to as a compression target test file. See <Figure showing contents of test file to be compressed> in FIG. Suddenly, the present invention is a processing step that can compress only the compression target test file. Therefore, an index indicating the position of the array indicating the portion that has been run-length compressed in the compression process should be acquired and recorded, but not recorded, or run-length compression is performed in the header process during the compression process. An index indicating the position of the array indicating a non-existing portion should be acquired and recorded, but the processing step is missing such as not recording.

In the process of the compression process of the embodiment, a compressed file is created by using the compression target test file. However, it is necessary to determine in advance the contents of data to be recorded and the order of recording in the compressed file to be created. is there. This pre-determined rule is necessary when performing a process for restoring a compressed file created on a recording medium on which a two-part process compression program of the present invention is recorded based on a test target file to be compressed. Is the rule. The contents of the data to be recorded in the compressed file created in the compression process of the present invention and the order of recording will be described below, and the numerical values substituted in the embodiment will be described and described. The compression recording rule that defines the content to be recorded in the created compressed file and the recording order is as follows. The first data of the compressed file is recorded in 1 byte with the reference number as a numerical value, but the numerical value substituted in the embodiment is “5”. The second character of the compressed file is assigned the character string left as a reference. In the embodiment, the character code to be assigned is five characters “65, 67, 69, 71, 73”. To 5 bytes. The third data of the compressed file records what character code is compressed in 1 byte, but in the embodiment, the character code “131” is substituted. The last data rule is to record the number of characters of the compressed character code as a numerical value in 1 byte, but in the example, since “131” was 5 consecutive, The value “5” will be substituted. A rule that predetermines the content of data to be recorded in the created compressed file and the order in which the data is recorded is referred to as a compression recording rule. Since the compressed file is created with such a compression recording rule, the size of the created compressed file when the compressed file is created using the test file to be compressed is 8 bytes. The size of the created compressed file when creating a compressed file using the test file to be compressed will be explained a little more. The size of the compressed file is the number obtained by adding 1 to 5 of the number of data remaining as the reference data and the number of data in the portion where the run-length compressed data is recorded. Since the number of pieces of data in which the run-length compressed data is recorded is 2, the number obtained by adding 2 is the size of the compressed file. The number of data in the portion where the run-length compressed data is recorded is 2, but the breakdown of the data assigned to the array is what is the same character code as the character code for recording what character code is compressed. It is two of the numerical values to record whether it was a string of characters. In the case of the original run length compression, the character code and the numerical value indicating that the character from what number of what character in the original file is continuous are recorded in the compressed file, but it is limited to the test file to be compressed. Since the invention works, the rule is to only record how many characters in the original file are connected. This recording is based on the rule that two data are sequentially recorded at the end of the compressed file. The decoding process of the present invention is performed based on the above-described compression recording rule.

A decoding step of creating a compressed file using a compression target test file with the recording medium technology recording the two-division processing compression program of the present invention and returning the created compressed file to the state of the compression target test file before compression Call it. Even in the decoding process, an index indicating the position of the array indicating the part that has been run-length compressed in the compression process should be acquired and recorded, but not recorded, or run-length compression is applied to the header part in the compression process. The index indicating the position of the array indicating the part that is not performed should be acquired and recorded, but since it is a missing processing step such as not recording, run length compression that should be originally recorded in the header part is performed There is no processing step to read the index indicating the position of the array to clarify the performed part, there is no step to change the processing according to the index indicating the position of the read array, or the run that should have been recorded in the header part There is no processing step to read the index that indicates the position of the array to clarify the part that has not been length-compressed. Has become missing processing step, for example, no step of changing the processing by an index indicating the position of the elaborate array.

The compression target test files used in the examples are all files recorded in double-byte characters. Two sequences to be compressed using the regularity when ASCII codes are expressed in machine language used in computers, including improved products that support all other files, such as files with mixed single-byte characters. The process of the decoding process for restoring the file compressed by this method to run length compression or dictionary compression to one or both of the two divided arrays and the file compressed by this method is the 2 of the present invention. It is stated that this is a recording medium on which a divided processing compression program is recorded.

Since run-length compression and dictionary compression are already existing techniques in both the compression process and the decoding process, the paragraph [0012] shows that the present invention is a program to be compressed and a decoding process for restoring a compressed file to its original state. However, it is a matter of course that the program is basically not included in the patent of the recording medium on which the two-division processing compression program of the present invention is recorded. If this compression process does not include the run-length compression process, text that cannot be run-length compressed, files that cannot be dictionary compressed, files that cannot be run-length compressed and dictionary compressed, It can be said that it is software that enables compression with a high compression ratio by dividing the file to be compressed into two of the first array and the second array before compressing the file that can be dictionary compressed or run length compressed . In addition, the step of returning the compressed file created by using the technique of the present invention to the file to be compressed before compression, or the data read in the binary format before the file to be compressed is all first read in the array. Every time substitution is made from the position, the assignment position is shifted by 1 byte, and the decoding process to return to the array that has been assigned to the array by 1 byte compresses the array that has been divided into the first array and the second array. Shifting the position to be assigned by 1 byte each time the data that was previously read in binary format is read from the first position of the array and returning it to the state of the array assigned to the array by 1 byte, or It can be said that it is a program that performs a process of returning to a file to be compressed before compression.

In lossless compression, higher compression than before is possible. Lossy compression is a compression technology widely used for video images, television images, or audio files. However, lossless compression technology is also used for decoding video images, television images, or audio files. It has become an important technology. When used for compression technology such as video images, TV images, or audio files, it will be able to decode more accurately than before, and it will make a big difference in image clarity even with the same compression rate. . Of course, when compressing only video images, television images, audio files, etc., if only the compression rate is to be increased, the software of the present invention can be used to increase the compression rate more than before. I can do it.

The recording medium on which the two-part processing compression program of the present invention is recorded can be compressed even when a file that cannot be compressed at all or a part of the file that is compressed cannot be compressed. Therefore, the compression rate can be improved. Particularly in the case of image processing, conventionally, compression is usually performed in units of pixels. However, in the recording medium on which the two-division processing compression program of the present invention is recorded, there is no need to perform processing in units of pixels. Even an image file created in such a format does not need to be in a pixel state and can be processed as a file from the beginning to the end. Therefore, it becomes possible to perform processing faster than the compression process and decoding process in units of pixels. Even if it is used in image processing, it can be compressed even if it cannot be compressed, or even if a part of the file to be compressed cannot be compressed. It becomes possible to improve the rate. In addition, it is possible to obtain a high compression ratio because the compression of the present invention can be performed on a file that has already been compressed by the conventional technique.

In addition, run length compression, dictionary compression, and the like for the other array (the array with a larger number of assigned values and the second array) left as a reference in the embodiment of the present invention You can compress slide dictionary. Furthermore, dictionary compression and slide dictionary compression can be further performed on an array (first array) that has been run-length compressed without being left as a reference. Furthermore, after the compression process for both arrays, the whole can be run-length compressed, slide dictionary compressed or dictionary compressed. In this way, since compression can be performed by combining compression techniques, the compression ratio can be greatly increased as a whole. It is stated that the compression software created by these combinations is also a repertoire of the present invention.

The following FIG. 2, FIG. 3, FIG. 4, FIG. 5, and FIG. Also, in the branch processing of the embodiment, there is a case where it is not described what to do when it does not correspond to the branch condition, but if it is not described what to do when it does not correspond to the branch condition, no processing is performed. That's it. In the implementation, a program was created using a compiler called Visual Stadio2005 C # of MicroSoft Corporation.

The recording medium on which the two-division processing compression program of the present invention is recorded is a program that operates with hardware resources as shown in <Explanation of equipment used in the present invention> in FIG. The hardware resources as shown in <Explanatory drawing of equipment used in the present invention> in FIG. 3 are the total of the computer main body indicated by symbol I, the monitor indicated by symbol H, the keyboard indicated by symbol J, and the mouse indicated by symbol K. Although this equipment is composed of four parts, the equipment composed of a total of four parts is generally called a computer. The computer body indicated by symbol I is a computer called a DOS / V computer. The computer main body indicated by symbol I incorporates a recording medium such as a hard disk drive or a device called a CPU or main body memory, and the recording medium storing the two-part processing compression program of the present invention is the computer indicated by symbol I. It is assumed that it is installed in a recording medium such as a hard disk drive inside the main body. When the software of the present invention is installed in a recording medium such as an external hard disk drive connected to the computer main body of Fig. I, and the software of the present invention can be started from the computer main body of Fig. I It is assumed that the software of the present invention is installed in a recording medium such as an external hard disk drive connected to the computer main body denoted by reference numeral I. It is installed on a recording medium such as a hard disk drive inside the computer main body indicated by the symbol I in which the software of the present invention is installed, or on a recording medium such as an external hard disk drive connected to the computer main body indicated by the symbol I. When the software of the present invention is started up, the necessary amount of software of the present invention is read into the main body memory built in the computer main body indicated by the reference symbol I in a timely manner. The necessary amount of time is read by the CPU written in the software of the present invention, which is read in a timely manner into the main body memory built in the computer body of the symbol I, and is read into the required amount of CPU when necessary. The recording medium in which the two-division processing compression program of the present invention is recorded by the computer is operated by executing the instruction sentence read into the CPU by the CPU. Therefore, in a simple expression, it will be described in what process the recording medium on which the two-division processing compression program of the present invention is recorded is processed using hardware resources. The two-division processing compression program of the present invention is recorded. The command statement written on the recording medium can be re-expressed as being processed by the CPU of the computer body.

As described in paragraph [0022], the software operates on hardware resources as shown in <Explanatory diagram of equipment used in the present invention> in FIG. It is not limited to the hardware resources as shown in the explanatory diagram of the equipment used in Fig. 1. The monitor with the symbol H, the computer body with the symbol I, the keyboard with the symbol J, and the mouse with the symbol K are integrated. There are various types, such as the one without the mouse with the symbol K, the monitor with the symbol H, and the computer body with the symbol I integrated. It is thought that computers of various shapes will be developed in the future. Even if it is not a hardware resource as shown in <Explanatory diagram of equipment used in the present invention> in FIG. 3, a so-called computer can be operated by a recording medium in which the two-division processing compression program of the present invention is recorded. Even in the case of the recording medium, it is clearly stated that the recording medium records the two-division processing compression program of the present invention.

In the following paragraphs, it is described that arrays and variables are created. However, the locations where the arrays and variables are created are created in the main body memory inside the computer main body indicated by symbol I. However, it may be created in the virtual memory area by software called an OS. The virtual memory area is a hard disk in the computer main body of the symbol I used when a part of a recording medium such as a hard disk drive in the computer main body of the symbol I is virtually used as the main memory. A part of a recording medium such as a drive. The figure memory I used when the main body memory inside the computer main body indicated by the reference numeral I or a part of a recording medium such as a hard disk drive inside the computer main body indicated by the reference numeral I is virtually used as the main body memory. A part of a recording medium such as a hard disk drive in the computer main body is called a memory device inside the computer. Therefore, if the place where an array or variable is created when it is described that an array or variable is created is explained in a simple way, it will be created in a memory device inside the computer. .

In the following paragraphs, it may be described that data is assigned to the end of the array. If there is still no data assigned to the array, the data is usually assigned to the first position of the array. However, every time you assign from the first position of the array, the position to be assigned is shifted by 1 byte, and when assigning data by 1 byte, after assigning the data to the first position of the array, the data assigned to the array Is assigned to the next position of the data at the last position. In this case, the position specification after data is already assigned to the first position of the array can be expressed as the end. If there is still no data assigned to the array, and every time you assign from the first position of the array, the assignment position is shifted by 1 byte and the data is assigned to the array by 1 byte. Even when substituting, it can be expressed by substituting data at the end of the array. So, every time you assign from the first position of the array, the position to be assigned is shifted by 1 byte, and if you assign data to the array by 1 byte, even if you assign to the first position of the array, It may be described that it is assigned at the end. Also, in the following paragraphs, when assigning 1 byte each to the array by shifting the assignment position by 1 byte each time it is assigned from the first position of the array, the order of the data to be assigned to the array is refused. When there is no writing, it is assumed that the original data acquired (created data, acquired data, read data, data assigned to the original array, etc.) is assigned to the array one byte at a time.

In the following paragraphs, all programs are created using one-dimensional arrays, but the same processing can be performed by using multidimensional arrays or files. Also, the same processing can be performed by combining a one-dimensional array, a multi-dimensional array, and a file. It is clear that these are differences in the way of writing the program, all of which are simply the repertoire of the present invention.

Further, in the following paragraphs, in the case of the automatic processing by the computer and the recording medium on which the two-division processing compression program of the present invention is recorded, the recording medium in which the two-division processing compression program of the present invention is recorded and the automatic processing by the computer each time. Do not describe something. When it is not described, it is automatic processing by a recording medium on which the two-division processing compression program of the present invention is recorded and a computer. However, the <flowchart diagram of the recording medium on which the two-division processing compression program of the present invention is recorded> in FIG. 1 includes an artificial manual operation or input of the symbol L and the two-division of the present invention of the symbol M It was decided to divide it into two types: a recording medium on which a processing compression program is recorded and an automatic processing by a computer. A recording medium on which the following two-division processing compression program is recorded and a CPU instruction statement describing the processing steps of the automatic processing portion by the computer are referred to as a program. In addition, there is a case where nothing is written because adjustment of the size of the array is considered to be a common-sense technique for the operator. In addition, there is a case where nothing is written because the conversion processing of the array type is considered to be a common sense technique for the operator. In addition, there is a case where nothing is written about the variable type because it is considered to be a common sense technology for the operator.

See <Flowchart of recording medium on which the two-division processing compression program of the present invention is recorded> in FIG. Step numbers are given to the manual operation of the figure L or the automatic processing by the input and the recording medium recording the two-division processing compression program of the present invention of the figure M and the computer, in order of the step numbers. explain. First, when the recording medium on which the two-division processing compression program of the present invention is recorded is activated, an operation screen such as the <operation screen diagram of the recording medium on which the two-division processing compression program of the present invention is recorded> in FIG. Displayed on the monitor.

A case will be described in which a file to be compressed is compressed using a recording medium in which the two-division processing compression program of the present invention is recorded. This is tentatively referred to as a compression process. The technology required in this compression process can be achieved by using a technique for creating a file compressed by a generally known method for performing run length compression (compression method) or a technique for compressing an array. . A file created by this generally known run-length compression technique or a technique for creating a compressed array is a common-sense technique for the operator.

A process for compressing a file written in text characters will be described. A text file with “Iueo” written in a horizontal line was prepared. This prepared text file is called a compression target test file. See <Figure showing contents of test file to be compressed> in FIG.

Proceed to step 101. Step 101 is an artificial process. A reference button indicated by a symbol G is clicked using an input device such as a mouse indicated by a symbol K. Thus, since the inside of the recording medium can be browsed, a file to be compressed is selected from the recording medium. When selected, the full path of the file to be compressed is input to the text box for designating the file to be compressed by the two-part process A in FIG. In addition, it is possible to directly input into a designated text box of a file to be compressed by the two-division process of FIG. A using an input device such as a keyboard of FIG. Here, the test file to be compressed is selected and designated in the designation text box of the file to be compressed by the two-part process of FIG.

Using an input device such as a mouse indicated by symbol K, an execution button indicated by symbol F is clicked. Then, the compression process of the recording medium on which the two-division process compression program of the present invention is recorded starts. In step 103 of <the flowchart of the recording medium on which the two-division processing compression program of the present invention is recorded> in FIG. 1, the division processing is written, but in the recording medium on which the two-division processing compression program of the present invention is recorded. This is a two-part process step. Note that step 107 in <flowchart diagram of recording medium on which the two-division processing compression program of the present invention is recorded> in FIG. 1 has a description of division processing. This is the two-division processing compression of the present invention. This is not a two-part process in the recording medium on which the program is recorded.

Proceed to step 102. Based on the full path file name entered in the text file specification text box of Figure A, the file to be compressed As the file to be compressed, the test target file is searched from a recording medium such as a hard disk drive and the file is in binary format. Is read one byte at a time. Create an array with a size that can be substituted for all the data read in the binary format of the test file to be compressed. This array is tentatively referred to as a tentative name A array. Each time the data read from the compression target test file is assigned to the A array from the first position of the A array, the assignment position is shifted by 1 byte, and the data read from the compression target test file is assigned by 1 byte.

Proceed to step 103. The array size of the A array is 10 bytes in ASCII code because it is the full-width 5 characters in the character string “Aiweo” written in the test file to be compressed. Two arrays are created by dividing the array size of the A array by 2 and are temporarily referred to as a first array and a second array. Iterates from the beginning to the end of the A array. This repetition process is referred to as a temporary name, a separate repetition process. In separate repetition processing, there is a remainder when the index indicating the position where the data of the A array is assigned is divided by 2, and there is no remainder when the index indicating the position where the data of the A array is assigned is divided by 2 Branch to.

This branch is tentatively referred to as branch 1. If there is no remainder obtained by dividing the index indicating the position where the data of the A array of branch 1 is assigned by 2, it is an even number. If there is no remainder when the index indicating the position where the data of the A array in branch 1 is assigned is divided by 2, the index indicating the position where the data assigned to the A array is assigned is used as the A array. The data assigned to is acquired, and the acquired data is assigned to the end of the first array. If there is a remainder obtained by dividing the index indicating the position where the data of the A array of branch 1 is assigned by 2, it is an odd number. If there is a remainder obtained by dividing the index indicating the position where the data of the A array in branch 1 is assigned by 2, the index indicating the position where the data assigned to the A array is assigned is used as the A array. The data assigned to is acquired, and the acquired data is assigned to the end of the second array. This ends branch 1. When processing has been completed for all data assigned to the A array, the separate repetition processing is terminated.

Proceed to step 104. All of the first position data assigned to the first array is sequentially displayed in a list box that displays the contents of the first array of FIG. All the data of the first position assigned to the second array is sequentially displayed in a list box that displays the contents of the second array of the figure B, one byte at a time. Next, run length compression is performed on all data assigned to the first array. Files that have been compressed using the run-length compression method (compression method) and the run-length compression method, or the original file that has not been compressed, or the method of restoring the sequence (restoration method), is the relevant operator. It is a common-sense technique.

One data is 1 byte, and an array is created with a size that can be substituted for two data. In other words, creating an array with a 1-byte type and an array size of 2. This arrangement is tentatively referred to as a run-length compression arrangement. From here, the process of substituting data into the run-length compressed array is performed. For the data to be assigned to the first position of the area where the data of the run-length compressed array can be assigned, the character code indicating what the character code is compressed is assigned. The data to be assigned to the last position of the area where the run-length compressed array data can be assigned is the number of character codes assigned to the first position of the area where the run-length compressed array data can be assigned. Substitute the number of characters to record that it was. Data assigned to the first position of the first array is acquired and assigned to the first position of the run-length compressed array. A variable is created with a 1-byte type, and this variable is temporarily called a count variable. Assign 0 as the initial value to the count variable.

The following iterative process is performed for all data assigned to the first array. This repetition process is tentatively referred to as a character code run length process. In the character code run length process, the data assigned to the first position of the run length compressed array is compared with all the data assigned to the positions from the first position to the end of the first array. The position of the data assigned to the first array being compared and inspected is temporarily referred to as the position of interest. In character code run-length processing, if the data assigned to the first position of the run-length compressed array and the data at the target position of the first array are the same data, the numerical value obtained by adding 1 to the numerical value assigned to the count variable Is calculated, the count variable is overwritten, and the target position of the first array is advanced by one to perform comparison inspection with the data at the next position assigned to the first array. If the data assigned to the first position of the run-length compressed array is different from the data at the target position of the first array, do nothing and advance the target position of the first array by one. A comparison check is performed with the data at the next position assigned to the array. Processing to compare all data assigned to the first array with the data assigned to the first position of the run-length compressed array by shifting the target position from the first position to the end of the first array I do. When all the data assigned to the first array and the data assigned to the first position of the run-length compressed array are compared and checked, the character code run-length process is terminated. In the character code run-length process, only the data assigned to the first position of the run-length compressed array is compared with all the data assigned to the first array. Since the recording medium on which the processing compression program is recorded operates only on the compression target test file described in paragraph [0030], the data assigned to the first position of the inspection data array is the first array. This is a simple process of comparing and checking with all data assigned to. For this reason, when the data is substituted only at the first position of the run-length compressed array, a simple processing process is performed in which the character code run-length process is performed. At this point, no data is assigned to the run-length compressed array other than the one data assigned to the first position, so it is not possible to check other data. There is a possibility that the explanation itself is unclear, but it is described once.

The numerical value assigned to the count variable is assigned to the end of the run-length compressed array (the last position in the area where numerical values can be assigned). At this point, the processing step of assigning data to the run-length compressed array is completed.

An array is created using the value obtained by adding 1 to the value obtained by adding the size of the array of the second array and the size of the array of the run-length compressed array as the size of the array. This array is tentatively referred to as a compressed array. Perform processing to assign data to the created compressed array. Data for substituting data required in the decoding process is called header data, a variable is created with a 1-byte type, and this variable is temporarily called a header variable. Substitute the size of the second array into this header variable. That is, the size of the second array is header data. The array size of the second array is the size of the portion of the character string that is left as a standard without compressing the compression target test file written in the text format written in a horizontal row as “Aiueo”. Since it is half the size of the target test file, a value of 5 is substituted. Assign the header variable data to the first position of the compressed array.

Each time all data from the first position assigned to the second array to the last position is assigned to the end of the compressed array, the position to be assigned is shifted by 1 byte and assigned by 1 byte. At the end of the compressed array, all the data from the beginning to the end of the run-length compressed array is substituted 1 byte at a time, with the position to be substituted 1 byte shifted. At this point, the process of assigning data to the compressed array is completed. A compressed file is created by adding all the data from the beginning to the end of the compressed array in binary format to the end of the file one byte at a time and saving it. The compression process ends. A recording medium that can be read by a computer that records a program for causing a computer to execute the processing of the compression process so far is the first invention.

When run-length compression of a technique that is already generally known is performed on all data assigned to the first array, the same processing as in paragraphs [0031] to [0036] is performed. Then, a run length compressed array is created. Every time 1 byte is assigned to the position from the beginning to the end of the area where the data of the array of the run length compression array can be assigned, the data created when the run length compression of the already known technique is performed Shift the position to substitute and substitute 1 byte at a time. An array is created using the value obtained by adding 1 to the value obtained by adding the size of the array of the run-length compressed array and the size of the array of the second array as the array size. This array is tentatively referred to as a compressed array. Perform processing to assign data to the created compressed array. Data for substituting data required in the decoding process is called header data, a variable is created with a 1-byte type, and this variable is temporarily called a header variable. Substitute the size of the second array into this header variable. That is, the size of the second array is header data. The array size of the second array is the size of the portion of the character string that is left as a standard without compressing the compression target test file written in the text format written in a horizontal row as “Aiueo”. Since it is half the size of the target test file, a value of 5 is substituted. Assign the header variable data to the first position of the compressed array. Each time all data from the first position assigned to the second array to the last position is assigned to the end of the compressed array, the position to be assigned is shifted by 1 byte and assigned by 1 byte. At the end of the compressed array, all the data from the beginning to the end of the run-length compressed array is substituted 1 byte at a time with the position shifted by 1 byte each time it is assigned. At this point, the process of assigning data to the compressed array is completed. A compressed file is created by adding all the data from the beginning to the end of the compressed array in binary format to the end of the file one byte at a time and saving it. Such a processing step is a compression step.

<Operation screen diagram showing a state in which a compressed file is created by the compression process for the compression target test file> in FIG. 5 is a state where the compression process has been completed.

Next, a description will be given of a case where a compressed file created using a recording medium on which the two-division processing compression program of the present invention is recorded is returned to a file in a state before being compressed. In addition, a file created by the process of returning a compressed file created using a recording medium recording the two-division processing compression program of the present invention to a file in a state before being compressed is temporarily called a restored file. A file is created by performing processing to return the compressed file created in the compression process to the original state before compression. The file to be created is tentatively called a restored file, and the compressed file is created in the compression process described in paragraph [0014]. The decompressed file is created using the compression recording rule used when creating the file. The step of returning the compressed file created in the compression step of the recording medium recording the two-division processing compression program of the present invention to the file in the state before being compressed is temporarily called a decoding step. The technology required for this decoding step is a method of compressing a file compressed by a generally known method of performing run-length compression (compression method), or returning an array to its original uncompressed state or compression. It is also possible to use a method (restoration method) to restore the original array state that has not been performed. The method of returning the run-length compressed file or the sequence to the original uncompressed file or sequence is a common-sense technique for the business operator. This decoding process is performed after the compression process. This is because the decryption process cannot be performed unless there is a compressed file.

Proceed to step 105. Step 105 is an artificial process. A reference button indicated by a symbol G is clicked using an input device such as a mouse indicated by a symbol K. As a result, it is possible to browse the recording medium such as a hard disk, so that the recording medium technology in which the two-part processing compression program of the present invention is recorded from the recording medium such as the hard disk is used on the basis of the test file to be compressed. Select the compressed file created by compressing. When selected, the full path of the compressed file is input to the text box for designating the file to be compressed by the two-part process A in FIG. In addition, it is possible to directly input into a designated text box of a file to be compressed by the two-division process of FIG. A using an input device such as a keyboard of FIG. Here, the compressed file created in the compression process is selected and designated in the designation text box of the file to be compressed by the two-part process of FIG. Using an input device such as a mouse indicated by symbol K, a decoding button indicated by symbol E is clicked.

Proceed to step 106. The size of the file input in the designated text box for the file to be compressed in FIG. A divided into two is acquired. A method for acquiring the size of the file can be acquired by examining how many bytes the file is. Usually, since a program for obtaining the file size is prepared in software used for creating a program called a compiler used, the file size is obtained using the prepared program. It is also possible to obtain the file size by creating a program by yourself. In the case of self-made, it is possible to obtain the number of bytes by counting while reading the file one byte at a time, and obtaining the numerical value after the count is completed after reading the file to the end. You can also read all of the file from the beginning to the end, get the number of bits read, and divide the number of bits acquired by 8 to get the number of bytes. These methods are already commonly known methods and are common sense in the business operators concerned. The file input to the file designation text box for the two-part process compression shown in Fig. A is a compressed file created in the compression process. The size of this file is acquired, and the array is arranged with the size of the acquired file. It is created and this sequence is tentatively referred to as an Ad sequence. Search for the compressed file created in the compression process entered in the text box for specifying the file to be compressed in figure A by the compression process, and read all 1 byte at a time in binary format. Every time you substitute from the position of, shift the position to be substituted by 1 byte, and substitute the data read from the compressed file 1 byte at a time in binary format into the Ad array 1 byte at a time.

Proceed to step 107. The data assigned to the first position of the Ad array is acquired, the acquired data is tentatively referred to as the reference data number, and the array is created with the reference data number as the array size. This array is tentatively referred to as a second array. From here, the process of substituting data into the second array is performed. Each time you assign from the first position to the last position of the second array, the position to be assigned is shifted by 1 byte, and the data assigned to the second and subsequent positions of the Ad array is assigned to the second array by 1 byte. When the assignment to the last position of the second array is completed, the process of assigning data to the second array is terminated.

The numerical value assigned to the last position of the Ad array is acquired, and an array is created with the acquired numerical value as the size of the array. This created array is tentatively referred to as a first array. From here, the process of substituting data into the first array is performed. The numerical value assigned to the position 1 byte before the last position of the Ad array is acquired, and the acquired numerical value is assigned to all positions from the first position to the last position of the first array. Thus, the process of assigning data to the first array is completed. Since the numerical value assigned to the position 1 byte before the last position of the Ad array is assigned a character code indicating what character code is compressed, what is the character that says what the obtained numerical value is? If the same character code is assigned 1 byte at a time from the beginning to the end of the first array for the numerical value assigned to the last position of the Ad array that records whether the characters are connected, the original first array It is possible to return to this state, so this processing step is performed.

Proceed to step 108. The size of the array of the first array and the size of the array of the second array are acquired, and an array is created with the numerical value obtained by adding both the acquired numerical values as the array size. The created array is tentatively referred to as a decoding result array. Two variables are created in a 1-byte type, and the created two variables are tentatively called a count variable 1 and a count variable 2, respectively. Substitute a numerical value of 0 as the initial value for the count variable 1. Substitute a numerical value of 0 as the initial value for the count variable 2. Create a variable with 1 byte type. The created variable is tentatively called an odd number. The following iterative process is performed to assign all data to the decoding result array. This iterative process is tentatively referred to as a decoding result iterative process. In the decoding result repetition process, all indexes from the index indicating the first position of the decoding result array to the index indicating the last position are acquired one by one in order, and the acquired index is overwritten with odd numbers (only the first Is assigned to odd numbers, not overwritten). Each time the numerical value assigned to the odd odd number is changed by assigning the numerical value to the odd odd number (including the numerical value initially assigned to the odd odd number), the following processing is performed. Branch processing is performed when the numerical value assigned to the odd number divided by 2 is 0 (even number) and not 0 (odd number). This branch is tentatively referred to as branch 2. In this branch 2, if the numerical value assigned to the odd number is divided by 2 and the value is 0 (even), the numerical value assigned to the number variable 1 is obtained, and the obtained numerical value is The data assigned to the first array is obtained by using it as an index, and the numerical value assigned to the odd number is used as the index of the decoding result array and assigned to the index position of the decoding result array. Next, 1 is added to the numerical value assigned to the number variable 1. The numerical value of the next index is acquired and assigned to the odd number by overwriting. In this branch 2, if the numerical value assigned to odd odd number divided by 2 is not 0 (in the case of odd number), the numerical value assigned to number variable 2 is acquired, and the acquired numerical value is stored in the second array. The data assigned to the second array is obtained as an index of the data, and the numerical value assigned to the odd number is used as the index of the decoding result array, and assigned to the index position of the decoding result array. Next, 1 is added to the numerical value assigned to the number variable 2. The numerical value of the next index is acquired and assigned to the odd number by overwriting. At this point, the branch 2 is completed. When this process is completed for all indexes attached to the decoding result array, the decoding result repetition process is terminated.

When a compressed file is created using the run-length compression technique already known in the above-described compression process, the decoding process is as follows. Acquires the data that indicates from which position of the Ad sequence the run-length compressed part recorded in the Ad sequence is recorded from all the data in which the run-length compressed part is assigned to the Ad array. Then, the run-length compressed part based on the acquired data is extracted from all the data assigned to the Ad array, and the extracted data is assigned from the first position to the last position of the first array Shift the position to be substituted by 1 byte each time. The data of the part excluding the run-length compressed part recorded in the Ad array is extracted from the data recorded in the Ad array, and it is 1 byte each time it is substituted from the first position to the last position of the second array. Substitute the position to substitute. After the data is assigned to the first array and the second array, the process of paragraph [0049] is performed, the processes of paragraphs [0051] to [0052] are performed, and the process ends.

All the data assigned to the decoding result array is acquired one byte at a time, and all the data is displayed in the list box that displays the decoding result of the graphic code D.

A restoration file is created by adding all the data from the beginning to the end assigned to the decoding result array to the end of the file one byte at a time in binary format and recording and saving it. The decoding process ends. A recording medium that can be read by a computer that records a program for causing a computer to execute the processing steps so far is a second invention.

FIG. 6 is an operation screen diagram showing a state in which the compressed file created from the compression target test file is subjected to the decryption process. FIG.

The method of obtaining the index attached to the array in paragraph [0049] is a common-sense technique for the operator. There seems to be no need to explain, but I will explain a little. If you are using a program used to create a program called a compiler, the program called this compiler will automatically increase the number from 0 to 1 in order from the beginning to the end of the array. It is attached. This has been explained in paragraph [0006]. In the case of an array having an array size of 10, an index is automatically assigned a numerical value from 0 to 9 by a program called a compiler. Therefore, a numerical value from 0 to 9 becomes an index of the array. Although it is described that the index from the beginning to the end of the array of paragraph [0049] is acquired one by one, the method of acquiring the index is to create a serial number from 0 to the last position of the array, This is achieved by acquiring numerical values one by one from the serial number. In the case where the size of the array is 10, it means that 10 numerical values from 0 to 9 are created and acquired one by one. You can specify the index of the array when specifying the position of the array, but you cannot get the index from the assigned data. An ordinary index acquisition method is to acquire the same numerical value as the index by counting the position of the assigned data one by one from 0 to obtain the numerical value.

The flowchart figure of the recording medium which recorded the 2 division | segmentation process compression program of this invention Operation screen diagram of a recording medium on which the two-division processing compression program of the present invention is recorded Illustration of the equipment used in the present invention Figure showing contents of test file to be compressed Operation screen showing the compressed file created by the compression process for the test file to be compressed Operation screen showing a state where the compressed file created from the test file to be compressed is processed in the decryption process

A: Designating text box for file to be divided into two parts B: List box for displaying the contents of the first array C: List box for displaying the contents of the second array D: List box for displaying the decoding result E: Decoding button F : Execution button G: Reference button H: Monitor I: Computer main body J: Keyboard K: Mouse L: Artificial manual operation or input M: Recording medium recording the two-part processing compression program of the present invention and automatic by computer processing

Claims (2)

In the following, it is described that arrays and variables are created, but the place where arrays and variables are created is to be created in the internal memory inside the computer, and all variables and arrays are 1 byte type. If you assign the data to the array by shifting the assignment position by 1 byte each time you assign from the first position of the array, the following is the case of assigning to the first position of the array Even if there is a case where it is described to be assigned to the end of the array, there is a case where it does not describe what to do when it does not meet the branch condition in the following branch processing, but it does not correspond to the branch condition If you do not describe what to do, do nothing, and use text characters that are normally used on computers (in Japan, two-byte ASCII code representing one character and ASCI). An I-code half-width character) is called a text character, or a text character is called a character code. When substituting data into an array one byte at a time, an array If there is no notice about the order of the data to be assigned to, an array of 1 byte according to the order of the acquired original data (created data, acquired data, read data, data assigned to the original array, etc.) In the following, the type of array means the number of bits or bytes used in the main memory of the computer that uses one piece of data that can be assigned to the array. The variable has the same type, but the variable type is exactly the same as the array type, and the size of the array is the number of data that can be assigned to the array. In the following, the array index means the number indicating the position of the data to be assigned to the array, and the index assigned to the first position of the area where the array data can be assigned is number 0, A numerical value that is incremented one by one is added to each array position where array data can be assigned, and the text file written in the horizontal line as “Aiweo” is the test file to be compressed. The following program will create a compressed file using the compression target test file, but this rule is necessary when performing the process to restore the compressed file to its original state before compression. Yes, the rule that predetermines the contents of data to be recorded in the compressed file to be created and the order of recording is tentatively called the compression recording rule. The first data is recorded as 1 byte with the reference number as a numerical value, the second data of the compressed file is substituted with the character string left as the reference, and the third data of the compressed file is It shall be recorded in 1 byte whether the character code is compressed, and the last data shall be recorded as a numerical value of 1 byte, which is the number of recorded characters indicating how many compressed character codes are connected. Is a compression recording rule, and an array is created with a size that can be substituted for all the data read from the test file to be compressed in binary format. The created array is tentatively named A array, and the data read from the test file to be compressed into A array Each time a value is assigned from the first position in the A array, the assignment position is shifted by 1 byte, and the data read from the test file to be compressed is incremented by 1 byte. Substitute and create two arrays by dividing the array size of A array by 2 and tentatively name them as the first array and the second array, and repeat the process from the beginning to the end of the A array. This is tentatively called separate repetition processing. In separate repetition processing, there is a remainder when the index indicating the position where the data of the A array is assigned is divided by 2, and the index indicating the position where the data of the A array is assigned is 2. If there is no remainder when divided by 1, this branch is tentatively called branch 1, and if there is no remainder when the index indicating the position where the data of the A array of branch 1 is assigned is divided by 2, A Get the data assigned to the A array using the index that indicates the position where the data assigned to the array is assigned, and assign the obtained data to the end of the first array. If there is a remainder when the index indicating the position where the column data is assigned is divided by 2, the data assigned to the A array using the index indicating the position where the data assigned to the A array is assigned Is obtained, and the obtained data is assigned to the end of the second array, and branch 1 is terminated. When all the data assigned to the A array has been processed, the separate repetition process is terminated and the 1-byte type is obtained. Create an array with an array size of 2 and tentatively name this array as a run-length compressed array. From here, the process of assigning data to the run-length compressed array is performed, and the data of the run-length compressed array is assigned. For the data to be assigned to the first position of the area that can be used, the character code indicating what the character code is compressed is assigned, and the data of the run-length compressed array is assigned. -The data to be assigned to the last position of the area where the value can be assigned is a record of how many consecutive character codes were assigned to the first position of the area where the data of the run length compression array can be assigned. The number of characters to be substituted is assigned, the data assigned to the first position of the first array is obtained, assigned to the first position of the run-length compressed array, a variable is created with a 1-byte type, and this variable Is temporarily called a count variable, and 0 is assigned to the count variable as an initial value, and the following iteration is performed for all data assigned to the first array. This iteration is called character code run-length processing. However, the character code run-length process is performed using the data assigned to the first position of the run-length compressed array and all data assigned to the positions from the first position to the end of the first array. The position of the data assigned to the first array being compared and inspected is tentatively referred to as the position of interest. In the character code run-length process, the data assigned to the first position of the run-length compressed array If the data at the position of interest in the first array is the same data, calculate the value obtained by adding 1 to the numerical value assigned to the count variable, overwrite the count variable, and change the position of interest in the first array. By proceeding one step, the data at the next position assigned to the first array will be compared and checked, and the data assigned to the first position of the run-length compressed array is different from the data at the target position of the first array. If it is data, do nothing, and advance the attention position of the first sequence by one to compare with the data of the next position assigned to the first array, and the attention position of the first sequence By shifting from the first position to the last position, all the data assigned to the first array is compared with the data assigned to the first position of the run-length compressed array. When all the data assigned to the array is compared with the data assigned to the first position of the run-length compressed array, the character code run-length processing is terminated, and the count variable is assigned to the end of the run-length compressed array. This completes the process of assigning data to the run-length compressed array so far, and 1 is added to the value obtained by adding the size of the array of the second array and the size of the array of the run-length compressed array. Create an array with numeric values as the size of the array, tentatively name this array as a compressed array, and perform processing to assign data to the created compressed array. Create and tentatively call this variable a header variable, assign the size of the second array array to this header variable, assign the header variable data to the first position of the compressed array, and add the second variable to the end of the compressed array. Every time all data from the first position assigned to the array to the last position is assigned, the assignment position is shifted by 1 byte, and assigned 1 byte at a time. At the end of the compressed array, the run-length compressed array starts from the end. Every time all the data up to is substituted, the substitution position is shifted by 1 byte and substituted by 1 byte, so far, the process of assigning data to the compressed array is completed, and all the data from the beginning to the end of the compressed array are finished. A program that records the program that causes the computer to execute the process of creating a compressed file by adding data to the end of the file in binary format and recording and saving it. Recording medium can be pewter reads In the following, it is described that arrays and variables are created, but the place where arrays and variables are created is to be created in the internal memory inside the computer, and all variables and arrays are 1 byte type. If you assign the data to the array by shifting the assignment position by 1 byte each time you assign from the first position of the array, the following is the case of assigning to the first position of the array Even if there is a case where it is described to be assigned to the end of the array, there is a case where it does not describe what to do when it does not meet the branch condition in the following branch processing, but it does not correspond to the branch condition If you do not describe what to do, do nothing, and use text characters that are normally used on computers (in Japan, two-byte ASCII code representing one character and ASCI). An I-code half-width character) is called a text character, or a text character is called a character code. When substituting data into an array one byte at a time, an array If there is no notice about the order of the data to be assigned to, an array of 1 byte according to the order of the acquired original data (created data, acquired data, read data, data assigned to the original array, etc.) In the following, the type of array means the number of bits or bytes used in the main memory of the computer that uses one piece of data that can be assigned to the array. The variable has the same type, but the variable type is exactly the same as the array type, and the size of the array is the number of data that can be assigned to the array. In the following, the array index means the number indicating the position of the data to be assigned to the array, and the index assigned to the first position of the area where the array data can be assigned is number 0, A numerical value that is incremented one by one is added to each array position where array data can be assigned, and the text file written in the horizontal line as “Aiweo” is the test file to be compressed. The file is created by performing the process of restoring the compressed file created in [Claim 1] to the original state before compression. The file to be created is tentatively called a restored file, and [Claim 1]. The decompression file is created using the compression recording rule of, the size of the compressed file created in [Claim 1] is obtained, and an array is created with the obtained size of the compressed file. The created array is tentatively named Ad array, and the compressed file created in [Claim 1] is read in 1 byte in binary format, and the substitution position is shifted by 1 byte each time it is substituted from the first position of Ad array. The data read from the compressed file in binary format in 1 byte is substituted into the Ad array by 1 byte, the data assigned to the first position of the Ad array is obtained, and the obtained data is tentatively referred to as the reference data number. Create an array with the number of data as the size of the array, tentatively name this array as the second array, and assign data to the second array from here, from the first position to the last position of the second array Each time it is assigned, the assignment position is shifted by 1 byte, the data assigned after the second of the Ad array is assigned to the second array by 1 byte, and the assignment to the last position of the second array is completed. Finishes the process of assigning data to the second array, obtains the numerical value assigned to the last position of the Ad array, creates an array with the obtained numerical value as the size of the array, and creates this array Tentatively named as the first array, and from here the data is assigned to the first array, and the numerical value assigned to the position 1 byte before the last position of the Ad array is obtained and obtained. Substituting numerical values into all positions from the first position to the last position of the first array, and ending the process of assigning data to the first array so far, the size of the array of the first array and the second The array size is obtained, and an array is created with the number obtained by adding both of the obtained values as the array size. The created array is tentatively called the decoding result array, and two variables of 1 byte type are created. Then, the created two variables are each set to the number of times variable 1 , Tentatively named the number variable 2, assign a numerical value of 0 as the initial value to the number variable 1, assign a numerical value of 0 as the initial value to the number variable 2, create a variable with a 1-byte type, and the created variable is odd The following iterative process is performed in order to assign all data to the decoding result array, and this iterative process is tentatively referred to as a decoding result repetition process. In the decoding result repetition process, the first position of the decoding result array All the indexes from the index indicating the index to the index indicating the last position are acquired one by one, and the acquired index is overwritten to the odd number (only the first is assigned to the odd number and not overwritten), Each time the numerical value assigned to the odd odd number is changed by assigning a numerical value to the odd odd number (including the numerical value initially assigned to the odd odd number), the following processing is performed. When the number divided by 2 is 0 (even number) and not 0 (odd number), branch processing is performed, this branch is tentatively named branch 2, and this branch 2 is treated as odd If the assigned number divided by 2 is 0 (if it is an even number), the number assigned to the number variable 1 is obtained, and the obtained number is used as the first array index. Is obtained, and the numerical value assigned to the odd number is used as the index of the decoding result array, and assigned to the index position of the decoding result array. If 1 is added, the value of the next index is obtained and assigned to the odd number by overwriting, and the value assigned to odd number is divided by 2 in this branch 2 is not 0 (in case of odd number) ) Acquires the numerical value assigned to the count variable 2 and sets the acquired numerical value to the second Use the column index to get the data assigned to the second array, use the odd number assigned as the decoding result array index, assign it to the decoding result array index position, then , 1 is added to the numerical value assigned to the number variable 2, the numerical value of the next index is obtained and assigned to the odd number by overwriting, branch 2 is completed so far, and this processing is attached to the decoding result array. When all the indexes are processed, the decoding result repetition process is terminated. When this process is completed for all the decoding result array indexes, the decoding result repetition process is terminated, and all the data from the beginning to the end assigned to the decoding result array is filed in 1-byte binary format. Recording medium that can be read by a computer that records a program that causes the computer to execute the process of creating a restoration file by adding to the end of the file and saving it

Images