TW487854B - Data file processing method - Google Patents

Abstract

Very large compression ratios are obtained by processing a digital file in a temporal or ""time-based"" manner, wherein ""time"" may also indicate the number of times that a certain loop has to be executed. In a preferred embodiment, a compressed version of the file is a representation of the amount of time required to process the digital file against a given function. As the digital file is processed against the given function, a count is incremented at a given rate. The size of the file determines how long the file will take to be processed by the given function. When the processing is complete, a value of the count is then converted into a representation of the file. The digital file is later reconstructed by applying an inverse of the given function.

Description

487854 A7 B7 V. Description of the invention (1 Technical scope _ The present invention is generally about data conversion, and more specifically, the invention is about lossless data compression and decompression. Relevant technical description data compression is a clear Defined technology. Therefore, for example, lossless compression, as the name implies, indicates a technology that compresses and decompresses the data to be completely consistent with the original data. Lossless compression technologies include techniques such as arithmetic coding and average information. Techniques such as entropy coding, Huffman coding, predictive coding, universal coding, and Ziv-Lempel coding. Arithmetic coding technology maps the data source sequence to several sequences The interval between paired numbers. The average information encoding is related to the statistically independent fixed-pair-variable-length encoding of data source symbols. Huffman encoding technology maps data source symbols to integer-length binary codewords, so that No code is the prefix of a longer code (pre; fix). Predictive coding The encoding form is to predict the current event based on previous events and transmit the prediction error. The JPEG standard widely used on the Internet is based on linear prediction encoding technology. The encoding form of universal encoding is that it does not need to know the statistics of the data source Data, but as the length of the data source sequence increases, it will converge to an optimal code. Ziv_Lempel coding 疋 a series of dictionary-based coding (dicti0nary coding-based) technology, by transmitting the symbol position in the dictionary For related information, encode the words of these symbols. Therefore, for example, the LZ77 series uses a part of the coded code string as the + code, and the LZ78 series builds one encountered in the data stream • 丨 ^ ---- ------- · Installation (please read the precautions on the back before filling this page) ί I HI 1 · — Mouth, * ^ 1 «n« «ϋ MW, printed by the Consumer Cooperative of Intellectual Property Bureau of the Ministry of Economic Affairs 4- Printed 487854 A7 ___B7___ by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs. 5. A dictionary composed of the string of invention description (2). The technology based on LZ77 is used to create zip files in commerce and based on LZ78. Techniques are widely used for dust reduction of image data, such as GIF. Although each of the foregoing is well known in this art, their performance is not outstanding when evaluated in terms of compression ratio. A compression ratio for a given compression technology , Which is defined as the ratio of the size of the original data to the size of the compressed data. The current data compression algorithms, in terms of the completely faithful lossless compression ratio of the original data without any loss during compression, can reach a maximum of 10: 1; The loss of high-fidelity compression (large sounds, video files, and photos) is 25: 1. In this case, the original data may be abbreviated, but the data can still be detected. Element; sparse files, that is, files with a large number of duplicates, unnecessary or blank, such as facsimile transmissions, the lossless I reduction ratio can reach a maximum of 200: 1. In this technique, there is a great demand for a compression ratio that is significantly higher than the known compression and decompression techniques of the prior art. The present invention solves this problem. SUMMARY OF THE INVENTION One of the main objects of the present invention is to provide a lossless data compression technology with a compression ratio of 1000 times (1000: 1) or higher, regardless of the size of the source file. Another main object of the present invention is to provide a novel compression / decompression technology that can be widely used in software and hardware. Another main purpose of the present invention is to provide a method that can be used as a lossy compression method. -5- The paper size is applicable to the Chinese National Standard (CNS) A4 specification (210 X 297 mm). -------- Order ------ (Please read the notes on the back before filling this page) Sound 487854 A7 ___B7___ V. Lossless compression / decompression technology assisted by the description of the invention (3). A further main object of the present invention is to provide a lossless data compression encoder / decoder (a "codec"), which can be implemented in software or hardware, and can be used to assist in large-scale compression in many applications, including Telecom, aviation, commercial, industrial and computer applications. Another object of the present invention is to provide a data file processing technology which can be used as an effective encryption / decryption method. These and other objects of the present invention are achieved by processing a digital file to be compressed in a time-based or "temporal" manner. In a preferred embodiment, a compressed version of a digital file is represented by the time required for the digital file to use a given mathematical function, where the term "time" can also refer to a certain loop The number of times it must be performed. As the digital case is processed by a given function, a count (time) will increase at a given rate. The size of the file determines the time required for the given function to process the file. When processing is complete, the timer 値, together with the same optional auxiliary information, is converted into a representative 値 of the file. Afterwards, the inverse function of the given function can be applied to reconstruct the digital file from the representative. In a preferred embodiment, the given function includes the following iterative steps. A bit string constituting the file is decremented toward a given frame (for example, 1). After the bit_ is decremented to a given frame, a test is performed to determine whether the given frame is equal to an end frame (for example, 0). If the test result is no, the decrementing step is repeated toward the result of the first iteration. The result is then tested to determine if the end has been reached. This procedure is repeated until the -6- This paper size is applicable to the Chinese National Standard (CNS) A4 specification (210 X 297 mm) ------------_ ¥ (Please read the precautions on the back first (Fill in this page again) Order ------— Printed clothing by the Consumers ’Cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs 487854 V. Description of the invention (until 4 soil ^, 4 bundles. Then time with optional auxiliary information — = Coded as the representative of this 値, this article will clearly make, the aforementioned time can represent the actual time required for the entire process or other information, such as the number of times the process has been repeated. The foregoing has outlined some related purposes and Features. These purposes are only to illustrate the present invention—some more obvious features and applications. The following will explain that applying the present invention in different ways or modifying the present invention can obtain many other advantageous results. For a detailed description of the preferred embodiments, other objects can be learned and the present invention can be better understood. To briefly understand the present invention and its advantages, please refer to the following detailed description of the accompanying drawings, in which: 1 is a flowchart of a preferred routine for processing a file according to the present invention; FIG. 2 is a flowchart of a preferred routine for processing a file that has been compressed according to the routine shown in FIG. I; FIG. 3 A flowchart of a more detailed and specific embodiment of compressing a file according to the present invention; printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs Figure 4 is a more detailed and specific process for files that have been compressed according to the routine shown in Figure The flowchart of the embodiment; and FIG. 5 shows a preferred implementation of the chip-based routine of the present invention; FIG. 6 is a flowchart of another preferred routine for processing a file according to the present invention; Standard Turnover Tolerance Standard (CNS) A4 Specification (210 X 297 Public Love) A7 --------- —___ V. Description of the Invention (5) Figure 7 is a file that has been processed according to the routine shown in Figure 6 A flowchart of a preferred routine for further processing; Figure 8 is a flowchart of a preferred routine for compressing a file according to the present invention, where the building case is first processed by a lossy compression method; Figure 9 is a File compressed according to the routine shown in Figure 8 A flowchart of a better routine for further processing. Detailed description of the preferred embodiment For clarity, in the specific embodiments described below, the processing method mainly refers to a compression method, and the reprocessing method refers to a solution. Compression method. This is "for illustration purposes only. Those familiar with this art should understand that the word" compression "can be replaced with Γ encryption" and "decompression" can be replaced with "decryption". Example 5 is clear Example 1. Figure 1 shows the basic operation of the compression method of the present invention. Figure 2 shows a corresponding decompression routine. The compression routine starts from step 100, and this step inputs a to be compressed File. The file, no matter how big, is made up of a one-bit word rate. The bit sequence in the string uniquely represents a finite positive integer 値. The file can be in any known format, such as sound, video, video, data, etc. The file may also be a compressed file, such as a zip file. In step 102, the archive to be compressed is read. In step 104, a sufficient index 値 n is set. For ease of explanation, set the index 値 η = 1. In step 106, a count is started. A convenient way to increment the count is to start the timer at 0 and calculate the increment of the given time at a given rate. Then, in step 108, it is determined that the file represented as a single-digit string is 丨 " ----------- · -install (please read the precautions on the back before filling this page)

ή ^ τ Exposure I I I I Printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs -8-

Printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs 487854 V. Description of Invention (6) Mouth, equal, ‘sufficient end’. For convenience of explanation, the ending value is set to 0, but the present invention is not limited to this. If the test output of step 108 indicates that the talent field is not equal to the given end point, then the routine continues with step 110, and the & foot function is applied in the case of 亥. In the example shown, the given function decrements the file (i.e., the bit word _) by the index 値 η. In this example, a given function sets A = A — i. Then, go back to step ⑽. When the test result in step 10 8 indicates that the file has reached the given end 値, at this time, the reed knife goes to step 112 and stores the count then_current 値. The then-current 値 of the count can be appended with additional information, such as the file name timestamp 圮 (hmestamp), the identification number of the processor executing the routine, the counting rate, and so on. FIG. 2 is a flowchart of a preferred routine for decompressing a building case that is compressed according to a household routine. The method of decompressing the file (thus rebuilding the file A) is to start from step 200, which reads then-current 値 stored in step ιΐ2. In step 202, the index "n" is set equal to the value set in step 104 in the compression routine. In the example shown, step 202 sets n = 1. In step 204, a variable "count" is set equal to "_count" and then incremented at a rate equal to the given rate in the compression routine. Therefore, in the example, the count is a timer which starts from a specific negative number 値 and increments to a final 以 at a given rate. In step 206, a test is performed to determine whether the count 値 has reached the final 値. If not, the routine continues with step 208 and sets A to be equal to a given function, in this case A = A!. Then return to control = step 206, and test whether the result 値 is equal to the final 値 (ie, 0). When step-9 reference paper size applies Chinese National Standard (CNS) A4 specification (210 X 297 mm) I ^ installed -------- order --------- (Please read the back Note: Please fill in this page again.) 487854 V. Description of the invention (:: 2 = When the result is greater than 0, the routine will branch to step 210 to make the original file to be compressed in the wrong order. This completes the basic process of the routine, It can be known from the preferred embodiment that the compression routine (and its complementary decompression routine) of the present invention is processed in a temporal (temp () ral) or "time-based (tnne-based)" manner. A digital file. In particular, the compression of the file, the time required to process the digital file with a mathematical function is two tables (preferably an encoded number). As the digital file is given a given Function to process, a timer will increase at a given rate. In theory, the size of the file determines the given function (for example, A = A—⑽ spends more time processing the file. When processing is complete, the timer値 is stored as a representative 値 or code 琢 of the original file. In theory, it can be used in the future. The inverse of the given function (in this case, A = A +1), reconstructs (ie, decompresses) the original file from the representative 値 itself. Those skilled in the art will understand that if the compression and decompression routines are different Using the same index 値 η and the same counting rate, the file A generated by using the decompression routine will be completely consistent with the original input file to be compressed. Therefore, the present routine provides lossless compression. In the specific embodiment shown in Figure 1-2, the index 値 n = 丨. In this case, each step of the step is performed by decreasing the bit string by 1 to perform the decreasing function. It is only necessary to make up the bit The least significant bit (LSB) of the string and any higher-order bits with all lower bits being 0 can achieve this function. This operation is a traditional down counter. As mentioned above In the compression routine, if the result of applying this function is not -10, this paper size applies the Chinese National Standard (CNS) A4 specification (210 X 297 public love) Order 4 Printed by the Intellectual Property Bureau of the Ministry of Economic Affairs Consumer Cooperatives 487854 A7 B7 V. Description of the invention 8) If it is 0, the program will continue to iterate until the bit word _ is reduced to the given end, such as 0. As mentioned above, the time spent by this program represents the compressed version of the original digital file. Example 2 The routine shown in Figure 1-2 is a technique in which 値 η does not change during compression (or decompression) and is a given 値 (such as 1). Because of existing hardware and software Those skilled in the art will understand that applying a given function (such as A = A-1) to a bit string of any length that constitutes a file may take a long time. Therefore, according to the present invention It is best to make the index 値 η change throughout the compression routine in a manner that will be explained in FIG. 3. Figure 3 is a flowchart of a preferred compression routine using traditional computer resources. In this example, the routine starts at step 300 and reads an input file A to be compressed (actually, a bit word of any length). In step 301, a variable i = 1 is set. This is not the purpose of the indicator, as we will see below. In step 302, an index 値 η = η! Is set. Continue to step 3 03, where a count is set 値 t = ti. This 値 represents a given starting 値 (for example, a time 0 値). In step 304, the count is decremented at a given rate. So, for example, the given rate may represent the clock speed of the processor that compressed the file. The routine then enters the first processing loop described below. Step 306 tests whether file A (or a substantial portion thereof) is greater than a predetermined volume, such as zero. As shown in the flowchart, file A can be divided so that all bits except -11 (end of file or EOF) are in the range of -11-This paper size applies the Chinese National Standard (CNS) A4 specification (210 X 297 cm) Li) I: ---------- · Shang -------- Order ---------- (Please read the notes on the back before filling this page) 5. DESCRIPTION OF THE INVENTION (9) The entire loop is processed. If the test result in step 3Q6 is positive 正, the routine follows step 30 and sets a variable B = A. In step 308, the count ti is suspended. In step 31 (), the routine will apply the given function (PA nj to A to produce a result. Then go back to step 3 μ and repeat the procedure. During this processing loop, naturally, the count will continue to increase. When When the test result of step 306 becomes negative 値, for example, because 値 of a (or A | EOF, which may be the case) is now a negative number (the result of applying the function in step 3 ι), so leave the first- This loop goes to step 3 12. In step 3 丨 2, test whether 测试 of A (or A 丨 Q, this may be the case) is equal to-given end 的 (this example 胄 〇). If not, Then continue to step 3 14 to store the time corresponding to the index 第 一次 ^ (first iteration). Therefore, in step 314, store the index 値 -time 値 number ㈤, q in any convenient place, such as , Stored in the-temporary register 'a system memory, disk, etc. In the burdock 3 "T in step 316, the variable i is adjusted to i + ^ after step 316 is the step, and a 値 is set equal to B. Then, 'return to step 302, the program repeats as many times as possible with the new index. Each new iteration, count 値It all starts again. Therefore, during the second and subsequent iterations, its index 値 -time 値 number pair (ni, ti) is generated and stored. However, when the test result of ㈣312 means that 値 is equal to At the end of the set, the routine will branch to step J20. In @ 个 步骤 'routine, all the standard and hour numbers will be paired

The generation of the original data is pure. 1 For example, if the given case A: Over-processed ② is = 3), the resulting compressed file will be as shown in Table 7F below (where | is a related operator) · ·

The size of this paper is _Home Standard (CNS) A4 specification-x 297 mm) 487854 A7 ______B7__, V. Description of the invention (1〇) {Name (option) | Other visual information (option) | (ni, ΐ ^ ) | (η2, t2) | (n3, t3) | EOF (option)} ⑴ or {name (option) | other visual information (option) 1 (1 ^ ti) | EOF (option (2) compression routine This is done. Although the indicators 値 can be selected in any convenient way, a technique for selecting these indicators 値 will now be explained. In a specific iteration, the selection of the indicator 値 η determines the number of bits in the file , Then divide the number of bits by 2, and then count the number of specific bits (for example, bit "1") in the half file. Therefore, for the first iteration, you can Divide the number of bits in 2 by 2, and then calculate the number of bits 1 in any half of the file to produce the index 値. For the second iteration, perform the same calculation on the number 値 Β generated in step 3 1S Ideally, if Fang Yuan's file is odd, then at least one (for example, the last) index η will be 1. If the file is even, at least one (for example, the last one) of the index η is 2. In a representative example, this compression routine is used to generate compressed versions of two sound files. The two files are files. Ai: 45Kbyte .wav file, and A2: 75Kbyte · wav file. Using 2 iterations, η = 5 00 and η〗 -1 'The result is that the size of the two compressed files is about the same, about 110-12 bits. Of course, the time 中 in each index 値 _time 値 pair is not the same, because the size of the original file is different. Those skilled in the art will understand that regardless of the original file size, the compressed version of the file is obtained Generally speaking, it will be reduced to one that is only included (please read the notes on the back first and fill in this page)

flu n ϋ ϋ 一 于 口 ， I an n ϋ ί · ϋ n _1 I # Printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs -13-

A7 V. B7 Description of the invention (a fairly small data file of the information described in Formula 11 '. Therefore, the compression routine of the present invention shown in Figure 3 produces the following results (unless deducted otherwise, all file size units (Both byte): 2 3 4 start size end size 72405 102 80,302 115 2,276,345 123 334 Mbytes 117 decompress the compressed file of the image to get the original _ case A. The routine starts from the beginning of the step, this step disk gets the compressed file Represents 在. In step 401, set the variable 丨 = 丨. ^ Step 402, get the next index 値 ~. Then continue to complete the step, set a full count 1 = -ti. Therefore, in the first step of the decompression routine In the second iteration, it is equal to the first time 値 t! Stored during the compression routine, and ~ is equal to the _th index 値 ~ used during the I reduction routine. At step 406, the test time increment is- Whether ti is equal to a given end 値, such as 〇 (or 〇 丨 E〇F, but this is the case). If not, the routine follows step 4 0, set A = A + ni (in the first One iteration is equal to eight = a +. Then return to step 406. When step 406 The test results indicate that when the time 値 has reached the given end 孩 (that is, 〇 or 〇 丨 EOF), it will branch to step 410. At this step, test whether there is still time to be processed 値 ti. If so, Then the routine sets i = i + 1 at step 4 12. Then it returns to step 402 and follows the following steps to perform the succession procedure. Therefore, in the second iteration, ------- ----- φ Μ ------- (Please read the notes on the back before filling out this page) Order -------- -_ -14 This paper size applies to Chinese National Standard (CNS) A4 Specifications (210 X 297 Gongfa 487854 Printed by the Consumer Property Cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs, the invention description (12) is the processing indicator 値-time 値 number pair (η2, ω, the third iteration is the processing indicator 値-time) Number pairs ㈤, ⑴, and so on. When there is no index 的 to be processed, the test result of step 410 is negative 于. Then branch to = step 4 ^ 4, material a 料 becomes the original comparison (or main part, When the bid is only A 丨 EOF). This completes the decompression process. In the specific embodiment shown in the factory, the compression and decompression routines may be incorrect. , Among them, the execution time of the compression routine is longer than the decompression routine. The difference in time is mainly because in the routine, whenever the time B is set equal to A ( Step 30)), it will take up some extra time. This action, as mentioned above, is not required in the normal period. Φ ^ Example 3 Figure 6 shows the progress of the compression method of the present invention. Corresponding decompression routine. Compression routine starts from step 6 (1), this step reads the digital file A to be compressed. Regardless of the size of the case, it is composed of -single; ^ characters, and the order of the bits in the string is only-represents-a finite positive integer, also represented by A. In step 602,-the index 値 i is set to the beginning 例如, for example i = Q, this-the index is used to indicate = 'N and each temporary version of the three variables, these three variables store the present invention Temporary compression used by the compression program. These variables are related to each other in the form: (shown) At the beginning of step 602, A0 is equal to a, and No is set to be equal to a times a coefficient f greater than 0. This coefficient is preferably less than i. In short, the Chinese national standard (^ XIi ^ (21〇x 297 mm) (please read the precautions on the back before filling this page) is applicable to the 纸张 -15 private paper scale. Install tr——I—— suspect-1t. 487854 V. Description of the invention (13 602:

Nf A * f In step 603, enter the main loop and perform the aforementioned mathematical calculations, satisfying Bi = Ai-Ni. Next, in step 604, it is tested whether the current b 値 is smaller than the current N 値, and if yes, then step 605 is continued. Conversely, if B is greater than or equal to N, branch to step 606, and store the B, N, and 値 of the previous cycle into a compressed version of the original case A. Each of these three items b'n and i represents a part of the compressed eaves case. For convenience of explanation, it is referred to as L (left), R (right), and τ (time) in step 61. When needed, the stored data can be supplemented with additional auxiliary information, such as file name, time stamp, identification code of the processor running the routine, counting rate, etc. Of course, those skilled in the art can choose and perform any equivalent calculations as a condition to set the branch to leave the main loop. If the test output of step 604 indicates that B is less than N ', then the formula will continue to step 6 0 5'. Here we increase the count 値 丨, set 値 of a to be equal to the current N 値, and set the new N 値 to be equal to the current N 値B 値. Repeat this entire cycle until B is no longer less than N. Fig. 7 is not a flowchart of a better routine for decompressing a file compressed according to the routine of Fig. 7. The routine for decompressing the file (thus rebuilding the file A) begins at step 701, which starts by counting the soil and reading l, R, and T stored at step 610. At step 702, the main loop is started. In each cycle, set A 値 to be the sum of the current 値 equal to L and R. It is then checked in step 703 whether the current count 等于 is equal to T 値 which represents the number of times the loop must repeat. If it is equal, the current 値 Ai is in accordance with the original -16- printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs 487854 A7 _B7_; Ending at step 705. If the count 値 i is not equal to T, the count 增加 is incremented in step 704 and the loop is repeated. Those skilled in the art should be able to clearly understand that one of the basic concepts of the present invention is based on the following considerations: (a) Any different data file is composed of a bit word _, which represents a uniquely limited positive Integer 値; (b) Each 値 can be obtained iteratively from any lower 値 and applying a specific mathematical function. In particular, each puppet can be obtained by taking two lower different puppets and processing them for a specific time, or a specific number of times. Therefore, unlike any existing compression algorithm, the present invention further adds the dimension of "time" to the data processing technology. With this revolutionary starting point, one of the main issues that must be faced by those skilled in the art is how to determine an optimal function to be applied in an iterative manner, and how to determine the parameters used by the function. From a technical point of view, the fastest operations that a computer can perform are addition and subtraction. Other operations, including multiplication and division, require more processor time. Therefore, in the preferred embodiment of the present invention, subtraction is used in the compression phase, and addition is used in the decompression phase. In particular, the preferred embodiment of the present invention is based on the principle that any integer 値 can start from two numbers and add the second term to the sum of the two terms in an iterative manner, as follows: -17 -This paper size applies to China National Standard (CNS) A4 (210 X 297 mm) ----------- installation -------- order --------- (Please read the precautions on the back before filling this page) 487854 V. Description of the invention (15 count i == 〇 Printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs L + R = A 4 + 10 = 14 10 + 14 14 24 24 = 38 i == 3 24 + 38 = 62 i = 4 38 + 62 = 100 f, case A, that is, the 0 and i sequences that make up the metaword _ represent minus ⑽. From the two numbers 1G Start with 14, and apply the $ times sum function '• to the number ⑽. Therefore, the compressed scheme is represented by l called 0, r 14, T-5 (or 4, when the count starts from 0, this is often the case) The decompression algorithm can be decompressed (that is, re-obtained) by simply adding the original algorithm. Therefore, it is clear that the compression stage generally includes the same steps described above, but it is the application choice The inverse function of the number. In this case, the compression routine first subtracts the original file iteratively, and then subtracts the temporary data. '' However, the main problem encountered by those skilled in the art is the compression algorithm. How to start the method, that is, how to determine the first one to be subtracted from the representative of the residual A in the original data. It has been found that the best solution is to multiply A by a coefficient f, where f is mathematically called "Γ Golden section ratio", which represents an irrational number of 0.6 18033 89 ··· " Therefore, the compression procedure described in Example 3 will start from the original data case a = 100 'and calculate the first N 値 equal to A * 〇 · 618 The coefficient is 2 18- The size of this paper is applicable to China National Standard (CNS) A4 (210 X 297 mm) ----------- installation -------- order --- ------ · (Please read the notes on the back before filling out this page) 487854 V. Description of the invention (16) Any number of decimal places can be used. It depends on the efficiency you want, and it depends on the size of A. Therefore, subtracting the first N 値 from A (or the compressed file finally represents R in 値) to get the first B 値 (compressed file finally represents [) in 値, where the first N 値 must be an integer, then set a = N, and continue to generate private order until B is no longer less than N. However, it is well known The artist should be clear 'There are several other tests that can be used to stop this process. For example, you can check if any of B or N 値 is less than a preset 値, or stop iteration after a specific number of times . The following table is an example of this processing algorithm: ----------, φέ (Please read the precautions on the back before filling this page) i = 0 i = li = 2 i = 3 i = 4 i = 5 A = 100 A = N = 62 A = N = 38 A = N = 24 A = N = 14 A = N = l0N = A * 0.618 = 62 B = AN = 38 N = B = S8 B = AN = 24 N = B = 24 N = B = 14 N = B = 10 N = B = 4 B = AN = 14 B = AN = l〇B = AN = 4 tT——I —— #. Ministry of Economic Affairs The Intellectual Property Bureau employee consumer cooperative prints "In step l-5, the end condition B < N is met, so this record is added with one star, that is, B == 4, N = 1〇 and Bu 4 ( Or 5, if it is expressed by the \ number of decompression_circle, and * is the use of calculation, it is combined and stored as a compressed version of the money case. Of course, you can also store the data of step i = 5 (or 6) ' This will increase the number of iterations of the decompression process. Example 4 It has been proved that the preferred embodiment described above can also be effectively used as a loss of capital (l .. -19- x 297 mm) ^ Paper standards apply Chinese national standards (CNS ^^ T ^ · 487854

V. Description of the invention (17) Additional functions of the lossy compression algorithm printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs. It has been explained earlier that the lossy compression algorithm is mainly used for picture and sound data. Although it reduces the original data, it still maintains good image and sound quality. By extensively using the same inventive concepts as the aforementioned lossy algorithms together with lossy algorithms, the present invention can further overcome the problem of data loss caused by these lossy technologies. Examples are shown in the flowcharts of FIGS. 8 and 9. The initial step is 801. This step reads the digital file A to be compressed. In step 802, a lossy compression algorithm is applied to the cases, for example, any known compression method, such as jPEG, jPEG2000, MPEG, MP3, MP4, DIVX, or other proprietary lossy Compression algorithm. In step 803, the obtained bridge case is stored as A ', as shown in block 811. Then decompress A 'with an algorithm paired with the selected lossy algorithm to get ALc) Ssy, and then subtract A LQSsy with A to get A ". At step 804, use Example 3 in the digital construction The same procedure of A is applied to file A ". Steps 804 to 8 08 correspond to steps 602 to 606. At step 812, the corresponding B, N, and i 値 are stored in the form previously described. The processed version 8 丨 0 of file A is indicated by the first part A ′ 811 and the second part A. A, 812 are obtained by compressing wall case A in a talented way. The resulting file is significantly smaller than the original file: and the entire program now has no loss of data, even if the share program uses a lossy algorithm. FIG. 9 shows a flowchart of a preferred routine for decompressing a file compressed according to the routine of FIG. Extract the file (thus rebuilding the file A)

This paper size applies to China National Standard (CNS) A4 specifications (210 X ------------------- Order --------- (Please read the Please fill in this page again for attention) -20- HO / OJH- A7

5. The hanging method of the invention description (18) starts from step 901. This step reads the lost compressed version of the file and obtains the decompressed version of the file ALQSSy, but the data is known to be 'lost.' Then, in step 903, the relevant decompression sequence described in Example 3 and FIG. 7 is performed. Steps 903 to 906 correspond to steps 701 to 704. When the routine leaves the main circle at factory water 0 7, add the current version of a ,, to the decompressed version obtained earlier. Al. The sum of "+ a ,," corresponds to the original file bit by bit. Example 5 Finally, it must be explained that the aforementioned concept of the present invention can be applied not only to compression / decompression methods, but also to encryption / decryption systems. In fact The processed file is completely unreadable, and it can only be reprocessed and rebuilt using a selected compression function based on a specific time base. In general, the aforementioned functions can be implemented in many different ways The invention is not limited to any particular implementation. A convenient method is to know that the invention is implemented in software executed by a processor, that is, in a random access memory such as a personal computer. A set of instructions (code) in a code module of the code module. In addition, although the methods described can be easily implemented in a multi-purpose computer with the option of software startup or configuration reconfiguration, it is well known Artists should also understand that these methods can also be implemented in hardware, early blades, or special devices built to perform the steps of the necessary methods. A better practice is a Dedicated devices, such as an integrated circuit chip containing a processor, memory, and system clock. In this case, compression and decompression routines are stored in firmware or similar devices. Figure 5 shows this. Simplification of the device (please read the precautions on the back before filling this page) Binding ---------- Φ. Printed by the Consumer Cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs π -21-

487854 Printed by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs A7 B7___ V. Invention Description (19) Structure. In this example, the chip 500 includes a processor 502, a system memory 504, a firmware 506 (including the compression / decompression routine), and a system clock 508. The device can be connected to a motherboard, for example, via link 5-10. The connection 5 10 may be, for example, one R S 2 3 2, U S B, or the like. When a given file is to be compressed, the file is provided to the chip 500 in a general manner. The result returned by the chip is a representative of the compressed file. The routine of the present invention can also be implemented in other known hardware, such as a digital signal processor (DSP), a field programmable gate array (FPG A), and an application-specific integrated circuit (ASIC). Chips and microcontrollers in fixed-line logic. The codec of the present invention provides virtually unlimited, lossless, content-insensitive compression. Therefore, the application of this codec is quite diverse. The following are some representative applications, but this description should not be used to limit the scope of the invention. Even if it is software only, the codec can replace existing archival algorithms. Once the codec is transferred from software source code to a dedicated integrated circuit, it can modify existing storage media to have unprecedented usable capacity and allow large volumes to be transmitted across existing telecommunications and data communications infrastructures. The hardware codec can also be used with a custom operating system that manages the memory structure, with a custom line connected to a codec-driven storage device, and a codec-type network connection hardware. Software Application The following is the software in the existing operating system. This codec can be used in -22- This paper size applies to China National Standard (CNS) A4 specification (210 X 297 mm) (Please read the precautions on the back before Fill in this page) Install an n-_, annn · ϋ ϋ ϋ I _ r: _ 487854 Printed by A7 B7, Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs 5. Fields of Invention (20). • Electronic Software Distribution (ESD): Software distribution based on HTTP and FTP has increased dramatically due to the rise of e-commerce (e-commerc e). Use file compression (because a product will only be ESD packaged once, so the time required to compress the file is not a problem) and the freely distributed decoder is included in the ESD package software. Any software company can be online Sell their software, no matter how big the files are. • Web browser acceleration: using a web browser with codec capabilities (via Netscape plug-in or ActiveX controls) and a website that provides compressed HTML pages, JPEG and GIF, can display a web page Hundreds of times faster. This application can be effectively used for static web pages, applets, static frames, images and pre-recorded streaming audio and video. In addition, because the codec does not change the basic content of the web page, it can be sold as a third-party software that is plugged into an existing web server, and provided as an add-in to existing web pages for free. Browser. Hardware Applications Once built into an integrated circuit or other hardware, such as an integrated processor capable of real-time compression, the codec can provide additional performance improvements. The chip can be applied to a data communication vector and a data storage vector. Data Communication Vectors • Wide Area Network Acceleration Equipment: An application of this codec is for -23- This paper size applies to China National Standard (CNS) A4 specification (210 X 297 mm) ΙΪ ------ --------- (Please read the notes on the back before filling out this page) 1T ---------- Γ Printed by the Consumer Consumption Cooperative of the Intellectual Property Bureau of the Ministry of Economy 487854 Κ7 Β7 ___ V. Invention Explanation (21) In a hardware black box (chip and customized firmware) at both ends of the WAN data transmission. Data packets are transmitted in an unprocessed form over an area Gigabit Ethernet or asynchronous transmission mode area network (ATM LAN) path, and then enter a slow transmission medium (ie, the last router and its CSU / DSU) before being compressed. At the other end, an identical box decodes the data_stream. With this invention, full motion video and sound are not only possible, but also commonplace. The device can be used to connect to a corporate network (that is, to connect to multiple websites within a company) or to the Internet-the latter requires the user's ISP to use the device. The codec can also be used to implement an acceleration device in the form of an end node for real-time control of a certain communication flow; and an analog acceleration device for the connection from an asynchronous Internet to a regional POP. • bAN / WAN Power Chip: It is very useful to integrate codec hardware into routers, switches and network interface cards. Soldering the chip to the hardware and firmware with codec capabilities can (a) reduce the overall cost of implementing the codec, and (b) by bonding to the NIC and to the switch / router In the backplanes, a "desktop computer with built-in codec" can be achieved; and (c) the structure of the internet can be simplified by reducing the number of devices. Because the physical size of the 1C is small, it can be easily implemented in a wide range of Ethernet-compatible interfaces, including from desktop PC interface cards to 802.1 1 wireless communication ports to 1000Base-T NIC network cards. • RS232 / RS-422 acceleration module: Although the data transmission of the _ column agreement is used -24- This paper size applies the Chinese National Standard (CNS) A4 specification (210 X 297 mm) (Please read the precautions on the back before filling (This page) H · · ϋ tmmmm _1 enn I nn · 487854 A7

The consumer property cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs always has a physical speed limit, but a host-powered (h〇St-P〇Wered) code protector is installed between the serial port at both ends and the cable medium. (Dongle), which has greatly improved the data collection and instrument monitoring in the manufacturing environment, and can eliminate all bottlenecks caused by the use of old transmission media. Lu Satellite Communication Accelerator: Similar to the aforementioned products, this device can make the orbit reconnaissance, cable television and telecommunication satellites and off-orbit research satellites have codec capabilities. In this way, the time required to transmit aerial images, sports program simulcasts and other photos will be negligible. When used on terrestrial wireless media, due to the high sample rate, and currently limited to 19 2 Kbps wireless CDPD data connection will be improved Speed to dedicated lines, so mobile phone transmissions will be perfect. Data storage vector • DASD interface: The DASD interface will be a _based traffic accelerator for DASD (Direct Access Storage Device, or Hard Disk) communication channels. · DASD compression. The motherboard with encoding capability will allow the OS storage driver to transmit all data through the codec before it finds the DASD, and it will automatically decode it when the data is returned. • ROM / NVRAM improvements: use hardware coding, mobile phones, 0s handheld devices, digital wires-any currently equipped with non-volatile memory (devices-chips currently used in the device will have offline storage space with virtually unlimited capacity And is limited only by the real-time data access capabilities of its working RAM.

(Please read the precautions on the back before filling this page) Binding ---- Order ------ # _ -25- This paper size is applicable to country 487854 A7 B7 V. Description of the invention (23) ROM compression: The hardware code can also be used for real-life and self-examination, such as portable buckets, portable notebooks, and new generations of portable devices with greatly increased storage capacity: hand-held libraries, historical records, and built-in your DNA. The large-scale medical hospital with a large number of newly released CDs has a medical ID and device of the size of a high-speed 4-pack package, as well as NT's dual-brain launching from the ROM. Guotong Tong's extremely lightweight portable electric NVRAM storage device: By combining the existing flash media (such as Sony Memory Stick, fiash mediaU. Y Memo y la) with the size, speed and portability and encoding capabilities The combination of the main board air force U and the device has a greatly improved device. Zip machines and other high-rise housing units I ^ ^ removable storage devices will no longer be required. Digital tape compression · All codec compression for long-term backup is another application. With the encoder and decoder IYI ~ bark into the DLT or DDS tape drive hardware, companies can use only one tape to save digital historical data for up to 10 years. Medical applications: Here are some examples: (a) Real-time transmission of MRI or X-ray images via any connection. These are the most complex digital images in the world that are easily lost. Are they currently reduced using CCITT algorithms? (B) the medical surveillance equipment will be able to save a complete signal history data at a high sampling rate, without the need to print the data history from the printer or copy them all; and (c) a copy database of medical record information will玎 Stored in every hospital around the world, not occasionally transmitted or transferred in an emergency. New operating system: developers of operating systems can write and use codecs-26- This paper size is applicable to the Chinese National Standard (CNS) A4 specification (210 X 297 mm). 丨 丨 丨 丨 ^^ ··; • Install (Please read the precautions on the back before filling this page) Order! !! # · Printed by the Consumer Cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs V. Invention Description (24 built-in logic code to increase and control the memory structure of the system at an efficiency that was never possible before. As can be seen from this article, the method of the present invention can Meet the goals and objectives set forth herein. Obviously, those skilled in the art should be clear and easily make several modifications without departing from the scope of the invention. Therefore, the scope of patent application should not be limited to the description made herein. Or the preferred embodiment described by way of example, but the scope of patent application should cover the novel features of all the patentable patents described in the present invention, including all the features considered equivalent to those skilled in the art. For example, Obviously, it is even possible to apply the iterative processing algorithm iteratively while processing digital file A. For example, applying a compression program to a specific digital file A may get a compressed file a that is not small enough. In this case, familiar with this, know this The artist can apply the same method again, starting from A, and get the compressed version of A, which is the compressed version of a. Repeat the same private sequence until the size of Ak 'reaches a satisfactory level. ≫ Those skilled in the art can divide the original file a to be processed into several kj AL.An' and then apply the processing method to each of _ Li's knowledge processing method is applied to each part to obtain the compressed result of the file.: For the description of my invention, I claim to be new and hope to be protected by the patent village, such as The scope of patent application is described below.

A I_ -27- This paper is suitable for China

Claims (1)

487854 AB c D \ n, Patent Application No. 1 ^ J ^ 089121530 [Revised Patent Scope (April 91) 6. Application for Patent Scope 1. A process for processing one digit containing a string of one digit The method of building a case includes the steps of: starting a count, the count increasing at a given rate; as the count value increases, reducing the bit string iteratively by a given value until a given value is reached When the given end value is reached, a then-current count value increment is stored and becomes the representative value of the digital file. 2. The method according to item 1 of the patent application range, wherein the count is a timer. 3. The method of claim 1 in the patent application range, wherein the given binary value is 1. 4. The method according to item 1 of the patent application scope, wherein the ending value is 0. 5. If the method of claim 1 is applied, the method further includes the following steps of rebuilding the file: setting the representative value to a given count value and incrementing the count value at a given rate; As the count value increases, iteratively increments a given number by a binary value until it reaches a given end value; and when it reaches the given end value, stores a then-current value of the given number To become the file. 6. The method in the first scope of the patent application is used to compress a data file. 7. The method of item 1 of the scope of patent application is used to encrypt a data file. 8. If the method of applying for item 5 of the patent scope is used to decompress a data file. 0 This paper size applies to China National Standard (CNS) A4 (210 X 297 mm) C8 D8 For example, the scope of the patent application No. 5 10 ·-a kind of compression-file A; : :) Get the next indicator value 1, where (b) starts with a count t1, where 1 = 1, 2, ..., '... (c) As the count increases: (1) Check if A Greater than 0 (2) if yes, then set B = A; (3) calculate A == A-shame; and (4) repeat steps ⑷⑴ until A is greater than 0; when A is greater than 0 'check if A is equal to-given Value; 0) if not, then set A = B; ⑺ store-pairs of indicator values and time values (Ili, ti); (g) set i = i + i; '1 (h) repeat step (a) _ (f); and (1) Right A Temple is given a value, and then combines these indicator value and time value pairs to become a compressed version of Building Case A. I is the method of applying for item M of the patent scope, wherein the given value is 0 ^ 12 · as in the method of 4 patents_item 1 (), wherein the given value is (〇 | EOF) 〇13 · as applying The method of item 10 of the patent, wherein a given value of one of the indicators is calculated as follows: divide the number of bits of the file by a given number; determine a number, the number is the file with a given value The number of bits in a part of; and ^ The value of this indicator is expected to be equal to the recorded entry.丄 4. If the scope of patent application is the first, the given value is equal to i. Item (10,000 methods, where one of the index values ~ as in the patent application scope No. 10Jg given value is equal to 2. 40 thousand methods, where the child index value ~ ~-such as patent application scope No. 1 () 17. million yen, It is used to encrypt a data file. The file represented by the pairs of values, time, value, time, and number of methods includes the following steps: (a) Get the next indicator ..., where 丨 = 1, 2 (b) The first count is under, where 丨 = i 2 (c) Ik increments the count q from a -ti value: (1) Check if ti is equal to a given value; (2) If not, calculate A = A • ~; And (3) repeat step (c) ⑴ until-at the given value; (d) check if there are any more count values to be processed; (e) if so, set i = i + 1; (f ) Repeat steps (a)-(e); and (g) if there is no count value to be processed, then save A to become the file. 1 If you apply for the method of item 17 in the application, the value of the shooting secret is 0. 19. The method of item 17 in the patent, where the given value is (〇 丨 EOF) 〇20. The method of item 17 in the patent range, if required, is used to decrypt a data case. 21 ·-种 在-Electricity A computer program product in a readable medium for compression -3-8 8 8 8 AB c D 487854 VI. Patent application scope A file expressed as a single word _, including: a set of programs that can be executed in a processor Instruction set to perform the steps of the following compression method: start a count, the count value is incremented at a given rate; as the count value is increased, the bit string is iteratively reduced by a given value Until a given end value is reached; and when the end value is reached, a then-current added value is stored as a representative value of the file. 22. For a computer program product applying for item 21 of the patent scope, the product further includes : A set of instructions that can be executed in a processor to perform the steps of the following decompression method: Set the representative value to a given count value and increment the given count value at a given rate ; As the given count value increases, a given number is iteratively increased by the binary value until a given end value is reached; and when the given end value is reached, the given number is stored A then-current value becomes the file. 23. For example, a computer program product under the scope of patent application No. 22, wherein the processor for executing the decompression method, the clock speed of the processor and the processor for executing the compression method The clock speed is the same. 24.-A kind of integrated circuit codec, including: a processor; a clock that runs at a given clock rate; -4- This paper standard applies to the Chinese National Standard (CNS) A4 size (210 X 297 mm) 487854 A8 B8 C8 D8 VI. Patent application scope An executable code that is executed by the processor at a given clock rate. The following steps are used to compress a file represented as a bit string: Start a count, the The count value is incremented at a given rate; as the count value increases, the bit string is iteratively reduced by a given value until it reaches an end value; and when the end value is reached, a then is stored -The current count increment becomes a representative value for the archive. 25. If the integrated circuit codec of item 24 of the application for a patent, the integrated circuit further includes: an executable code that is executed by the processor at a given clock rate, and decompresses the following steps: Represent the value and rebuild the file: Set the representative value to a given count value and increment the given count value at a given rate; as the count value increases, iteratively increases with the binary value A given number until a given end value is reached; and when the given end value is reached, a then-current value that stores the given number becomes the file. 26. A method for processing a digital file A containing a bit string, the bit word _ uniquely represents a finite integer value, the method includes the following steps: (a) starting a count i = 0 'and set Ai = () = A, (b) calculate a value N1 = 0, where N1 = 0 is a finite positive integer value; (c) set h =-team; (d) check if the dagger is smaller than the team; -5- This paper size applies to China National Standard (CNS) A4 (210 X 297 mm) Hold t J 0 (e) If yes, increase the value of i; (f) Set =: Nw; (g) Set Nw =; (h) Repeat steps (c) to (g) until Bi is not less than ^; and (i) combine and Storing Bi l, Nw and ll becomes a version of the digital file A. & The method according to item 26 of the patent application, wherein N | = 〇 is calculated according to the formula Ni = o = Ai = () * f. 28. The method of claim 27 in the scope of patent application, where f is the golden ratio and takes a finite number of decimal places. The method includes the steps of: (a) starting a count i; (b) suffocating Li = 〇 = L and Ri = 〇 = R; (c) calculating Ai = L + heart; ( d) setting = Ri; (e) setting = Ai; (f) repeat steps (c) to (e) a total of T times; and (g) store Ai as the final decompressed version of the child digital file a. A method for compressing a digital file A without loss of data includes steps: 29. If the method in the scope of patent application No. 26 is used for compressing a data building case. 30. The method according to item 26 of the scope of patent application is used to encrypt a data file. 3k Two methods for processing a digital file. The digital file has two positive signs: the first value L, the second value r, and the third value τ. 6 32, 487854 A8 B8 C8 (a) Use a lossy compression algorithm to compress A for the first time to obtain A '; $ and 疋 A 丨' = A-AL0SSy, where ALossy is a lossy decompressed version of A 丨Step (a) decompress the pairwise method of the lossy compression algorithm; (c) start a count i = 0, and set A ,, i = Q = a ,,; (d) calculate the difference Ni = 〇, where N i == Q is a finite positive integer value; (e) Set Bi = A'VNi; (f) Check whether Bi is less than; (g) If yes, increase i value; (h) Set A ' = Nw; ⑴ Repeat steps (b) to (f) until & not less than%; and (j) combine and store A, B ..., Nom-1 and W to become a version of the file A. η. The method according to item 32 of the scope of patent application, where Nm = 0 is in accordance with the formula Ni = 〇 = Ai = 0 * f 〇. The method according to item 33 of the scope of patent application, where f is the golden section ratio, which takes a finite decimal Digits. 35. The method of claim 34, wherein the lossy compression algorithm is one of the following lossy compression algorithms: (a) JPEG data compression; (b) JPEG2000 data compression; (c) MPEG data Compression; (d) MP3 data compression; 487854 A8 B8 C8 D8 6. Scope of patent application (e) MP4 data compression; (f) DIVX data compression; and (g) Patented data compression. 3 6. —Method for decompressing a digital file, which is composed of data A 'compressed in a lossy manner and includes a first value L, a second value R, and a third The combination of finite positive integer values such as the value T indicates that the method includes the steps of: (a) using a method paired with a lossy compression algorithm to decompress the data 1 compressed using a lossy method to ALQSSy; (b) from The first count i; (c) Set Li = 〇 = L and Ri = 〇 = R, (d) Calculate A '= + heart; (e) Set Li = Ri, (f) Set Ri = A'; (g ) Repeat steps (d) to (f) a total of T times; and (h) combine ALQSsy and A ′ to become the final decompressed version of the digital file. 0 -8- This paper size applies the Chinese National Standard (CNS) A4 specification ( 210 X 297 mm)