Efficient LZW decompression processing method and system, terminal and medium

Abstract

The application relates to the technical field of data compression, and discloses an efficient LZW decompression processing method, system, terminal and medium, wherein the circuit throughput rate of an existing LZW decompression algorithm is low, a series of dictionary searching and stacking operation pipelines, a series of stacking and output operation pipelines, a straight-through loop and other measures are adopted to make the pipeline full-load run and resources be fully utilized, so that the rate of outputting characters of the LZW decompression algorithm circuit is improved, and the effect of outputting one character per clock beat is achieved. The efficient circuit of the LZW decompression algorithm constructed by using the branch prediction and multi-layer pipeline technology is used as an evaluation model. The feasibility and effectiveness of the evaluation method are verified through examples. The problems of low hardware circuit efficiency and long time consumption of the LZW decompression algorithm are avoided, and a new solution is provided for the hardware real-time implementation of the LZW decompression algorithm.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data compression, in particular to an efficient LZW decompression processing method, system, terminal and medium. BACKGROUND

[0002] The LZW algorithm is a lossless compression and decompression algorithm based on a dictionary, which uses the redundancy between information to achieve the purpose of compression and decompression. It can be divided into two parts of compression and decompression algorithms. Each part independently constructs its own dictionary, and the dictionary does not need to be transmitted with the compressed code. Compared with the compression algorithm based on statistical method, the LZW algorithm does not need to know the probability of occurrence of each character in advance, so the algorithm is widely used in the field of computer file compression.

[0003] In the process of generating a compressed code (10 bits), the LZW compression algorithm may query the dictionary multiple times until there is no such entry in the dictionary, and multiple characters are represented by one code, thereby achieving the purpose of compression. In this process, the more times the dictionary is queried, the more characters the code can replace, and the higher the compression rate.

[0004] Decompression is the reverse process of compression, which needs to decompress each compressed code into a series of ordered characters, and restore all characters before compression in order.

[0005] For a compressed code, the compression process it has undergone and the subsequent decompression process are inverse. Specifically, in the process of generating this compressed code, the characters compressed first will be decompressed later in the corresponding decompression process, and the characters compressed later will be decompressed first. Therefore, in the decompression process, the order of generating characters is opposite to the order of the final required characters, so a series of characters decompressed from each compressed code need to be temporarily stored in a stack, and then they are output in order after the decompression of the code is completed. That is, for each code to be decompressed, the decompression process is also a process of stacking and de-stacking. How to improve the efficiency of stacking and de-stacking directly affects the decompression throughput of the LZW decompression circuit. SUMMARY

[0006] In view of the problem of low efficiency of the LZW decompression algorithm circuit in the prior art, the present application provides an efficient LZW decompression processing method, system, terminal and medium, which can effectively improve the efficiency of stacking and de-stacking of the LZW decompression algorithm.

[0007] The present application is realized by the following technical solutions:

[0008] An efficient LZW decompression processing method comprises the following steps:

[0009] The code to be decompressed is input into the register of the dictionary address in turn;

[0010] The register in the dictionary address is branch predicted;

[0011] The series of stack-out operations of the decompression process of the previous register and the series of stack-in operations of the decompression process of the next register are overlapped in time to form multi-level pipelining operation and complete efficient LZW decompression processing.

[0012] Preferably, the branch prediction condition is as follows:

[0013] It is judged whether there is a phenomenon of no word entry in the current register, if there is a phenomenon of no word entry, the word entry of the previous register is assigned to the register of the current search word entry, and after the current register satisfies the branch prediction condition, multi-level pipelining operation is performed to complete efficient LZW decompression processing, otherwise, multi-level pipelining operation is directly performed to complete efficient LZW decompression processing.

[0014] Further, the phenomenon of no word entry is as follows:

[0015] If the read address is equal to the write address plus 1 when searching the dictionary, the phenomenon of no word entry will occur;

[0016] If the read address has address roll-back, the phenomenon of no word entry will occur.

[0017] Preferably, pipelining operation is performed in the decompression process of adjacent codes to be decompressed, and by setting ping-pong stack and synchronization mechanism, the series of stack-out operations of the decompression process of the previous code to be decompressed and the series of stack-in operations of the decompression process of the next code to be decompressed are overlapped in time.

[0018] Preferably, multi-pipelining operation is performed in each decompression process of the code to be decompressed, including:

[0019] In the same decompression process of the code to be decompressed, the dictionary search operation and the stack-in operation are pipelined;

[0020] In the same decompression process of the code to be decompressed, the stack-out operation of the series of characters decompressed is pipelined;

[0021] In the decompression process of the same code to be decompressed, the series of stack-in operations are pipelined.

[0022] Preferably, a straight-through loop is set in the multi-pipelining operation, the decompression process of the code to be decompressed is judged, and the judgment result is processed in advance, so that the pipeline runs full load.

[0023] An efficient LZW decompression processing system, comprising:

[0024] An input module is configured to input the to-be-decompressed codes into the registers of the dictionary addresses in sequence;

[0025] A judging module is configured to make a branch prediction on the registers in the dictionary addresses;

[0026] A processing module is configured to overlap a series of stack-out operations of the to-be-decompressed codes of the previous register and a series of stack-in operations of the to-be-decompressed codes of the next register in time to form multi-level pipeline operations and complete the efficient LZW decompression processing.

[0027] A mobile terminal comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the efficient LZW decompression processing method as described above when executing the computer program.

[0028] A computer readable storage medium stores a computer program, and the computer program implements the steps of the efficient LZW decompression processing method as described above when executed by a processor.

[0029] Compared with the prior art, the present application has the following beneficial technical effects:

[0030] The present application provides an efficient LZW decompression processing method, and the circuit throughput rate of the existing LZW decompression algorithm is low. The present application adopts a series of measures such as multi-level pipeline, a series of dictionary searching and stack-in operation pipeline, a series of stack-out and output operation pipeline, and a straight-through loop to make the pipeline run at full capacity and fully utilize resources, thereby improving the rate of output characters of the LZW decompression algorithm circuit and achieving the effect of outputting one character per clock cycle. The efficient circuit of the LZW decompression algorithm constructed by the branch prediction and multi-level pipeline technology is used as an evaluation model. The feasibility and effectiveness of the evaluation method are verified by examples. The problems of low hardware circuit efficiency and long time consumption of the LZW decompression algorithm are avoided, and a new solution is provided for the hardware real-time implementation of the LZW decompression algorithm. BRIEF DESCRIPTION OF DRAWINGS

[0031] Figure 1 A flowchart of the efficient LZW decompression processing method in the present application;

[0032] Figure 2 A structure diagram of the efficient LZW decompression processing system in the present application;

[0033] Figure 3 A principle diagram of the efficient LZW decompression processing process in Embodiment 1 of the present application;

[0034] Figure 4 This is a schematic diagram illustrating the pipelined decompression process of adjacent codes to be decompressed in this invention, achieved by setting up a ping-pong stack.

[0035] Figure 5 This is a schematic diagram illustrating the pipeline implementation of a series of dictionary lookup and stack push operations in the decompression process of the same code to be decompressed in this invention.

[0036] Figure 6 This is a schematic diagram illustrating the pipeline implementation of a series of pop and output operations in the decompression process of the same code to be decompressed in this invention. Detailed Implementation

[0037] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0038] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0039] The present invention will now be described in further detail with reference to the accompanying drawings:

[0040] This invention provides an efficient LZW decompression processing method, system, terminal, and medium, which can effectively improve the efficiency of push and pop operations in the LZW decompression algorithm.

[0041] Specifically, such as Figure 1 As shown, this invention provides an efficient LZW decompression method, comprising the following steps:

[0042] S1, input the code to be decompressed into the register at the dictionary address in sequence;

[0043] S2, perform branch prediction on the registers within the dictionary address;

[0044] S3, the series of out-stack operations of the previous register and the series of in-stack operations of the next register are overlapped in time to form multi-level pipelining operation, and efficient LZW decompression processing is completed.

[0045] Specifically, the branch prediction condition is as follows:

[0046] It is judged whether there is a phenomenon of no word entry in the current register, if there is a phenomenon of no word entry, the word entry of the previous register is assigned to the register currently searching for the word entry, and after the current register meets the branch prediction condition, multi-level pipelining operation is performed to complete efficient LZW decompression processing, otherwise, multi-level pipelining operation is directly performed to complete efficient LZW decompression processing.

[0047] The branch prediction in the application is a data processing method for solving the failure of pipelining caused by processing branch instructions (if-then-else), which is judged by the CPU to determine the direction of program branching, and can speed up the operation.

[0048] The phenomenon of no word entry exists, for example:

[0049] If the read address is equal to the write address plus 1 when searching the dictionary, the phenomenon of no word entry will occur;

[0050] If the read address has address backrolling, the phenomenon of no word entry will occur.

[0051] Specifically, pipelining operation is performed in the decompression process of adjacent to-be-decompressed codes, and by setting the ping-pong stack and synchronization mechanism, the series of out-stack operations of the previous to-be-decompressed code and the series of in-stack operations of the next to-be-decompressed code are overlapped in time.

[0052] Specifically, multi-pipelining operation is performed in each to-be-decompressed code decompression process, including:

[0053] In the same to-be-decompressed code decompression process, the dictionary searching operation and the in-stack operation are pipelined;

[0054] In the same to-be-decompressed code decompression process, the out-stack operation of a series of characters decompressed is pipelined;

[0055] In the same to-be-decompressed code decompression process, a series of in-stack operations are pipelined.

[0056] Specifically, in the multi-level pipelining operation, a bypass loop is set, the to-be-decompressed codes in the decompression process are judged, and the judgment result is processed in advance, so that the pipelining is full-load running.

[0057] Embodiment 1

[0058] Working principle of high-efficiency circuit of LZW decompression algorithm

[0059] The LZW decompression algorithm flow is as shown in Figure 3

[0060] (1) First, 0x00-0xff is stored as a word in the dictionary address 00x00-0xff;

[0061] (2) Then, the first to be decompressed code (each decompression code is 10 bits) is read from the input end FIFO, given to the register W, and its bit[7:0] is written into the decoding output FIFO;

[0062] (3) The next to be decompressed code is read from the input end FIFO, given to the registers K and M;

[0063] (4) Check if there is a word (content) in the address K of the dictionary. If not, assign W to K;

[0064] (5) Judge whether the word bit[17:8] of the K address is greater than 0x100. If not, steps (7) and (10) are executed at the same time;

[0065] (6) The word bit[7:0] of the K address is stacked; the word bit[17:8] of the K address is assigned to K. Go to step (4);

[0066] (7) An 18-bit data composed of W and (the first character of the to-be-decompressed code) is added to the subsequent address starting from 0x103 of the dictionary as a new word of the dictionary;

[0067] (8) Assign M to W;

[0068] (9) Judge whether there is to-be-decompressed code. If yes, go to step (3); if no, end;

[0069] (10) Judge whether the stack is empty. If yes, go to step (12);

[0070] (11) Stack out continuously and output to the decompression output FIFO until the stack is empty;

[0071] (12) Output the word of the current K address to the FIFO.

[0072] In order to make the decompression process fast and efficient, the following measures are taken: the stack out operation (steps (10), (11) and (12) in Figure 3 ) of the decompression process of the previous to-be-decompressed code is combined with the dictionary search and stack operation (steps (4), (5), (6) and (7) in Figure 3 ​The rest of the steps in the code to be decompressed) overlap in time; the series of push operations of the decompression process of the same code to be decompressed continuously flow; the series of pop operations of the decompression process of the same code to be decompressed continuously flow; the dictionary lookup operation and the push operation of the decompression process of the same code to be decompressed are executed in pipeline; a through circuit is set to make an early judgment on the dictionary lookup result, so that the pipeline continuously flows.

[0073] In the present embodiment, the pipeline is realized in the decompression process of adjacent codes to be decompressed

[0074] As shown in Figure 4 , based on a full analysis of the timing relationship of the dictionary lookup, push and pop operations, a series of pop operations of the decompression process of the previous code to be decompressed and a series of push operations of the decompression process of the next code to be decompressed are overlapped in time by setting the ping and pong stacks and the synchronization mechanism.

[0075] As shown in Figure 3 , in the process of decompressing a code to be decompressed, there will be a situation of continuous multiple dictionary lookups, and the higher the compression rate, the more the number of continuous dictionary lookups. The result of the dictionary lookup is pushed into the stack for temporary storage, so that the correct character order can be obtained when popped out. When the content of the K address bit[17:8] is not greater than 0x100, it indicates that the dictionary lookup operation for the code to be decompressed is completed, and the pop and output data stage is entered. This stage is relatively independent of the push operation, and by setting the ping and pong stacks and the synchronization mechanism, the pop operation of the ping stack in the decompression process of the previous code to be decompressed can be overlapped in time with the dictionary lookup operation and the push operation of the pong stack in the decompression process of the current code to be decompressed, so that the decompression process of adjacent codes to be decompressed is realized in pipeline, thereby reducing the time of hardware implementation of the LZW decompression algorithm by half.

[0076] In each decompression process of a code to be decompressed, multiple pipelining operations are realized

[0077] In the decompression process of the same code to be decompressed, the dictionary lookup operation and the push operation are realized in pipeline. As shown in Figure 5 ;

[0078] ②In the decompression process of the same code to be decompressed, the pop operation of a series of characters decompressed is realized in pipeline, as shown in Figure 6 .

[0079] In the multi-level pipelining operation, a through circuit is set to make a judgment on multiple codes to be decompressed in the decompression process, and the judgment result is processed in advance, so that the pipeline runs at full capacity.

[0080] For Figure 2The condition judging of step (4) judges the result of the dictionary (whether the dictionary contains the word) in advance, so that the pipeline does not break due to the judging result.

[0081] The dictionary current write address and read address are related, and it is judged in advance whether the word searching phenomenon will occur. The processing branch is entered in advance, the judging time is saved, and the efficiency is improved. Because the word searching operation exists in the LZW decompression algorithm, the word searching result is judged in advance, and the execution time of the decompression algorithm is greatly reduced.

[0082] The word searching phenomenon includes the following two cases:

[0083] (1) If the read address is equal to the write address plus 1, the word searching phenomenon will occur when searching the dictionary. (0x000 to 0x0ff address is not written in the decoding process, so the valid word in 0x000 address is not searched in the decompression process.)

[0084] (2) When the write address is 0x3ff and the read address is 0x103, the word searching phenomenon will occur when searching the dictionary. This is a special case where the read address (address roll-back) is equal to the write address plus 1.

[0085] Embodiment 2

[0086] The application is applied to a certain type of telemetry system, and the effect of outputting one decompressed character per clock cycle is realized.

[0087] By designing the LZW compression and decompression program, the original 1MB data is used as the input data of the LZW compression program, the output result of the LZW compression program is used as the input data of the LZW decompression program, and the output 1MB data of the LZW decompression program is compared with the input 1MB data of the LZW compression program, so as to verify the correctness of the compression and decompression program.

[0088] In the process of gradual optimization, the decompression time of 1MB data is as follows (main frequency 100MHz):

[0089] (1) Without any pipeline and straight-through loop, the decompression time is 60ms;

[0090] (2) On this basis, by continuously flowing the series of stack operations and output result operations of the decompression process of the same code to be decompressed, the decompression time is reduced to 53ms;

[0091] (3) On this basis, by continuously flowing a series of stack operations of the decompression process of the same code to be decompressed, the decompression time is reduced to 40ms;

[0092] (4) On this basis, by pipelining a series of dictionary lookup operations and stack operations of the decompression process of the same code to be decompressed, the decompression time is reduced to 31ms;

[0093] (5) On this basis, by adding a data bypass loop in the decompression process of the same code to be decompressed, branch prediction is realized, and the decompression time is reduced to 20ms;

[0094] (6) On this basis, a series of stack operations of the decompression process of the previous code to be decompressed and a series of stack operations of the decompression process of the next code to be decompressed are overlapped in time, and the decompression time is reduced to 10ms.

[0095] 10ms / 1MB=10ns / B, achieving the effect of outputting one decompressed character per clock cycle (10ns).

[0096] According to Figure 2 The application further provides a high-efficiency LZW decompression processing system, comprising an input module, a judgment module and a processing module.

[0097] The input module is used for sequentially inputting the code to be decompressed into the registers in the dictionary address.

[0098] The judgment module is used for branch prediction on the registers in the dictionary address.

[0099] The processing module is used for overlapping a series of stack operations of the decompression process of the previous register of the code to be decompressed and a series of stack operations of the decompression process of the next register of the code to be decompressed in time to form multi-level pipelining operation and complete high-efficiency LZW decompression processing.

[0100] The application further provides a mobile terminal, comprising a memory, a processor and a computer program stored in the memory and executable on the processor, such as a high-efficiency LZW decompression processing program.

[0101] The processor implements the steps of the high-efficiency LZW decompression processing method when executing the computer program, such as sequentially inputting the code to be decompressed into the registers in the dictionary address.

[0102] The judgment module is used for branch prediction on the registers in the dictionary address.

[0103] The series of out-stack operations of the decompression process of the previous register and the series of in-stack operations of the decompression process of the next register of the register meeting the branch prediction are overlapped in time to form multi-level pipelining operations, and efficient LZW decompression processing is completed.

[0104] Alternatively, the processor implements the functions of the modules in the above system when executing the computer program, for example: an input module for sequentially inputting the to-be-decompressed code into the registers of the dictionary address;

[0105] A judgment module for performing branch prediction on the registers in the dictionary address;

[0106] A processing module for overlapping the series of out-stack operations of the decompression process of the previous register and the series of in-stack operations of the decompression process of the next register of the register meeting the branch prediction in time to form multi-level pipelining operations, and completing efficient LZW decompression processing.

[0107] For example, the computer program can be divided into one or more modules / units, which are stored in the memory and executed by the processor to complete the present application. The one or more modules / units can be a series of computer program instruction segments capable of completing a specific function, which are used to describe the execution process of the computer program in the mobile terminal. For example, the computer program can be divided into an input module, a judgment module and a processing module;

[0108] An input module for sequentially inputting the to-be-decompressed code into the registers of the dictionary address;

[0109] A judgment module for performing branch prediction on the registers in the dictionary address;

[0110] A processing module for overlapping the series of out-stack operations of the decompression process of the previous register and the series of in-stack operations of the decompression process of the next register of the register meeting the branch prediction in time to form multi-level pipelining operations, and completing efficient LZW decompression processing.

[0111] The mobile terminal can be a desktop computer, a notebook, a palm computer and a cloud server, etc. The mobile terminal can include, but is not limited to, a processor, a memory.

[0112] The processor can be a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic components, discrete hardware components, etc. The general-purpose processor can be a microprocessor or can also be any conventional processor.

[0113] The memory can be used to store the computer programs and / or modules, and the processor realizes various functions of the mobile terminal by running or executing the computer programs and / or modules stored in the memory and calling the data stored in the memory.

[0114] The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application program required by a function (such as a sound playing function, an image playing function, etc.), etc.; and the data storage area can store data created according to the use of the mobile terminal (such as audio data, a phone book, etc.), etc. In addition, the memory can include a high-speed random access memory, and can also include a nonvolatile memory, for example, a hard disk, a memory, a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, at least one disk storage device, a flash memory device, or other volatile solid-state memory devices.

[0115] The application further provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to realize the steps of the efficient LZW decompression processing method.

[0116] If the modules / units of the mobile terminal are realized in the form of software function units and sold or used as independent products, the modules / units can be stored in a computer readable storage medium.

[0117] Based on the understanding, the present application implements all or part of the processes in the above method, and can also be instructed by a computer program to complete the relevant hardware. The computer program can be stored in a computer readable storage medium. When the computer program is executed by a processor, the steps of the above high-efficiency LZW decompression processing method can be implemented. The computer program includes computer program codes, which can be in the form of source code, object code, executable files or some intermediate forms, etc.

[0118] The computer readable medium can include any entity or device, recording medium, U disk, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal and software distribution medium, etc. that can carry the computer program code.

[0119] It should be noted that the content contained in the computer readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, the computer readable medium does not include electrical carrier signals and telecommunication signals.

[0120] Finally, it should be noted that: the above examples are only used to illustrate the technical solutions of the present application, but not to limit it. Although the present application has been described in detail with reference to the above examples, those skilled in the art should understand that the specific embodiments of the present application can be modified or replaced by the equivalent, without departing from the spirit and scope of the present application. Any modification or equivalent replacement without departing from the spirit and scope of the present application should be covered in the protection scope of the claims of the present application.

Claims

1. A high-efficient LZW decompression processing method, characterized in that, The method comprises the following steps: inputting the to-be-decompressed codes into the registers of the dictionary addresses in sequence; performing branch prediction on the registers in the dictionary addresses; overlapping a series of stack-out operations of the to-be-decompressed code decompression process of the previous register and a series of stack-in operations of the to-be-decompressed code decompression process of the next register in time for the registers meeting the branch prediction condition to form multi-level pipelining operation and complete efficient LZW decompression processing; the branch prediction condition is as follows: determining whether there is a phenomenon of no word entry in the current register, if there is the phenomenon of no word entry, assigning the word entry of the previous register to the register currently searching for the word entry, and performing multi-level pipelining operation to complete efficient LZW decompression processing after the current register meets the branch prediction condition, otherwise, directly performing multi-level pipelining operation to complete efficient LZW decompression processing; performing pipelining operation on the decompression processes of adjacent to-be-decompressed codes, overlapping a series of stack-out operations of the to-be-decompressed code decompression process of the previous register and a series of stack-in operations of the to-be-decompressed code decompression process of the next register in time by setting ping-pong stacks and synchronization mechanisms; performing various pipelining operations in each to-be-decompressed code decompression process, including: performing pipelining operation on the dictionary searching operation and the stack-in operation in the same to-be-decompressed code decompression process; performing pipelining operation on the stack-out operation of a series of characters decompressed in the same to-be-decompressed code decompression process; performing pipelining operation on a series of stack-in operations in the decompression process of the same to-be-decompressed code; setting a straight-through loop in the multi-level pipelining operation, judging the to-be-decompressed codes in the decompression process multiple times, and processing the judgment results in advance to make the pipelining fully loaded.

2. The method of claim 1, wherein the method comprises: The phenomenon of no word entry includes the following cases: if the read address is equal to the write address plus 1 when searching for the dictionary, the phenomenon of no word entry will occur; if the read address is rolled back, the phenomenon of no word entry will occur.

3. A high-efficient LZW decompression processing system, characterized in that, The efficient LZW decompression processing method according to any one of claims 1-2 comprises: an input module configured to input the to-be-decompressed codes into the registers of the dictionary addresses in sequence; a judgment module configured to perform branch prediction on the registers in the dictionary addresses; a processing module configured to overlap a series of stack-out operations of the to-be-decompressed code decompression process of the previous register and a series of stack-in operations of the to-be-decompressed code decompression process of the next register in time for the registers meeting the branch prediction condition to form multi-level pipelining operation and complete efficient LZW decompression processing.

4. A mobile terminal comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, The processor executes the computer program to implement the steps of the efficient LZW decompression processing method according to any one of claims 1-2.

5. A computer-readable storage medium storing a computer program, the computer program comprising instructions that, when executed by a computer, cause the computer to perform the method of any one of claims 1 to 4. The computer program is executed by the processor to implement the steps of the efficient LZW decompression processing method according to any one of claims 1-2.

Images