CN112525450B - Method for reducing occupancy rate of vibration data storage space in reliability test - Google Patents
Method for reducing occupancy rate of vibration data storage space in reliability test Download PDFInfo
- Publication number
- CN112525450B CN112525450B CN202011153862.XA CN202011153862A CN112525450B CN 112525450 B CN112525450 B CN 112525450B CN 202011153862 A CN202011153862 A CN 202011153862A CN 112525450 B CN112525450 B CN 112525450B
- Authority
- CN
- China
- Prior art keywords
- data
- compression
- writing
- value
- sign
- 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
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000013500 data storage Methods 0.000 title claims abstract description 11
- 238000007906 compression Methods 0.000 claims abstract description 69
- 230000006835 compression Effects 0.000 claims abstract description 69
- 230000006837 decompression Effects 0.000 claims abstract description 14
- 238000013144 data compression Methods 0.000 claims abstract description 9
- 230000003287 optical effect Effects 0.000 claims abstract description 4
- 230000035945 sensitivity Effects 0.000 claims description 18
- 238000007405 data analysis Methods 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 abstract 1
- 230000006870 function Effects 0.000 description 14
- 230000001133 acceleration Effects 0.000 description 6
- 238000004458 analytical method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000006073 displacement reaction Methods 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 238000005070 sampling Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01M—TESTING STATIC OR DYNAMIC BALANCE OF MACHINES OR STRUCTURES; TESTING OF STRUCTURES OR APPARATUS, NOT OTHERWISE PROVIDED FOR
- G01M7/00—Vibration-testing of structures; Shock-testing of structures
- G01M7/02—Vibration-testing by means of a shake table
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/3059—Digital compression and data reduction techniques where the original information is represented by a subset or similar information, e.g. lossy compression
- H03M7/3062—Compressive sampling or sensing
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention discloses a method for reducing the occupancy rate of a vibration data storage space in a reliability test, and belongs to the technical field of data compression algorithms and data transmission. The hardware adopted by the method comprises a sensor, a collector, a data service center and a DVD disc; the method comprises the following steps: firstly, the acquisition card transmits the original voltage value data in the sensor to the cache of the acquisition card, and the voltage value data is grouped and compressed into data packets through a compression algorithm module and stored in a storage module of the acquisition card; secondly, the data compression packet is recorded into the DVD disc; then copying the data compression packet in the DVD optical disk to a storage module of a data service center; and finally, when the user needs the source data, the data is decoded by a decompression algorithm module of the data service center. The invention reduces the occupancy rate of the memory during storage by compressing the vibration data in a lossless manner, thereby solving the problems of storage and unloading of a large amount of data.
Description
Technical Field
The invention relates to a method for reducing the occupancy rate of a vibration data storage space in a reliability test, and belongs to the technical field of data compression algorithms and data storage.
Background
The reliability test is an important link of reliability work, and a part which is very important in the reliability test is a vibration test. An important feature of this test is that a large amount of data is continuously generated for a long time, but the memory of the collector is very limited.
Data used for collecting vibration data in vibration test practice is 64-bit double-precision floating point type data, and single data occupies 8Bytes in a memory. Typically, the number of sensors in a collector is 64, and the sampling frequency is 5120HZ, then the data generated by a single sensor in 1 second reaches 40.96KB, so the data amount of a single collector in 1 second reaches 2.62 MB.
At present, the common methods for solving the problem of mass storage of data include three methods of increasing memory, arranging data in time and transferring DVD discs. The first and third methods are costly, and the second method requires additional labor and is not conducive to automation of the test.
In actual operation, for the purpose of security, a DVD disc is usually used as an intermediate medium to copy data and complete data transfer, average speeds of up and down rows of a common DVD disc in the market are about 4.14MB/s and 8.23MB/s respectively, so that data copying takes a long time, and the larger the number of used discs, the more easily the disc surface is scratched to cause data damage, along with the limited capacity of the DVD disc. Therefore, it is urgent to reduce the memory occupancy rate of the test data.
Disclosure of Invention
In view of the above, the present invention provides a method for reducing the occupancy rate of the storage space of vibration data in reliability test, which reduces the occupancy rate of the memory during storage by performing lossless compression on the vibration data, thereby solving the problem of mass data storage and unloading, and simultaneously not causing the increase of test cost.
A method for reducing the occupancy rate of vibration data storage space in reliability test adopts hardware comprising a sensor, a collector, a data service center and a DVD disc;
the collector comprises a collecting card, a storage module and a compression algorithm module;
the data service center comprises a storage module and a decompression algorithm module;
the method comprises the following steps:
the method comprises the following steps: the acquisition card transmits the original voltage value data in the sensor to the cache of the acquisition card, and the voltage value data is compressed into data packets in groups through the compression algorithm module and stored in the storage module of the acquisition device;
step two: recording the data compression packet into a DVD disc;
step three: copying the data compression packet in the DVD optical disk to a storage module of a data service center;
step four: and the decompression algorithm module of the data service center decodes the source data and stores the source data into a database.
Further, the compression algorithm module adopts two-stage compression; the first stage of compression is to pack the group of original data, and for each original data, the ratio of the modulus of the original data to the maximum modulus in the group of data is used for recording, and the number of occupied bits is equal to the resolution of the collector; and directly removing the sign bit of the data; the second stage of compression is to compress the data packet after the first stage of compression by a general character compression method.
Furthermore, the decompression module analyzes and restores the data packed by the compression algorithm, decompresses the data according to a general compression algorithm in the compression algorithm to restore the data into a first-stage compressed data packet, resolves a maximum value, sensitivity, a first value symbol and a data amount in the group of data, extracts all recorded ratio values according to the data amount and the sensitivity, restores the modulus of the original data by using the ratio values and the maximum value, and finally sequentially solves the symbols of all the data according to the first value symbol and the symbol alternating property of the symbols of all the data to finish all the data analysis.
Has the advantages that:
1. the invention realizes the lossless data compression according to the sensitivity of the collector, the compression ratio of the compression algorithm is related to the sensitivity of the collection card, and the determined compression ratio has determined sensitivity and is unrelated to the data, so the compression ratio is stable.
2. The invention carries out specific data decompression aiming at the characteristic of continuous alternation of vibration data, the compression algorithm specially carries out calculation aiming at the vibration data, and the core idea of the compression algorithm is essentially different from that of the general algorithm, so the compression of the general compression algorithm can be carried out after the compression of the algorithm is finished, thereby obtaining higher compression ratio.
3. The compression module of the present invention is comprised of two stages of compression. The first stage of compression is to pack the group of original data; for each original data, recording by using the ratio of the modulus of the original data to the maximum modulus in the data, wherein the number of occupied bits is equal to the resolution of the collector; because the original data always has the character of alternating sign, the sign bit of the original data is directly removed, thus, one bit can be reduced for each original data, and the sign can be restored according to the alternating relation in the decompression algorithm in the future. The second stage of compression is to compress the data packet after the first stage of compression by a general character compression method, such as a huffman coding compression method; although the compression is targeted to floating point type values, it can still be viewed in memory as a form of characters, so a greater compression ratio can be achieved using the common character compression method.
Drawings
FIG. 1 is a graph of device vibration data;
FIG. 2 is a schematic diagram of the hardware components of the present invention;
fig. 3 is a data structure diagram of a compression algorithm.
Detailed Description
The invention is described in detail below by way of example with reference to the accompanying drawings.
The invention provides a method for reducing the occupancy rate of a vibration data storage space in a reliability test, which aims at the vibration data shown in figure 1, wherein figure 1 is a function image of the component of acceleration in the x direction with respect to time; the image is clear, and the relation between the component of the vibration acceleration in any direction and the time has the characteristic of positive and negative alternation in the vibration test.
As shown in fig. 2, the hardware used in the method of the present invention includes a sensor, a collector, a data service center and a DVD disc; the acquisition device comprises an acquisition card, a storage module and a compression algorithm module; the data service center comprises a storage module and a decompression algorithm module. The collector is arranged on the upper side of the graph, and the collector is used for collecting voltage data and converting the voltage data into an acceleration value through a collecting card; the processor of the collector compresses the acceleration data through a compression algorithm and then stores the compressed acceleration data into a storage area; as time goes by, the storage area has data accumulated and data needs to be transferred, and in this case, a DVD is used as a transfer medium for data security. The lower side of the figure is a data service center, and after the service center receives the data copied by the DVD, the data is immediately stored in a storage area to be used; the compressed data is decompressed and restored by a processor of the data service center whenever data query, data analysis and other operations on the data are required.
The compression algorithm module has the function of compressing and packaging a given group of data, and adopts two-stage compression, wherein the first-stage compression is to package the group of original data; for each original data, recording by using the ratio of the modulus of the original data to the maximum modulus in the data, wherein the number of occupied bits is equal to the resolution of the collector; because the original data always has the sign alternation characteristic, the sign bit of the original data is directly removed, thus, one bit can be reduced for each original data, and the sign can be restored according to the alternation relation in the decompression algorithm in the future. The second stage of compression is to compress the data packet after the first stage of compression by a general character compression method, such as a huffman coding compression method.
The data structure used in the first-stage compression of the compression algorithm is shown in fig. 3. Head is the identification code of the compressed packet, and is suggested to be 0x0A 0x55, or another unique value; the Sensitivity represents the Sensitivity, and takes values of 0x01 and 0x02, and corresponds to the sensitivities of 16bit and 32 bit; first Sign indicates the Sign of the First value in a given set of data, and takes values of 0x00 and 0x01, corresponding to the signs '+', '-', respectively; abs Max represents the maximum of the modulus in a given set of data; the total amount of data represents the amount of data for a given set of data; data0, Data1 … … represent the storage of a given set of Data.
The compression algorithm module is realized by the steps of:
the first step is as follows: writing header information (0x0A 0x55) for identifying the start position of the data packet;
the second step is that: writing sensitivity, wherein the sensitivity is written according to the sensitivity of an acquisition card, generally 16bit or 32bit, wherein, the 16bit is represented by 0x01, the 32bit is represented by 0x02, and the number of bits of the sensitivity bit is represented by s in the following;
the third step: writing a first value symbol, and directly writing a first number of sign bits of the source data; 0x00 represents '+', 0x01 represents '-';
the fourth step: writing a maximum value of the absolute value; the maximum value calculated by traversing the absolute value of the source data is written in 8-byte Double type, hereinafter | A max Represents;
the fifth step: writing data quantity; traversing source data, and counting the number N of the source data to be written;
and a sixth step: writing data; taking a first number D of source data 0 Calculating n 0 ＝|D 0 |/|A| max *2 s A value of (d); then n is added 0 Value of (2) is written into Data 0 In this way, n is obtained 1 ＝|D 1 |/|A| max *2 s Then write Data 1 (ii) a And so on, writing all the data;
the seventh step: and taking the packed data as input, and compressing the data by using huffman coding according to characters to generate a final compressed packet.
The function of the decompression algorithm module is to analyze and restore the data packed by the compression algorithm. Decompressing according to the general compression algorithm in the compression algorithm module to restore into the first-stage compressed data packet, and then solving some necessary information: and finally, sequentially solving the symbols of all the data according to the first symbols and the symbol alternating property, and thus, completing the analysis of all the data.
Assuming the variable is terminated, the incoming packet is re-assumed to be DM src (ii) a Firstly, decompressing according to huffman coding to obtain a data packet DM after primary compression in a compression algorithm module; assuming that the first number after analysis is D0, and the second number is D1, … … Dn; the left derivative of each number after analysis is Dleft i And the right derivative value is Dright i Where i is 0, 1, 2, … …, n.
The decompression algorithm module is realized by the following steps:
the first step is as follows: firstly, two bytes are taken, whether the two bytes are 0x0A 0x55 or not is judged, if the two bytes are judged to pass through, the DM is a data packet of the algorithm, and can be analyzed, otherwise, the DM is not the data packet of the algorithm and is not analyzed.
The second step is that: then, one byte is taken and analyzed into a short type of 8 bits, and the short type is set as sensi, so that the length of each piece of data is s-sensi 16;
the third step: then, taking one byte again, resolving into a short type of 8 bits, setting the short type as sn, determining a first sign according to the value of sn, wherein the sign is 1 when sn is 0x00, and the sign is-1 when sn is 0x 01;
the fourth step: then, eight bytes are taken again, and the byte is analyzed into 64-bit double type which is set as | A max ；
The fifth step: then, taking eight bytes, analyzing the eight bytes into a 64-bit long type, and setting the type as N;
and a sixth step: then s bits are taken and analyzed in an unsigned integer way (but not limited to 32bit bits) to be set as ds 0; according toThe compression algorithm estimates that D0 sign | A max *ds0/2 s ；
The seventh step: then, s bits are taken again, and are still analyzed according to an unsigned integer mode, and the result is set as ds 1; solving | D1| ═ A | in accordance with compression algorithm max *ds1/2 s Then solving the symbol; and calculating and solving all the values in the future in sequence.
Wherein, the process of solving the symbol again comprises the following steps:
step a), obtaining the left derivative Dleft at the point 1 D1-D0, right derivative Dright 1 ＝|D2|-|D1|；
Step b), when Dleft 1 <0 and Dright 1 >When the sign is 0, the signs from D1 to D2 are changed, and sign change operation is carried out on sign, namely sign-sign; in other cases, sign is unchanged;
in step c), D1 is obtained as sign | D1 |.
In actual objects and engineering structures, the mass and the elasticity of the system are continuously distributed, the system has 3 degrees of freedom, and the system can be generally simplified into a multi-degree-of-freedom vibration system in engineering test analysis. The differential equation for free vibration for an undamped system with 6 degrees of freedom can be derived from newton's second law to have the following form:
wherein: m is the mass matrix of the system, K is the stiffness matrix, x is the displacement vector,
is the acceleration vector; according to the theory of differential equations, its general solution satisfies the form:
it can be seen from the general solution that the displacement vector is a superposition of a plurality of sinusoidal functions. x (t) is a continuously derivable function and its second derivative has the same form as x (t). The acceleration-time function of the vibration is continuously derivable in form, i.e. the signal source of the vibration sensor is a continuously derivable function with respect to time. According to the nature of the continuous function: the function has the left derivative equal to the reciprocal for each point.
When the compression algorithm is finished, the function x (t) is processed by the compression algorithm module to become | x (t) |, but the function | x (t) | is not a continuous function, and a discontinuous point is a position with alternating symbols; considering that the actual values are all discrete values, the left derivative and the right derivative of each point on the function in x (t) are not exactly equal, and their difference depends on the density of the samples; however, in the case that the sampling frequency is high enough, the left derivative of | x (t) | <0 indicates that the value on the left side of the point is decreasing, while the right derivative of | x (t) | at the point > -0 indicates that the right side is unchanged or increased, and the point is necessarily discontinuous, that is, the point is the point where the sign of the original function x (t) changes.
In summary, the above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (4)
1. A method for reducing the occupancy rate of a vibration data storage space in a reliability test is characterized in that hardware adopted by the method comprises a sensor, a collector, a data service center and a DVD optical disk;
the collector comprises a collecting card, a storage module and a compression algorithm module;
the data service center comprises a storage module and a decompression algorithm module;
the method comprises the following steps:
the method comprises the following steps: the acquisition card transmits the original voltage value data in the sensor to the cache of the acquisition card, and the voltage value data is compressed into data packets in groups through the compression algorithm module and stored in the storage module of the acquisition device;
step two: recording the data compression packet into a DVD disc;
step three: copying the data compression packet in the DVD optical disk to a storage module of a data service center;
step four: the decompression algorithm module of the data service center decodes the source data and stores the source data into a database;
the compression algorithm module adopts two-stage compression; the first stage of compression is to pack the group of original data, and for each original data, the ratio of the modulus of the original data to the maximum modulus in the group of data is used for recording, and the number of occupied bits is equal to the resolution of a collector; and directly removing the sign bit of the data; the second stage of compression is to compress the data packet after the first stage of compression by a general character compression method.
2. The method for reducing the occupancy rate of vibration data storage space in reliability test as claimed in claim 1, wherein said compression algorithm module implementing steps comprises:
the first step is as follows: writing in header information: 0x0A 0x55 for identifying the start of a packet;
the second step is that: writing sensitivity, wherein the sensitivity is 16bit or 32bit according to the sensitivity of the acquisition card, 16bit is represented by 0x01, 32bit is represented by 0x02, and the number of bits of the sensitivity bit is represented by s;
the third step: writing a first value symbol, and directly writing a first number of sign bits of the source data; 0x00 represents '+', 0x01 represents '-';
the fourth step: writing a maximum value of the absolute value; calculating the maximum value by traversing the absolute value of the source data, writing in 8-byte Double type, using | A max Represents;
the fifth step: writing data quantity; traversing source data, and counting the number N of the source data to be written;
and a sixth step: writing data; taking a first number D of source data 0 Calculating n 0 ＝|D 0 |/|A| max *2 s A value of (d); then n is added 0 Value of (2) is written into Data 0 In this way, n is obtained 1 ＝|D 1 |/|A| max *2 s Then write Data 1 (ii) a And so on, writing all the data;
the seventh step: and taking the packed data as input, and compressing the data by using huffman coding according to characters to generate a final compressed packet.
3. The method for reducing the occupancy rate of the storage space of the vibration data in the reliability test as claimed in claim 2, wherein the decompression algorithm module analyzes and restores the data packed by the compression algorithm, decompresses the data according to the general compression algorithm in the compression algorithm to restore the data into the data packet compressed at the first stage, resolves the maximum value, the sensitivity, the first value symbol and the data amount in the group of data, then takes out all the recorded ratio values according to the data amount and the sensitivity, then restores the modulus of the original data by using the ratio values and the maximum value, and finally finds out the symbols of all the data in sequence according to the first value symbol and the symbol alternation property to complete all the data analysis.
4. The method for reducing the occupancy rate of vibration data storage space in reliability test as claimed in claim 3, wherein said decompression algorithm module implements steps comprising:
the first step is as follows: firstly, two bytes are taken, whether the two bytes are 0x0A 0x55 or not is judged, if the two bytes pass the judgment, the DM is a data packet of the algorithm and can be analyzed, otherwise, the DM is not the data packet of the algorithm and is not analyzed;
the second step is that: then, one byte is taken and analyzed into a short type of 8 bits, and the short type is set as sensi, so that the length of each piece of data is s-sensi 16;
the third step: then, taking one byte again, analyzing the byte into a short type with 8 bits, setting the byte as sn, determining a first sign according to the value of sn, wherein the sign is 1 when sn is 0x00, and the sign is-1 when sn is 0x 01;
the fourth step: then, eight bytes are taken again, and the byte is analyzed into 64-bit double type which is set as | A max ；
The fifth step: then, taking eight bytes, analyzing the eight bytes into a 64-bit long type, and setting the type as N;
and a sixth step: then, s bits are taken and analyzed in an unsigned integer mode, and the bits are set as ds 0; d is obtained by calculation according to the compression algorithm 0 ＝sign*|A| max *ds0/2 s ；
The seventh step: then, s bits are taken again, and are still analyzed according to an unsigned integer mode, and the result is set as ds 1; solving | D1| ═ A | in accordance with compression algorithm max *ds1/2 s Then, the sign is calculated, and all the values in the future are calculated and solved in sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011153862.XA CN112525450B (en) | 2020-10-26 | 2020-10-26 | Method for reducing occupancy rate of vibration data storage space in reliability test |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011153862.XA CN112525450B (en) | 2020-10-26 | 2020-10-26 | Method for reducing occupancy rate of vibration data storage space in reliability test |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112525450A CN112525450A (en) | 2021-03-19 |
| CN112525450B true CN112525450B (en) | 2022-09-20 |
Family
ID=74980372
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011153862.XA Active CN112525450B (en) | 2020-10-26 | 2020-10-26 | Method for reducing occupancy rate of vibration data storage space in reliability test |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112525450B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101178424A (en) * | 2007-12-12 | 2008-05-14 | 北京四方继保自动化股份有限公司 | Dynamic data compression storage method in electric network wide-area measuring systems (WAMS) |
| CN102176739A (en) * | 2003-06-10 | 2011-09-07 | 卓然公司 | Method for processing image data and corresponding camera, device and system |
| CN102752798A (en) * | 2012-07-23 | 2012-10-24 | 重庆大学 | Method for losslessly compressing data of wireless sensor network |
| CN109447048A (en) * | 2018-12-25 | 2019-03-08 | 苏州闪驰数控系统集成有限公司 | A kind of artificial intelligence early warning system |
| CN109581502A (en) * | 2018-10-26 | 2019-04-05 | 中国石油天然气集团有限公司 | Seismic exploration data compression method, device and compression storage organization |
| CN209085657U (en) * | 2017-08-02 | 2019-07-09 | 强力物联网投资组合2016有限公司 | For data gathering system related or industrial environment with chemical production technology |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8838551B2 (en) * | 2011-10-21 | 2014-09-16 | International Business Machines Corporation | Multi-level database compression |
| CN105094709A (en) * | 2015-08-27 | 2015-11-25 | 浪潮电子信息产业股份有限公司 | Dynamic data compression method for solid-state disc storage system |
| CN107423397B (en) * | 2017-07-26 | 2020-05-19 | 北京时代民芯科技有限公司 | Adaptive compression storage and decompression extraction method for multitask micro-system |
-
2020
- 2020-10-26 CN CN202011153862.XA patent/CN112525450B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102176739A (en) * | 2003-06-10 | 2011-09-07 | 卓然公司 | Method for processing image data and corresponding camera, device and system |
| CN101178424A (en) * | 2007-12-12 | 2008-05-14 | 北京四方继保自动化股份有限公司 | Dynamic data compression storage method in electric network wide-area measuring systems (WAMS) |
| CN102752798A (en) * | 2012-07-23 | 2012-10-24 | 重庆大学 | Method for losslessly compressing data of wireless sensor network |
| CN209085657U (en) * | 2017-08-02 | 2019-07-09 | 强力物联网投资组合2016有限公司 | For data gathering system related or industrial environment with chemical production technology |
| CN109581502A (en) * | 2018-10-26 | 2019-04-05 | 中国石油天然气集团有限公司 | Seismic exploration data compression method, device and compression storage organization |
| CN109447048A (en) * | 2018-12-25 | 2019-03-08 | 苏州闪驰数控系统集成有限公司 | A kind of artificial intelligence early warning system |
Non-Patent Citations (1)
| Title |
|---|
| 图书馆数据库建设中数据压缩技术的应用;扎依达·木沙;《新疆职业大学学报》;20121231;第20卷(第06期);第78-80页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112525450A (en) | 2021-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3217781B2 (en) | Data compression using multiple levels | |
| JP2022031735A (en) | Method, device, and system for hybrid data compression and decompression | |
| CN102893265B (en) | Management can independent access data cell storage | |
| US6542640B1 (en) | Data compressing apparatus, reconstructing apparatus, and its method | |
| CN112953550B (en) | Data compression method, electronic device and storage medium | |
| JP2009539169A5 (en) | ||
| US20050131939A1 (en) | Method and apparatus for data redundancy elimination at the block level | |
| CN106549673B (en) | Data compression method and device | |
| CN102197599A (en) | Method and apparatus for compressing and decompressing data records | |
| CN113094346A (en) | Big data coding and decoding method and device based on time sequence | |
| US6225922B1 (en) | System and method for compressing data using adaptive field encoding | |
| US20200294629A1 (en) | Gene sequencing data compression method and decompression method, system and computer-readable medium | |
| US6396420B1 (en) | Delta compression of floating point coordinate data | |
| US6600432B2 (en) | Variable length encoding and decoding of ascending numerical sequences | |
| US20220335013A1 (en) | Generating readable, compressed event trace logs from raw event trace logs | |
| CN112525450B (en) | Method for reducing occupancy rate of vibration data storage space in reliability test | |
| CN113078908B (en) | Simple encoding and decoding method suitable for time sequence database | |
| CN113034339A (en) | Method for improving vibration data transmission bandwidth based on GPU acceleration | |
| CN112533164B (en) | Method for improving transmission bandwidth of vibration data in reliability test | |
| Li et al. | Elf: Erasing-based lossless floating-point compression | |
| CN101741743B (en) | Network address sort-based bidirectional stream combining method | |
| Joseph et al. | A Novel Approach of Modified Run Length Encoding Scheme for High Speed Data Communication Application | |
| Blom et al. | Compressed and distributed file formats for labeled transition systems | |
| CN112948639A (en) | Unified storage management method and system for data of highway middling station | |
| US8688655B2 (en) | Network analysis |
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 | ||
| GR01 | Patent grant |