Check patentability & draft patents in minutes with Patsnap Eureka AI!

A method and device for producing lz77

A dynamic generation and suffix technology, applied in the direction of code conversion, electrical components, etc., can solve the problem of no longer applicable, achieve the effect of fast running speed and reduced space requirements

Active Publication Date: 2018-12-21
SYSU CMU SHUNDE INT JOINT RES INST +1
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the case of limited memory space and large data size, this type of system that generates LZ77 is obviously no longer applicable

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A method and device for producing lz77
  • A method and device for producing lz77

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] The present invention will be further described below in conjunction with the accompanying drawings, but the embodiments of the present invention are not limited thereto.

[0050] First, the LZ77 that produces the string T can be calculated from the PSV and NSV arrays. For example: scan the string T from left to right, when scanning to T[i], just calculate LCP(i,nsv[i]) and LCP(i,psv[i]), where LCP is the longest common prefix (longest common prefix), the function LCP(i,j) calculates the length of the longest common prefix between suffixes i and j, that is, compares the substring T[i..n] with the same character as T[j..n] from the first character the number of . If LCP(i,nsv[i])>LCP(i,psv[i]), and LCP(i,nsv[i]) is greater than 0, then LZ77 at position i of string T is (nsv[i], LCP(i, nsv[i])), else (psv[i], LCP(i, psv[i])); if LCP(i, nsv[i]) and LCP(i, psv[i]) Both are equal to 0, indicating that there is no matching character string in front of the position i of the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method and device for generating an LZ77. For a character string T with the length n, the method and device can enable the space cost for generating the LZ77 to be reduced to 4n, i.e., just needing an integer-type array space with the length n. Compared with other systems or programs with the space cost 8n, the system greatly reduce the space demands, and is higher in operation speed. In an actual application field, the method and device can be used for quickly generating the character string LZ77 which is larger in scale when the storage space is limited.

Description

technical field [0001] The invention relates to the technical field of data compression, in particular to a method and device for generating LZ77 using very little space. Background technique [0002] LZ77 (Lempel-Ziv) is an important concept in computer science. Due to the good efficiency of using LZ77 in string text processing programs, LZ77 is widely used in file compression, pattern recognition, sequence alignment, and full-text indexing. field. Practice has proved that using LZ77-based compression software to compress text strings with high repetition characteristics (such as genetic text data sets) has very high compression efficiency. The famous text compression software gzip uses LZ77 technology. [0003] Assuming a character string T=T[1..n]=T[1]T[2]...T[n] with a length of n, all characters in T come from the character set Σ, and Σ is a character set with a size of O(1). Constant character set, when 1≤i≤j≤n, T[i,j]=T[i][i+1]...T[j] is a character substring. The ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H03M7/30
CPCH03M7/3086
Inventor 刘伟军农革吴裔
Owner SYSU CMU SHUNDE INT JOINT RES INST
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More