46results about How to "Fast decompression" patented technology

The invention provides methods for processing data compression and decompression. The method for processing data compression comprises the following steps of: acquiring a file size before the compression; dividing a file which is not compressed into n segment according to the file size before the compression, calculating an index table size, and setting an index table at a head position of a compressed file; and compressing all the segments sequentially, writing the compression data into the compressed file, and recording the initial positions of all the segments in the compressed file to record items. The method for processing data decompression comprises the following steps of: receiving a user request instruction; according to the user request instruction, calculating the segment numbers of the acquired data, and reading the initial positions in the index table; sequentially reading and decompressing the data of all the segments according to the initial positions of the acquired data; and returning the data which are requested by a user to an upper layer. During the compression process, manual intervention is not needed; and during the decompression process, decompression is carried out segment by segment according to the user request, so the decompression speed is fast.

The invention relates to a method for coding electronic books, electronic newspapers and electronic magazines with hyperlink. The method comprises the following steps of: firstly, processing text and graph typesetting information input by a user through a TTK-format electronic book editor to generate a TTK-format electronic book with hyperlink, processing the text and graph typesetting information input by the user according to a Json protocol to generate the TTK-format electronic book, and compressing and packing the TTK-format electronic book; secondly, utilizing the Internet to download the TTK-format electronic book of the first step to terminal equipment which is an electronic reader; and finally, reading the decoded TTK-format electronic book on the electronic reader by the user.

An embedded device is hibernated by storing state data of the embedded device to a non-volatile data storage medium, and powering off the embedded device. The embedded device is later woken up in response to the detection of a wakeup event from a wakeup source. The state data stored in the RAM of the embedded device comprises one or more registers of a Central Processing Unit (CPU) of the embedded device, one or more registers of a system-on-chip (SOC) of the embedded device, and the system and applications code and data. Waking the embedded device comprises loading, from the non-volatile data storage medium, initial memory sections that are used to run a kernel of the embedded device. State data that is stored in the RAM of a system is compressed by dividing the RAM into a plurality of sections and independently choosing, for each section in the plurality of sections, a compression arithmetic. For each section, a compression arithmetic that has a high decompression speed is selected. The selected compression arithmetic is used to compress data in the section.

The invention relates to a binary image lossless compression and decompression IP core based on an FPGA. The binary image lossless compression and decompression IP core based on the FPGA comprises a register used for storing binary image data, an FIFO unit used for reading the binary image data in the register, an MR compression module which reads the original binary image data in the register through the FIFO unit and compresses the read original binary image data, and an MR decompression module which is used for reading the compressed binary image data in the register through the FIFO unit and decompressing the read compressed binary image data. The binary image lossless compression and decompression IP core based on the FPGA has the advantages of being good in binary image compression effect and high in compression and decompression speed. The binary image lossless compression and decompression IP core based on the FPGA can achieve a good application prospect in G3 equipment, G4 equipment and the application technology field.

The invention discloses a pipeline millisecond online data compound compression/decompression method, belonging to the field of data compression. The method comprises the following steps of: firstly, performing wavelet decomposition for the data, screening high-frequency and low-frequency wavelet coefficients with a threshold value, then, performing lossy compression for the data corresponding to the screened high-frequency wavelet coefficient through a SPIHT algorithm, performing lossy compression for the data corresponding to the screened low-frequency wavelet coefficient through a LZ77 algorithm, and finally obtaining the compression result. In an upper computer, data is decompressed through dSPIHT and dLZ77 methods. The compression method provided by the invention can reduce compression ratio under the premise of guaranteeing information integrity, save space for storage of millisecond data of a lot of pipelines and improve speed of data transmission; and the decompression method provided by the invention not only can guarantee decompression speed, but also can guarantee accuracy and integrity of recovered information.

A fast, raster-based, enhanced, data compression technique for the printing of compound documents, including pre-processing images in an original page description form of the data before the page data is rasterized, greatly improving compressibility. Unscaled image data is filtered before it is rasterized to the final printing resolution. The filtering specifically enables a separate, near loss-less, compression algorithm to operate on a rasterized page description with high compression ratios. A data compression technique enables a system to compress compound document using a relatively fast and simple algorithm with near loss-less print quality.

The invention provides a compression packet decompression method and device based on a matching tree, and a storage medium. The method comprises the following steps: a matching tree construction stepof constructing a matching tree based on a decompression configuration file; extracting step of reading the file name of the file in the compressed package, matching the file name with the matching tree, extracting the file if the matching is successful, and not extracting the file if the matching is unsuccessful. Thus, the required files are decompressed, and unwanted files are not decompressed,the decompression speed is greatly improved, the access times to the disk are reduced, the IO performance of the disk is improved, the energy consumption of the terminal equipment is reduced, the occupancy of the storage space is reduced, the running speed of the terminal equipment is improved, and the user experience is improved.

The invention discloses an index data compression method of a web diagram. After dividing the index data (degrees and displacements) into blocks containing hundreds to thousands of nodes, then most ofthe blocks contain only low degree nodes, and the degree and displacement differences in these blocks can usually be stored in one or two bytes, and the compression rate of the index data can reach more than 50% (from the previous four bytes to one or two bytes), which improves the compressibility; The degree and displacement codewords of the same node are stored in the same cache line with highprobability through the cross storage of degree and displacement codewords, so the cache hit rate can be greatly improved; Through the fixed-length encoding to achieve real random access, the fixed-length encoding makes the index of the node compressed data be calculated, and according to the subscript for real random access, the decompression speed is improved.