CN117950598B - Intelligent storage method for design data of electronic product - Google Patents
Intelligent storage method for design data of electronic product Download PDFInfo
- Publication number
- CN117950598B CN117950598B CN202410346324.4A CN202410346324A CN117950598B CN 117950598 B CN117950598 B CN 117950598B CN 202410346324 A CN202410346324 A CN 202410346324A CN 117950598 B CN117950598 B CN 117950598B
- Authority
- CN
- China
- Prior art keywords
- characters
- character
- buffer area
- data
- correction
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000013461 design Methods 0.000 title claims abstract description 29
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000012937 correction Methods 0.000 claims abstract description 72
- 238000007906 compression Methods 0.000 claims abstract description 47
- 230000006835 compression Effects 0.000 claims abstract description 40
- 238000012986 modification Methods 0.000 claims abstract description 16
- 230000004048 modification Effects 0.000 claims abstract description 16
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000010606 normalization Methods 0.000 claims description 4
- 230000000694 effects Effects 0.000 abstract description 19
- 238000013144 data compression Methods 0.000 abstract description 17
- 230000008569 process Effects 0.000 abstract description 9
- 230000006837 decompression Effects 0.000 description 4
- PCTMTFRHKVHKIS-BMFZQQSSSA-N (1s,3r,4e,6e,8e,10e,12e,14e,16e,18s,19r,20r,21s,25r,27r,30r,31r,33s,35r,37s,38r)-3-[(2r,3s,4s,5s,6r)-4-amino-3,5-dihydroxy-6-methyloxan-2-yl]oxy-19,25,27,30,31,33,35,37-octahydroxy-18,20,21-trimethyl-23-oxo-22,39-dioxabicyclo[33.3.1]nonatriaconta-4,6,8,10 Chemical compound C1C=C2C[C@@H](OS(O)(=O)=O)CC[C@]2(C)[C@@H]2[C@@H]1[C@@H]1CC[C@H]([C@H](C)CCCC(C)C)[C@@]1(C)CC2.O[C@H]1[C@@H](N)[C@H](O)[C@@H](C)O[C@H]1O[C@H]1/C=C/C=C/C=C/C=C/C=C/C=C/C=C/[C@H](C)[C@@H](O)[C@@H](C)[C@H](C)OC(=O)C[C@H](O)C[C@H](O)CC[C@@H](O)[C@H](O)C[C@H](O)C[C@](O)(C[C@H](O)[C@H]2C(O)=O)O[C@H]2C1 PCTMTFRHKVHKIS-BMFZQQSSSA-N 0.000 description 1
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to the technical field of data compression, in particular to an intelligent storage method of design data of an electronic product, which comprises the steps of determining correction necessary parameters when judging conditions are met whenever the current character to be compressed in a preceding buffer area is not matched with the character in a searching buffer area in the process of dictionary coding compression of data to be stored, judging whether the correction conditions are met or not, modifying the character in the preceding buffer area if the correction conditions are met, continuing dictionary coding compression of the modified preceding buffer area, and finally obtaining a first compressed file; determining a correction coefficient sequence according to the difference of characters in the advance buffer area before and after modification, and performing probability coding compression on the correction coefficient sequence to obtain a second compressed file; the first compressed file and the second compressed file are stored. The invention effectively improves the data compression effect and reduces the occupied storage space of the data.
Description
Technical Field
The invention relates to the technical field of data compression, in particular to an intelligent storage method for design data of electronic products.
Background
Along with the increasing development of electronic products, the design of the electronic products is more and more exquisite, the functions are more and more complicated, the design data are more and more, and the occupied storage space is more and more, so that the storage space control of the design data becomes a main problem of the data management of the electronic products. In order to reduce the storage space of the design data, it is a necessary option to compress the design data.
The conventional LZ77 coding belongs to lossless coding, and can be used for compressing design data of electronic products, so that the storage space of the design data can be effectively reduced. However, in the process of performing data compression by using LZ77 coding, the data compression effect is affected by the matching degree of the data in the advance buffer and the data in the search buffer, when the continuity of data matching is higher, the effect of performing data compression is better, but when the continuity of data matching is worse, the LZ77 coding is adopted at this time and then data coding compression is performed, instead, the coding length of the data is increased, the data compression effect is worse, and finally, the storage of design data is affected.
Disclosure of Invention
The invention aims to provide an intelligent storage method for design data of electronic products, which is used for solving the problem that the existing electronic products occupy large storage space due to poor data compression effect.
In order to solve the technical problems, the invention provides an intelligent storage method for design data of electronic products, which comprises the following steps:
Obtaining data to be stored, carrying out dictionary coding compression on the data to be stored, judging whether a judging condition is met or not whenever the current character to be compressed in a look-up buffer area is unmatched with characters in the look-up buffer area in the dictionary coding compression process, and determining correction necessary parameters according to the character lengths of all characters between the current character to be compressed and the corresponding character when the unmatched last time is met and the character lengths of continuous characters matched with the characters in the look-up buffer area;
judging whether a correction condition is met according to the correction necessary parameters, if so, modifying the characters in the advanced buffer area according to the characters in the search buffer area, and continuing dictionary coding compression on the modified advanced buffer area to finally obtain a first compressed file;
according to the difference of characters in the advanced buffer area before and after modification, determining a correction coefficient corresponding to each character in the advanced buffer area, so as to obtain a correction coefficient sequence corresponding to data to be stored, and carrying out probability coding compression on the correction coefficient sequence, so as to obtain a second compressed file;
the first compressed file and the second compressed file are stored.
Further, the calculation formula corresponding to the correction necessary parameter is determined as follows:
; wherein/> Indicating the correction necessary parameters; /(I)Representing character lengths of all characters between the current character to be compressed and the corresponding character when the mismatch occurs last time; /(I)A character length representing the continuous characters present in the look-up buffer that match the characters in the look-up buffer; /(I)Representing the normalization function.
Further, modifying the character in the look-ahead buffer area includes:
And determining the continuous characters which first appear in the advanced cache area and are matched with the characters in the search cache area as replacement characters, and determining all characters which are not matched with the characters in the search cache area before the replacement characters in the advanced cache area as replaced characters, and replacing the replacement characters and the replaced characters, so as to obtain a modified advanced cache area.
Further, modifying the character in the look-ahead buffer area includes:
and determining the continuous characters which first appear in the advance cache area and are matched with the characters in the search cache area as target characters, determining all characters which are not matched with the characters in the search cache area before the target characters in the advance cache area as modification characters, and modifying the modification characters into characters existing in the search cache area.
Further, a correction coefficient corresponding to each character in the advanced buffer area is determined, and a corresponding calculation formula is as follows:
; wherein/> Representing a correction coefficient corresponding to an nth character in the advance buffer area; /(I)A data value indicating an nth character in the preceding buffer area after correction; /(I)The data value representing the nth character in the advance buffer area before correction is performed.
Further, the judging condition at least includes: the character length of all characters between the current character to be compressed and the corresponding character when the mismatch appears last time is smaller than a first set character length threshold value, and the character length in the searching buffer area is not smaller than a second set character length threshold value.
Further, the correction condition at least includes: the correction necessary parameter is greater than the set parameter threshold.
Further, the compression of dictionary codes is performed by adopting LZ77 codes.
Further, when the determination condition is not satisfied, dictionary encoding compression is continued.
Further, the run-length coding is adopted to carry out probability coding compression on the correction coefficient sequence, so that a second compressed file is obtained.
The invention has the following beneficial effects: in the dictionary coding compression process of data to be stored, whether a judging condition is judged whenever data interruption occurs, namely that a current character to be compressed in a look-up buffer area is not matched with a character in a look-up buffer area, namely whether the character at the position where the data interruption occurs is required to be modified is judged, if the judging condition is met, the necessary degree of modifying the character at the position where the data interruption occurs is measured, a correction necessary parameter is determined, when the correction is necessary, the character in the look-up buffer area is modified according to the character in the look-up buffer area, so that the character length matched with the character in the look-up buffer area at the position where the data interruption occurs in the look-up buffer area is improved, dictionary coding compression is continuously carried out on the modified look-up buffer area, and finally the first compressed file is obtained. Meanwhile, in order to facilitate the subsequent decompression of the first compressed file obtained after compression and finally obtain the original data, after each time of modification of the characters in the advanced cache area, a correction coefficient sequence corresponding to the data to be stored is determined according to the difference of the characters in the advanced cache area before and after modification. Because only part of characters in the data to be stored are modified, the correction coefficient sequence contains a large number of repeated characters, so that probability encoding compression is carried out on the correction coefficient sequence, and finally a second compressed file is obtained. According to the invention, the character at the position where the data is interrupted in the dictionary coding compression process of the data to be stored is modified, so that the problem that the data volume of the data is increased after compression due to the fact that a plurality of triples are required to be constructed for the data at the position where the data is interrupted in the advance buffer zone in the existing LZ77 coding is effectively avoided, the data compression effect is effectively improved, the storage space occupied by the data is reduced, and the efficient storage of the data is realized.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions and advantages of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of an intelligent storage method for design data of an electronic product according to an embodiment of the invention;
Fig. 2 is a schematic view of a window according to an embodiment of the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purpose, the following detailed description is given below of the specific implementation, structure, features and effects of the technical solution according to the present invention with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. In addition, all parameters or indices in the formulas referred to herein are values after normalization that eliminate the dimensional effects.
In order to solve the problem that the existing method occupies large storage space due to poor data compression effect, the embodiment provides an intelligent storage method for design data of an electronic product, and a flow chart corresponding to the method is shown in fig. 1, and the method comprises the following steps:
(1) And acquiring data to be stored, performing dictionary coding compression on the data to be stored, judging whether a judging condition is met or not whenever the current character to be compressed in the advanced buffer area is unmatched with the character in the search buffer area in the dictionary coding compression process, and determining correction necessary parameters according to the character lengths of all characters between the current character to be compressed and the corresponding character when the unmatched state last time occurs and the character lengths of continuous characters which are matched with the characters in the search buffer area and exist in the advanced buffer area if the judging condition is met.
Firstly, data to be stored is obtained, and in this embodiment, the data to be stored refers to design data of an electronic product. After the design data of the electronic product is obtained, the data is subjected to data cleaning pretreatment, such as correction of errors, deletions and abnormal data in the data, so that the accuracy and consistency of the data are improved, noise and invalid information are eliminated, the data used for subsequent data compression are more complete and accurate, and the subsequent compression is facilitated. Of course, as another embodiment, when the obtained design data of the electronic product is itself complete and accurate, the preprocessing is not required at this time.
In order to realize the coding compression of the preprocessed electronic product design data, the existing LZ77 coding is used to determine the coding window size of the coding. Conventional LZ77 coding generally uses 4096 bytes as a coding window size of data, and divides the coding window into two parts, as shown in fig. 2, a left part is a search buffer area when data is coded, and a right part is a look-ahead buffer area. Compression performance is limited because a smaller coding window may result in LZ77 coding failing to find longer matches; the larger coding window may slow down the searching and matching process of the LZ77 coding, increasing the compression calculation load, so for the electronic product design data, the embodiment selects a window with a size of 8 bytes as the size of the coding window for subsequent coding compression.
After determining the coding window size, dictionary coding compression is first performed on the preprocessed electronic product design data using existing LZ77 coding. In the encoding compression process, the encoding window slides in the design data of the electronic product, and the data is encoded in a sliding manner. In the process of sliding coding, each time when the data in the advance buffer area is inconsistent with the data in the search buffer area, namely the character to be compressed currently in the advance buffer area is not matched with the character in the search buffer area, the data interruption is considered to occur. That is, when a data interrupt occurs, it means that the character currently to be compressed in the look-ahead buffer cannot be found in the look-up buffer. In this case, when encoding is performed by using LZ77 encoding, the encoding length becomes long at the time of data recoding, and the data compression effect becomes poor.
In order to improve the data compression effect, when each time data interruption occurs, the character lengths of all characters between the character to be compressed currently and the corresponding character when the mismatch appears last time in the advance buffer area are obtainedThat is, the character length/>, of all characters between the last occurrence of the data interrupt and the current occurrence of the data interrupt is obtained. For the first occurrence of data interruption in the encoding process, the character length/>Refers to the character length of all characters before the data interrupt currently occurs. When character length/>The larger the data is, the better the effect is when the current data is compressed by LZ77 coding, even if the data is interrupted, the subsequent compression can still be continued by LZ77 coding, and when the character length/>Smaller, the worse the effect when the current data is compressed using LZ77 coding, at which time improvements in LZ77 coding are needed to improve the data compression effect.
Based on the analysis, the character length of all characters between the current character to be compressed and the corresponding character when the mismatch appears last time in the advance buffer area is obtainedAnd then, judging whether the judging condition is met or not according to the character lengths of all the characters between the current character to be compressed and the corresponding character when the mismatch occurs last time and the character length in the searching buffer area. In the present embodiment, the determination conditions are: the character length of all characters between the current character to be compressed and the corresponding character when the mismatch appears last time is smaller than a first set character length threshold value, and the character length in the searching buffer area is not smaller than a second set character length threshold value. The size of the first set character length threshold can be selected and set according to experience, and the value of the set character length threshold is set to be 10 in the embodiment. In view of facilitating subsequent modification of characters in the preceding cache region, the present embodiment sets the value of the second set character length threshold to the length size of the search cache region, that is, the maximum number of characters that can be accommodated in the search cache region. When the judging condition is not met, continuing to adopt LZ77 coding to carry out dictionary coding compression, and not judging the subsequent data at the moment, namely, not judging whether the characters in the advance buffer area are required to be modified or not; when the determination condition is satisfied, the subsequent data needs to be determined at this time to determine whether the character in the advance buffer area is to be modified.
To determine whether to modify characters in a look-ahead buffer, a character length of consecutive characters in the look-ahead buffer that are present after the data interrupt has occurred that match characters in the look-ahead buffer is obtainedThat is, skipping the current character to be compressed which is not matched with the character in the searching buffer area in the previous buffer area, continuing character matching until a single or continuous character matched with the character in the searching buffer area is found, and recording the character length of the matched single or continuous character as/>. When a single or consecutive character matching the character in the look-up buffer is not found in the previous buffer, then the character length/>The value of (2) is 0.
On the basis, according to the character length of all the characters between the current character to be compressed and the corresponding character when the mismatch appears last time and the character length of the continuous characters which exist in the advance buffer area and are matched with the characters in the search buffer area, the correction necessary parameters are determined, and the corresponding calculation formula is as follows:
; wherein/> Indicating the correction necessary parameters; /(I)Representing character lengths of all characters between the current character to be compressed and the corresponding character when the mismatch occurs last time; /(I)A character length representing the continuous characters present in the look-up buffer that match the characters in the look-up buffer; /(I)Representing the normalization function.
In the above calculation formula for correcting the necessary parameters, the character lengths of all the characters between the current character to be compressed and the corresponding character when the mismatch occurs last timeThe smaller the value of (c) indicates that the worse the effect of the current data compressed using LZ77 coding is, while the character length/>, of consecutive characters present in the advance buffer that match the characters in the lookup bufferWhen the value of the data is larger, the character number which is consistent with the character matching in the searching buffer area in the preceding buffer area can be effectively improved after the follow-up modification of the unmatched current character to be compressed according to the character in the searching buffer area, so that the construction times of triples when LZ77 coding is used are reduced, the better the effect of LZ77 coding compression on the data is, the larger the unmatched current character to be compressed should be modified at the moment, and the larger the value of the corresponding correction necessary parameter is.
(2) Judging whether the correction condition is met according to the correction necessary parameters, if so, modifying the characters in the advanced buffer area according to the characters in the search buffer area, and continuing dictionary coding compression on the modified advanced buffer area to finally obtain the first compressed file.
After the correction necessary parameters are determined through the above steps, it is determined whether the correction condition is satisfied or not based on the correction necessary parameters. In the present embodiment, the correction conditions are: the correction necessary parameter is greater than the set parameter threshold. The set parameter threshold value can be reasonably set according to experience, and the value of the set parameter threshold value is set to be 0.7 in the embodiment. When the correction condition is not satisfied, the characters in the advance buffer area are not required to be modified, and the LZ77 coding is continuously adopted for dictionary coding compression. When the correction condition is satisfied, the characters in the advance buffer area need to be modified according to the characters in the search buffer area.
Optionally, modifying the characters in the look-up buffer area according to the characters in the look-up buffer area, where the implementation steps include:
And determining the continuous characters which first appear in the advanced cache area and are matched with the characters in the search cache area as replacement characters, and determining all characters which are not matched with the characters in the search cache area before the replacement characters in the advanced cache area as replaced characters, and replacing the replacement characters and the replaced characters, so as to obtain a modified advanced cache area.
For ease of understanding, when characters in the look-ahead buffer are modified, the characters in the look-ahead buffer are sequentially matched with characters in the look-up buffer in order, so that the first appearing consecutively matched characters are determined, and the characters are taken as replacement characters. While all characters preceding the replacement character in the advance buffer area are determined as replaced characters.
And replacing the positions of the replacement character and the replaced character, thereby obtaining a modified advanced cache area. For example, the character in the look-ahead buffer is EFABG, where character EF does not match the character in the look-up buffer, i.e., characters E and F are not included in the look-up buffer, and thus the above-indicated data interrupt occurs. The character AB matches the character in the search cache, i.e. characters a and B are contained in the search cache. At the same time, character G does not match the character in the lookup buffer. At this time, the character AB is determined as a replaced character, the character EF is determined as a replaced character, and the character EF and the character AB are subjected to position replacement, and at this time, the character in the modified look-ahead buffer area is ABEFG. By modifying the characters in the advanced buffer area in this way, the effect of the subsequent data encoding compression can be effectively improved.
Alternatively, as another embodiment, the modifying the character in the look-ahead buffer according to the character in the look-up buffer includes:
and determining the continuous characters which first appear in the advance cache area and are matched with the characters in the search cache area as target characters, determining all characters which are not matched with the characters in the search cache area before the target characters in the advance cache area as modification characters, and modifying the modification characters into characters existing in the search cache area.
For ease of understanding, when characters in the advance buffer area are modified, the characters that are consecutively matched that first appear in the advance buffer area are determined in the same manner as described above, and for ease of distinction, these characters are referred to as target characters. Meanwhile, all characters preceding the target character in the advance cache area are referred to as modified characters. At this time, the modified character is modified according to the character in the search buffer area so that a longer continuous character matching the character in the search buffer area occurs in the advance buffer area as much as possible.
When modifying the modified character, if the character string formed by the target characters exists in the search cache area, and the length of the character existing before the character string is not smaller than the character length of the modified character, the character before the character string and the character length equal to the character length of the modified character is directly utilized to replace the modified character, and after replacement, the character string formed by the target character and all the characters before the target character in the search cache area appears in the search cache area. For example, also for the character EFABG in the advance buffer area, if the character in the search buffer area is ABABC at the same time regardless of the window size, the modified character EF in the advance buffer area is replaced by the characters a and B immediately before the character string AB composed of the characters a and B appearing the second time in the search buffer area, and the character in the advance buffer area is ABABG after the replacement. If the character string formed by the target characters exists in the searching cache area, but the length of the character existing before the character string is smaller than that of the modified character, the characters positioned before the target character in the advance cache area are replaced by directly utilizing all the characters in front of the character string. For example, similarly, for the character EFABG in the advance buffer area, if the character BABC is found at the same time, the modified character EF in the advance buffer area is replaced with the character B before the character string AB composed of the characters a and B in the search buffer area, and after the replacement, the character in the advance buffer area is EBABG. If the character string formed by the target characters exists in the search cache area, but no character exists in front of the character string, the character which is positioned in front of the modified character in the search cache area and has the character length equal to the character length of the modified character is directly adopted to replace the modified character. For example, for the character EFABG in the advance buffer area, if the character in the search buffer area is ABCD at the same time, the modified character EF in the advance buffer area is replaced by the character CD in the search buffer area, and after the replacement, the character in the advance buffer area is CDABG.
Of course, when modifying the modified character, if the character string formed by the target characters does not exist in the search buffer area, only the front part character among the target characters exists, then the character before the target character in the preceding buffer area is replaced by the character string before the part character existing in the search buffer area in the same manner as above, so that the continuous character matched with the character in the search buffer area as long as possible appears in the preceding buffer area after the replacement.
After the characters in the preceding buffer area are modified in the above manner, based on the modified preceding buffer area, the dictionary coding compression is continuously performed by adopting LZ77 coding, when the data interruption occurs again next time, the characters in the preceding buffer area are modified again in the same manner, the dictionary coding compression is continuously performed by adopting LZ77 coding after the modification until the compression is finished, and finally the first compressed file is obtained.
(3) And determining a correction coefficient corresponding to each character in the advanced buffer area according to the difference of the characters before and after modification in the advanced buffer area, so as to obtain a correction coefficient sequence corresponding to data to be stored, and carrying out probability coding compression on the correction coefficient sequence, so as to obtain a second compressed file.
In order to facilitate the subsequent decompression of the compressed first compressed file and finally obtain the original data, after each modification of the characters in the advanced buffer area, the correction coefficient corresponding to each character in the advanced buffer area needs to be determined according to the difference between the characters in the advanced buffer area before and after the modification, so as to finally obtain the correction coefficient corresponding to each character in the data to be stored. That is, by comparing the modified set of data with the original set of data, a correction coefficient between the modified data and the original data is obtained, and the corresponding calculation formula is:
; wherein/> Representing a correction coefficient corresponding to an nth character in the advance buffer area; /(I)A decimal value representing conversion of the nth character in the look-ahead buffer area to ascii code after correction; /(I)The n-th character in the buffer area before correction is converted into decimal value of ascii code, which is not zero and can be directly used as denominator.
By the same manner of determining the correction coefficient corresponding to each character in the advance buffer area, the correction coefficient corresponding to each character in the data to be stored can be determined, and a correction coefficient sequence can be obtained according to the arrangement order of the characters in the data to be stored. Since the correction coefficient corresponding to the unmodified character in the correction coefficient sequence is 1 and only a part of characters in the data to be stored are modified, the data of the correction coefficients continuously 1 in the obtained correction coefficient sequence are more. Therefore, the run-length coding is used for carrying out probability coding compression on the correction coefficient sequence, unified coding is carried out on data with higher continuous repetition rate in the correction coefficient sequence, so that the redundancy of the data is reduced, and finally a second compressed file is obtained.
(4) The first compressed file and the second compressed file are stored.
After the first compressed file and the second compressed file are obtained through the steps, the first compressed file and the second compressed file are stored and transmitted. When the data needs to be decompressed, the first compressed file is decoded by using the LZ77 coding decoding mode, the second compressed file is decoded by using the run-length coding decoding mode, and the two decoding results are combined to finally obtain the original data for use. Since the decompression process is opposite to the data compression process described above and the data compression process has been described in detail above, the decompression process will not be described in detail here.
According to the invention, the character at the position where the data is interrupted in the dictionary coding compression process of the data to be stored is modified, so that the character compression efficiency of LZ77 coding at the position where the data is interrupted is improved, the problem that the data is increased after compression due to the fact that a plurality of triples are constructed for the data at the position where the data is interrupted in the advance buffer area in the existing LZ77 coding is effectively avoided, the data compression effect is effectively improved, the occupied storage space of the data is reduced, and the efficient storage of the data is realized.
It should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.
Claims (6)
1. An intelligent storage method for design data of electronic products is characterized by comprising the following steps:
Obtaining data to be stored, carrying out dictionary coding compression on the data to be stored, judging whether a judging condition is met or not whenever the current character to be compressed in a look-up buffer area is unmatched with characters in the look-up buffer area in the dictionary coding compression process, and determining correction necessary parameters according to the character lengths of all characters between the current character to be compressed and the corresponding character when the unmatched last time is met and the character lengths of continuous characters matched with the characters in the look-up buffer area;
judging whether a correction condition is met according to the correction necessary parameters, if so, modifying the characters in the advanced buffer area according to the characters in the search buffer area, and continuing dictionary coding compression on the modified advanced buffer area to finally obtain a first compressed file;
according to the difference of characters in the advanced buffer area before and after modification, determining a correction coefficient corresponding to each character in the advanced buffer area, so as to obtain a correction coefficient sequence corresponding to data to be stored, and carrying out probability coding compression on the correction coefficient sequence, so as to obtain a second compressed file;
storing the first compressed file and the second compressed file;
The calculation formula corresponding to the correction necessary parameters is determined as follows:
; wherein/> Indicating the correction necessary parameters; /(I)Representing character lengths of all characters between the current character to be compressed and the corresponding character when the mismatch occurs last time; /(I)A character length representing the continuous characters present in the look-up buffer that match the characters in the look-up buffer; /(I)Representing a normalization function;
modifying characters in the look-ahead cache region, comprising:
Determining continuous characters which first appear in the advanced cache area and are matched with characters in the search cache area as replacement characters, determining all characters which are not matched with the characters in the search cache area before the replacement of the characters in the advanced cache area as replaced characters, and replacing the replacement characters and the replaced characters, so as to obtain a modified advanced cache area;
modifying characters in the look-ahead cache region, comprising:
Determining continuous characters which first appear in the advanced cache region and are matched with characters in the search cache region as target characters, determining all characters which are not matched with the characters in the search cache region before the target characters in the advanced cache region as modified characters, and modifying the modified characters into characters existing in the search cache region;
Determining a correction coefficient corresponding to each character in the advanced cache region, wherein the corresponding calculation formula is as follows:
; wherein/> Representing a correction coefficient corresponding to an nth character in the advance buffer area; /(I)A data value indicating an nth character in the preceding buffer area after correction; /(I)The data value representing the nth character in the advance buffer area before correction is performed.
2. The intelligent storage method of electronic product design data according to claim 1, wherein the determining conditions at least include: the character length of all characters between the current character to be compressed and the corresponding character when the mismatch appears last time is smaller than a first set character length threshold value, and the character length in the searching buffer area is not smaller than a second set character length threshold value.
3. The intelligent storage method of electronic product design data according to claim 1, wherein the correction conditions at least include: the correction necessary parameter is greater than the set parameter threshold.
4. The intelligent storage method of electronic product design data according to claim 1, wherein the dictionary coding compression is performed by adopting LZ77 coding.
5. The intelligent storage method of electronic product design data according to claim 1, wherein dictionary coding compression is continued when the determination condition is not satisfied.
6. The intelligent storage method of electronic product design data according to claim 1, wherein the run-length encoding is used to perform probability encoding compression on the correction coefficient sequence, so as to obtain a second compressed file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410346324.4A CN117950598B (en) | 2024-03-26 | 2024-03-26 | Intelligent storage method for design data of electronic product |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410346324.4A CN117950598B (en) | 2024-03-26 | 2024-03-26 | Intelligent storage method for design data of electronic product |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117950598A CN117950598A (en) | 2024-04-30 |
| CN117950598B true CN117950598B (en) | 2024-06-07 |
Family
ID=90801776
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410346324.4A Active CN117950598B (en) | 2024-03-26 | 2024-03-26 | Intelligent storage method for design data of electronic product |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117950598B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107135003A (en) * | 2017-04-19 | 2017-09-05 | 西安电子科技大学 | Text compression methods are realized based on Gzip hardware |
| CN108880556A (en) * | 2018-05-30 | 2018-11-23 | 中国人民解放军战略支援部队信息工程大学 | Destructive data compressing method, error-resilience method and encoder and decoder based on LZ77 |
| CN109672449A (en) * | 2018-12-13 | 2019-04-23 | 武汉中元华电科技股份有限公司 | A kind of device and method fast implementing LZ77 compression based on FPGA |
| WO2022198483A1 (en) * | 2021-03-24 | 2022-09-29 | 深圳市大疆创新科技有限公司 | Data compression method and apparatus, movable platform, and storage medium |
| CN115514375A (en) * | 2022-11-18 | 2022-12-23 | 江苏网进科技股份有限公司 | Cache data compression method |
| CN116137534A (en) * | 2023-01-16 | 2023-05-19 | 阿里巴巴（中国）有限公司 | Lossless compression method, electronic device, and storage medium |
-
2024
- 2024-03-26 CN CN202410346324.4A patent/CN117950598B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107135003A (en) * | 2017-04-19 | 2017-09-05 | 西安电子科技大学 | Text compression methods are realized based on Gzip hardware |
| CN108880556A (en) * | 2018-05-30 | 2018-11-23 | 中国人民解放军战略支援部队信息工程大学 | Destructive data compressing method, error-resilience method and encoder and decoder based on LZ77 |
| CN109672449A (en) * | 2018-12-13 | 2019-04-23 | 武汉中元华电科技股份有限公司 | A kind of device and method fast implementing LZ77 compression based on FPGA |
| WO2022198483A1 (en) * | 2021-03-24 | 2022-09-29 | 深圳市大疆创新科技有限公司 | Data compression method and apparatus, movable platform, and storage medium |
| CN115514375A (en) * | 2022-11-18 | 2022-12-23 | 江苏网进科技股份有限公司 | Cache data compression method |
| CN116137534A (en) * | 2023-01-16 | 2023-05-19 | 阿里巴巴（中国）有限公司 | Lossless compression method, electronic device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117950598A (en) | 2024-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10979071B2 (en) | Systems and methods for variable length codeword based, hybrid data encoding and decoding using dynamic memory allocation | |
| CN108880556B (en) | LZ 77-based lossless data compression method, error code recovery method, encoder and decoder | |
| US9559720B2 (en) | Compression analyzer | |
| CN114244373B (en) | LZ series compression algorithm coding and decoding speed optimization method | |
| US9054729B2 (en) | System and method of compression and decompression | |
| CN108768403B (en) | LZW-based lossless data compression and decompression method, LZW encoder and decoder | |
| CA2263453C (en) | A lempel-ziv data compression technique utilizing a dictionary pre-filled with frequent letter combinations, words and/or phrases | |
| US5870036A (en) | Adaptive multiple dictionary data compression | |
| EP2034738B1 (en) | Data compression apparatus and method | |
| US20120130965A1 (en) | Data compression method | |
| CN112953550B (en) | Data compression method, electronic device and storage medium | |
| US10528539B2 (en) | Optimized selection of hash collision chains | |
| EP2034739B1 (en) | Data compression/decompression apparatus and method | |
| WO1998006028A9 (en) | A lempel-ziv data compression technique utilizing a dicionary pre-filled with fequent letter combinations, words and/or phrases | |
| JP3083730B2 (en) | System and method for compressing data information | |
| CN112968706A (en) | Data compression method, FPGA chip and FPGA online upgrading method | |
| CN117950598B (en) | Intelligent storage method for design data of electronic product | |
| US7889102B2 (en) | LZSS with multiple dictionaries and windows | |
| CN115567058A (en) | Time sequence data lossy compression method combining prediction and coding | |
| CN109831211B (en) | Semi-dynamic data compression algorithm using control symbols | |
| CN115514967B (en) | Image compression method and image decompression method based on binary block bidirectional coding | |
| CN117955500A (en) | Efficient LZMA encoding and decoding method based on hardware architecture | |
| US12034462B2 (en) | Compressing probability tables for entropy coding | |
| US20240056097A1 (en) | Compressing probability tables for entropy coding | |
| JP3648944B2 (en) | Data encoding method, data encoding device, data decoding method, and data decoding device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |