WO2020006753A1

WO2020006753A1 - Data compression method and apparatus

Info

Publication number: WO2020006753A1
Application number: PCT/CN2018/094835
Authority: WO
Inventors: 余常文; 宋小福
Original assignee: 深圳市汇顶科技股份有限公司
Priority date: 2018-07-06
Filing date: 2018-07-06
Publication date: 2020-01-09
Also published as: CN109074669A

Abstract

Provided by the present invention are a data compression method and apparatus. The method comprises: receiving a data frame that is uploaded by a sensor within a preset period, the data frame comprising at least one line of data; performing bit-by-bit compression or segmentation compression on each line of data in the data frame to obtain compressed data; and sending the compressed data to an external terminal. Thus, the lossless compression of a small amount of data is achieved, and the length of the data after compression is obviously reduced, thus effectively reducing the transmission time of the compressed data.

Description

Data compression method and device

Technical field

The present application relates to the field of data processing technologies, and in particular, to a data compression method and device.

Background technique

With the rapid development of information technology, the amount of data continues to increase, and the demand for data storage efficiency continues to increase. In order to save storage costs, as much data as possible is stored in a limited storage space, and the data is usually compressed. Store to reduce the space occupied by the data.

At present, common compression algorithms include: Run Length Encoding (RLE), Huffman Coding, LZW Compression (Lempel Ziv Welch, LZW). Run-length coding is suitable for situations where there are many repeated bits in the bit stream. For data with a large number of short run-lengths, space can only be saved if the run-length is greater than the length required for binary representation data. The Huffman compression algorithm uses a binary description to replace each character. Its length is determined by the frequency of characters. The higher the frequency of characters, the shorter the encoding length. However, the Huffman compression algorithm requires character description tables and Huffman trees for decoding. When the amount of data is small and the data repetition rate is low, the algorithm performs poorly. The LZW compression algorithm can effectively use the frequency of character frequency redundancy to compress, and adaptively generate a dictionary based on the content of the compressed data, but usually cannot effectively use the position redundancy.

In summary, the existing compression algorithms described above are relatively complicated and are not suitable for lossless compression of data with a small amount of data.

Summary of the invention

The invention provides a data compression method and device, so as to realize the lossless compression processing of data with a small amount of data. After compression, the data length is significantly reduced, and the transmission time of compressed data is effectively shortened.

In a first aspect, the present invention provides a data compression method, including:

Receiving a data frame uploaded by a sensor within a preset period, wherein the data frame includes at least one line of data;

Performing the same-bit compression processing or segment compression processing on each row of data of the data frame to obtain compressed data;

Sending the compressed data to an external terminal.

Optionally, performing the same bit compression processing or the segment compression processing on each row of data of the data frame includes:

Using the first line of data in the data frame as a reference line, and performing same-bit compression processing or segment compression processing on the reference line;

When the data frame includes 2 or more lines of data;

Starting from the second line of data, a previous line of data is used as a reference line of an adjacent subsequent data line to perform a difference operation to obtain a difference data line, and the difference data line is subjected to the same-bit compression processing or segment compression processing.

Optionally, performing the same-bit compression processing on the reference line includes:

Hypothetical reference line comprises n data, are referred to as _{_{_{a 0, a 1, a 2}}} , ..., a n, a ₀ as the basic data, data a _i a _i-1 by subtracting the reference value replacement in a row _i to get the reference line after the difference operation, where i = 1,2,3 ..., n;

Determining the maximum value in the data other than the basic data in the reference row after the difference operation, and setting the number of compressed bits according to the maximum value;

According to the compression bit number, the same-bit compression processing is performed on the data in the reference line other than the basic data to obtain the compressed data corresponding to the reference line.

Optionally, performing segment compression processing on the reference line includes:

Divide the reference line after difference calculation into two or more sections according to the size of data other than the basic data in the reference line after difference calculation;

Set the number of compressed bits of data in each segment separately; compress the data in the segment according to the corresponding number of compressed bits to obtain the compressed data corresponding to the reference row; of which the compressed bits of two adjacent segments The number is different.

Optionally, starting from the second row of data, the previous row of data is used as the reference row of the adjacent next row of data to perform the difference operation to obtain the difference data row, including:

Assume that the current line of data is the j + 1th line of data, and the j + 1th line of data includes n data, which are recorded as: a _{j + 1,0} , a _{j + 1,1} , a _{j + 1,2} , …, A _{j + 1, n} ; the previous row of data of the current row of data is the j-th row of data, and the j-th row of data includes n data, which are recorded as: a _{j, 0} , a _{j, 1} , a _{j, 2} , ..., a _{j, n} ; where j = 1, 2, 3 ..., N-1; N is the total number of rows of the data frame;

Subtract the corresponding value in the jth row of data from the value in the _{j + 1th} row of data to obtain a difference data row, where the difference data row is recorded as: a _{j + 1,0} -a _{j, 0} , a _{j +1,1} -a _{j, 1} , a _{j + 1,2} -a _{j, 2} , ..., a _{j + 1, n} -a _{j, n} .

Optionally, performing the same-bit compression processing on the difference data line includes:

Determining a maximum value in the data of the difference data line, and setting the number of compressed bits according to the maximum value;

Performing the same-bit compression processing on the difference data line according to the number of compressed bits, to obtain compressed data corresponding to the difference data line.

Optionally, performing segment compression processing on the difference data line includes:

Dividing the difference data line into two or more sections according to a preset rule;

Set the number of compressed bits of data in each section separately; compress the data in the section according to the corresponding number of compressed bits to obtain the compressed data corresponding to the difference data line; where two adjacent sections are compressed The number of compressed bits is different.

In a second aspect, the present invention provides a data compression device, including:

A receiving module, configured to receive a data frame uploaded by a sensor within a preset period, wherein the data frame includes at least one line of data;

A compression module, configured to perform same-bit compression processing or segment compression processing on each row of data in the data frame to obtain compressed data;

A sending module, configured to send the compressed data to an external terminal.

Optionally, the compression module is specifically configured to:

When the data frame includes 2 or more lines of data;

In a third aspect, the present invention provides a data compression device, including:

Memory for storing programs;

A processor, configured to execute the program stored in the memory, and when the program is executed, the processor is configured to execute the method according to any one of the first aspects.

In a fourth aspect, the present invention provides a computer-readable storage medium storing instructions that, when run on a computer, cause the computer to execute the method of any of the first aspects.

The data compression method and device provided by the present invention receive a data frame uploaded by a sensor within a preset period, wherein the data frame includes at least one line of data; each line of data in the data frame is subjected to the same bit compression processing or Segment compression processing to obtain compressed data; and send the compressed data to an external terminal. As a result, lossless compression processing of data with a small amount of data is realized, and the length of the compressed data is significantly reduced, which effectively shortens the transmission time of the compressed data.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly explain the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings in the following description These are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without paying creative labor.

FIG. 1 is a schematic structural diagram of an electronic device according to an embodiment of the present invention;

2 is a method flowchart of a data compression method provided by Embodiment 1 of the present invention;

3 is a flowchart of a method of step S102 in Embodiment 1 of the present invention;

FIG. 4 is a schematic structural diagram of compressing a reference line by using the same-bit compression processing method; FIG.

FIG. 5 is a structural schematic diagram of compressing a reference row by using a segmented compression processing method; FIG.

6 is a schematic structural diagram of compressing a difference data line by using a segmented compression processing method;

FIG. 7 is a schematic structural diagram of a data compression device according to a second embodiment of the present invention; FIG.

FIG. 8 is a schematic structural diagram of a data compression device according to a third embodiment of the present invention.

Through the above drawings, a clear embodiment of the present disclosure has been shown, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the concept of the present disclosure in any way, but rather to explain the concepts of the present disclosure to those skilled in the art by referring to specific embodiments.

detailed description

In order to make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part, but not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

The terms "first", "second", "third", "fourth", and the like (if present) in the description and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects without using Used to describe a specific order or sequence. It should be understood that the data used in this way are interchangeable under appropriate circumstances so that the embodiments of the invention described herein can be implemented in an order other than those illustrated or described herein, for example. Furthermore, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or device that contains a series of steps or units need not be limited to those explicitly listed Those steps or units may instead include other steps or units not explicitly listed or inherent to these processes, methods, products or equipment.

The technical solutions of the present invention will be described in detail in the following specific examples. The following specific embodiments may be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments.

In the following, some terms in this application are explained so as to facilitate understanding by those skilled in the art.

1) Sensor (sensor) refers to a device or device that senses various measured quantities and converts them into useful signals according to certain rules. Common sensors are: photoelectric sensors, piezoelectric sensors, piezoresistive sensors, electromagnetic sensors, pyroelectric sensors, optical fiber sensors, and so on.

2) A fingerprint sensor (also known as a fingerprint sensor) is a sensing device, which belongs to the optical fingerprint sensor and a semiconductor fingerprint sensor, and is a key device for automatic fingerprint collection.

3) Microcontroller Unit (MCU), also known as Single Chip Microcomputer or Single Chip Microcomputer, is to reduce the frequency and specifications of the Central Processing Unit (CPU) appropriately and reduce the memory ( memory), counter (Timer), universal serial bus (USB), analog to digital conversion (A / D), universal asynchronous transceiver (Universal Receiver / Transmitter), programmable logic Peripheral interfaces such as controller (Programmable Logic Controller, PLC), and even the driving circuit of Liquid Crystal Display (LCD) are integrated on a single chip to form a chip-level computer for different combinations of control for different applications.

When the amount of data collected by the sensor increases, the amount of data that needs to be transmitted to the processor (host) will increase accordingly. At this time, if the data collected by the sensor is not compressed, it will cause a delay in data transmission and affect the entire system. Work efficiency. Because the processing capacity of the MCU on the sensor side is limited, and the existing compression algorithm is more complicated, it is not suitable for lossless compression processing of data with a small amount of data in the MCU.

The data compression method provided by the present invention aims to solve the problems existing in the prior art.

The following specifically describes the technical solutions of the present invention and how the technical solutions of the present application solve the above technical problems with specific embodiments. The following specific embodiments may be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present invention will be described below with reference to the drawings.

The data compression method and system provided in the embodiments of the present application can be applied to electronic devices with sensors, such as smart phones, tablet computers, notebook computers, and other mobile terminals or electronic devices. Specifically, the above-mentioned sensors may include a fingerprint sensor. The sensor may be a traditional capacitive fingerprint sensor provided on the front or back of the electronic device, or an under-screen fingerprint sensor such as an optical fingerprint sensor or an ultrasonic fingerprint sensor, which is provided below the display screen of the electronic device, which is not specifically limited in this application. . Of course, the data compression method and system provided in this application can also be applied to other data compression. The compression of data collected by the fingerprint sensor is only a specific embodiment and should not be considered as a limitation of the application scenario of this application.

FIG. 1 is a schematic structural diagram of an electronic device according to an embodiment of the present invention. As shown in FIG. 1, the electronic device may use an optical fingerprint sensor for user fingerprint collection and verification, and the optical fingerprint sensor may be disposed below a display screen. A partial area or an entire area, thereby forming an under-display optical fingerprint recognition system. The electronic device can apply the data compression method provided by the embodiment of the present invention. Specifically, the electronic device 100 includes a display screen 120 and an optical fingerprint sensor 130, wherein the optical fingerprint sensor 130 is disposed in a part below the display screen 120. region. The optical fingerprint sensor 130 includes a sensing array having a plurality of optical sensing units, and an area where the sensing array is located is a fingerprint detection area 103 of the optical fingerprint sensor 130.

The optical fingerprint sensor 130 may be attached to the lower surface of the display screen 120 or fixed under the display screen 120 by other means. As a preferred embodiment, the optical fingerprint sensor 130 may be fixed under the display screen 120 through a mounting bracket, such as being mounted to a middle frame of the electronic device 100, and fixed to the display through the middle frame. Under the screen 120 so as to have a certain gap with the display screen 120, that is, it does not contact the lower surface of the display screen 120, so it is beneficial to be able to separate when the display screen 120 or the optical fingerprint sensor 130 is damaged Replace or repair damaged parts.

However, it should be understood that, in other alternative implementations, the fingerprint detection area may also be extended to other positions of the display area 102 or even the entire display screen 120 through optical design, and is not limited to the location where the optical fingerprint sensor 130 is located. position. Alternatively, the optical fingerprint sensor 130 may be disposed in an edge region of the electronic device 100, that is, the optical fingerprint sensor 130 is not located or is only partially located within the display area 102, but the optical path design makes the optical fingerprint sensor 130 The fingerprint detection area 103 of the fingerprint sensor 130 still covers at least a part of the display area 102 of the display screen 120.

In the electronic device 100 shown in FIG. 1, the fingerprint detection area 103 is located in the display area 102 of the display screen 120. Therefore, when the user needs to unlock the electronic device or perform other fingerprint verification, the user only Fingers need to be pressed on the fingerprint detection area 103 located on the display screen 120 to implement fingerprint input. Since fingerprint detection and fingerprint recognition can be implemented in the screen, the terminal device 100 adopting the above structure does not need a special reserved space on the front side to set fingerprint keys (such as the Home key), so that a full-screen solution can be adopted, that is, the display screen 120 The display area 102 can be substantially extended to the front of the entire electronic device 100.

As a preferred embodiment, the display screen 120 may be a display screen with a self-luminous display unit, such as an organic light emitting diode (OLED) display or a micro-light emitting diode (Micro-LED) display. Taking an OLED display as an example, the optical fingerprint sensor 130 may use a display unit (ie, an OLED light source) of the display 120 located in the fingerprint detection area 103 as an excitation light source for optical fingerprint detection; however, it should be understood that The optical fingerprint sensor 130 may also be provided with an additional excitation light source (such as an infrared light source) for fingerprint detection and identification. In addition, the sensing array of the optical fingerprint sensor 130 is specifically a photo detector (PD) array, which includes a plurality of photo detectors distributed in an array. The photo detectors can be used as the optical sensors described above. unit. When a finger is pressed on the fingerprint detection area 103, the light emitted from the display unit of the fingerprint detection area 103 reflects and forms reflected light on the fingerprint of the finger surface, wherein the reflected light of the ridge and valley of the finger fingerprint is different The reflected light is received from the display screen 120 and received by the light detector array and converted into a corresponding electrical signal, that is, a fingerprint detection signal. Based on the fingerprint detection signal, a fingerprint image of a user's finger can be obtained for fingerprint matching verification, thereby implementing an optical fingerprint recognition function in the electronic device 100.

It should be understood that, in specific implementation, the electronic device 100 further includes a transparent protective cover 110, which may be a glass cover or a sapphire cover, which is located above the display screen 120 and covers all The front of the terminal device 100 is described. Since the cover plate 110 covers the surface of the display screen 120, in the embodiment of the present application, the so-called finger pressing on the display screen 120 may actually refer to the cover plate 110 pressed above the display screen 120. Or, when a user attaches a protective layer on the surface of the cover 110, the so-called finger pressing on the display screen 120 may actually mean pressing the protective layer on the surface of the cover 110.

As an optional implementation manner, as shown in FIG. 1, the optical fingerprint sensor 130 includes a light detection portion 134 and an optical component 132, wherein the light detection portion 134 may include the sensing array and the sensor array. The readout circuit and other auxiliary circuits electrically connected to the array can be fabricated on a chip by a semiconductor process. The optical component 132 may be disposed above the sensing array of the light detection portion 134, and may specifically include a light guide member, a filter layer, and other optical elements. The light guiding component is mainly used for guiding the reflected light reflected from the finger surface to the sensing array for optical detection. For example, it may use a lens to focus the reflected light on the sensing of the light detecting part 134. An array or a collimator is used to limit each optical sensing unit of the sensing array to receive only the reflected light from the finger part above it. The filter layer may be used to filter out ambient light penetrating a finger to prevent the light detection portion 134 from being interfered by strong external light. For example, the filter layer may be an infrared filter layer to filter out sunlight. Or other wavelengths of the ambient light penetrating the finger and entering the light detection portion 134. In addition, a circuit board 150, such as a flexible circuit board, may be provided below the optical fingerprint sensor 130. The optical fingerprint sensor 130 may be electrically connected to other functional modules of the electronic device 100 through the circuit board 150 And signal transmission.

In other alternative implementations, the display screen 120 may also be a non-self-illuminating display screen, such as a backlit liquid crystal display screen; in this case, the optical fingerprint sensor 130 cannot use the display screen 120 The display unit is used as an excitation light source. Therefore, an excitation light source can be integrated inside the optical fingerprint sensor 130 or an excitation light source can be set outside to implement optical fingerprint detection. The detection principle is consistent with the above description.

After the optical fingerprint sensor 130 obtains a fingerprint image, it needs to transmit the fingerprint image to a processing unit of the electronic device 100, such as a central processing unit (CPU) or an application processor (AP) for fingerprint matching verification. Therefore, it is generally necessary to compress the fingerprint image obtained by the optical fingerprint sensor 130 in the fingerprint module through a microprocessor (MCU), and then provide the data to the processing unit of the electronic device 100 for fingerprint matching identification and perform the matching based on the matching identification result Corresponding application operations, such as device unlocking, mobile payment, system settings, or application installation / removal.

FIG. 2 is a method flowchart of a data compression method provided in Embodiment 1 of the present invention. As shown in FIG. 2, the method in this embodiment may include:

S101. Receive a data frame uploaded by a sensor within a preset period, where the data frame includes at least one line of data.

In practical applications, the execution subject of this embodiment may be a micro control unit MCU, a single-chip microcomputer, a micro processor, and other devices having data processing capabilities. In this embodiment, an MCU is used as an example for detailed description, but the specific device type for executing the method in this embodiment is not limited.

In this embodiment, the MCU may be integrated with the sensor into a module, or may be an independent module electrically connected to the sensor. First, the MCU receives the data frames uploaded by the sensor in a preset period (usually a collection period) (can be one frame or multiple frames, and the data processing method of multiple frames is similar to that of one frame); Include at least 1 row of data. It should be noted that the data format of the default data frame in this embodiment is stored on a row basis, and the amount of data contained in each row of data is not limited.

S102. Perform same-bit compression processing or segment compression processing on each row of data in the data frame to obtain compressed data.

In this embodiment, the same-bit compression processing refers to setting the number of compressed bits of each data in each line of data to be the same, and performing compression processing on each line of data according to the number of compressed bits. Segmented compression processing refers to dividing line data into two or more sections; setting the compression bit number of data in each section separately; compressing the data in the section according to the corresponding compression bit number , And the compression bit number of two adjacent sections is different.

FIG. 3 is a flowchart of a method of step S102 in Embodiment 1 of the present invention. As shown in FIG. 3, in an optional embodiment, step S102 may include:

S1021. Using the first line of data in the data frame as a reference line, perform the same-bit compression process or the segment compression process on the reference line.

In this embodiment, it is assumed that the reference line includes n data, which are denoted as a ₀ , a ₁ , a ₂ , ..., an _n , a _{0 is} used as the basic data, and the value of a _i minus a _i-1 is used to replace the reference. The data a _i in the rows, to obtain the reference row after the difference operation, where i = 1, 2, 3 ..., n. Then determine the maximum value of the data other than the basic data in the reference row after the difference operation, and set the number of compressed bits according to the maximum value; Perform the same bit compression processing to obtain the compressed data corresponding to the reference line.

Specifically, FIG. 4 is a schematic structural diagram of compressing a reference line by using the same bit compression processing method. As shown in FIG. 4, the reference line includes n data, which are denoted as a ₀ , a ₁ , a ₂ , ..., an _n , and are reserved. The basic data a _{0 is} unchanged. Replace the data a _i in the reference line with the value of a _i minus a _i-1 , where i = 1, 2, 3 ..., n; get the reference line after the difference operation, and record them separately. Are a ₀ , a ₂ -a ₁ , a ₃ -a ₂ , ..., an _n -a _n-1 . Set the number of compressed bits to m, that is, m bits are used to compress the data in the reference row after the difference operation, except the basic data. As shown in FIG. 4, (a ₂ -a ₁ ) _{m_bit} represents a value obtained by compressing m bits of data a ₂ -a ₁ , and other values are sequentially _deduced by analogy, and the explanation is not repeated. In this embodiment, the basic data a _{0 is} not compressed. Assuming that the actual number of bits of the basic data a ₀ is 12, it is stored in 2 Bytes. The data compression information compressed by the same bit compression processing method is stored in the head (data header). Head _m indicates that the data is compressed by m bits. The head _m contains the minimum data value, the number of compressed bits, and the overall data length information. . The value of m is determined based on the largest data in the reference row after the difference calculation.

In this embodiment, it is assumed that the reference line includes n data, which are denoted as a ₀ , a ₁ , a ₂ , ..., an _n , a _{0 is} used as the basic data, and the value of a _i minus a _i-1 is used to replace the reference. The data a _i in the rows, to obtain the reference row after the difference operation, where i = 1, 2, 3 ..., n. Then, according to the size of the data other than the basic data in the reference row after the difference operation, the reference row after the difference operation is divided into two or more sections according to a preset rule; each section is set separately. The number of compressed bits of the data; the data in the section is compressed according to the corresponding number of compressed bits to obtain the compressed data corresponding to the reference row; wherein the compressed bits of two adjacent sections are different.

Specifically, FIG. 5 is a structural schematic diagram of compressing a reference line by using a segmented compression processing method. As shown in FIG. 5, the reference line includes n data, which are respectively denoted as a ₀ , a ₁ , a ₂ , ..., an _n , and are retained. the same basic data a _0, a _i by subtracting a _i-1 data to the replacement reference value of a _i in the row, calculating a difference obtained after the reference line, denoted as _{_{_{a 0, a 2 -a 1,}}} a 3 -a ₂ , ..., an _n -a _n-1 . According to the size of data other than the basic data in the reference row after the difference operation, the reference row after the difference operation is divided into two or more sections according to a preset rule. Referring to FIG. 5, the first sector uses m bits to compress data, and the second sector uses P bits to compress data. The values of P and m are not equal. As shown in FIG. 5, (a _{x + 1-a} _x ) _{p_bit} represents a value obtained by compressing P bits of data a _{x + 1} -a _x , and other values are _deduced by analogy, and the explanation is not repeated.

Optionally, the reference line after the difference calculation is divided into two or more sections according to a preset rule, and the number of bytes after compression needs to be reduced as much as possible. Assume that the number of compression bits set in the same-bit compression processing method is 7, and in the segmented compression processing method, the number of compression bits in the first section is 7 and the number of compression bits in the second section is 3, where the first There are 4 data in the second section (the corresponding section length is 4), then the number of bits that can be saved by using the segment compression processing method is 4 * (7-3) = 16, and the corresponding number of saved bytes is 2 (savings The number of bits divided by 8 and rounded).

Specifically, when setting the segmentation to divide the reference line after the difference calculation according to a preset rule into sections, refer to the following reference formula: the number of bytes saved> the length of the data header + the length of the section after compression, To set the number of sections and the number of compressed bits for each section.

In this embodiment, the basic data a _{0 is} not compressed. Assuming that the actual number of bits of the basic data a ₀ is 12, it is stored in 2 Bytes. The data compression information compressed by the same bit compression processing method is stored in the head (data header). Head _m indicates that the data is compressed by m bits. The head _m contains the minimum data value, the number of compressed bits, and the overall data length information. . Head _p indicates that P bits are used to compress the data. Head _p contains the minimum value of the data, the number of compressed bits, and the overall length of the data.

S1022 When the data frame includes 2 or more rows of data; starting from the second row of data, the previous row of data is used as a reference row of the adjacent next row of data to perform a difference operation to obtain a row of difference data, and the difference data is The lines are subjected to the same bit compression processing or the segment compression processing.

In this embodiment, it is assumed that the current row of data is the j + 1th row of data, and the j + 1th row of data includes n data, which are respectively recorded as: a _{j + 1,0} , a _{j + 1} , ₁ , and a _{j +1,2} , ..., a _{j + 1, n} ; the data in the previous row of the current row of data is the j-th row of data, and the j-th row of data includes n data, which are recorded as: a _{j, 0} , a _{j, 1} , a _{j, 2} , ..., a _{j, n} ; where j = 1 _{, 2} , 3 ..., N-1; N is the total number of rows of the data frame. Then subtract the corresponding value in the jth row of data from the value in the _{j + 1th} row of data to obtain a difference data row, where the difference data row is recorded as: a _{j + 1,0} -a _{j, 0} , a _{j + 1,1} -a _{j, 1} , a _{j + 1,2} -a _{j, 2} , ..., a _{j + 1, n} -a _{j, n} .

In an implementation manner, a maximum value in the data of the difference data line is first determined, and the number of compressed bits is set according to the maximum value; then, the difference data line is processed according to the number of compressed bits. Same bit compression processing to obtain compressed data corresponding to the difference data line.

In another embodiment, the difference data line is divided into two or more sections according to a preset rule; the number of compressed bits of data in each section is set separately; according to the corresponding compressed bit The number of bits compresses the data in the segment to obtain the compressed data corresponding to the difference data line; wherein the number of compressed bits of two adjacent segments is different.

Specifically, FIG. 6 is a schematic structural diagram of compressing a difference data line by using a segmented compression processing method. As shown in FIG. 6, head _{u_bit} represents a data header of a sector with a compression bit number of u, and head _{v_bit} represents a compression bit number Is the data header of the section of v, d _{1_u_bit} represents the first difference data in the current collection line data is compressed by u bits, and so on, and d _{x_u_bit} represents the x-th difference data in the current collection line data. u bit compressed value. d _{x + 1_v_bit} represents the value of the _{x + 1th} difference data in the current collection line data after v bit compression, and so on, d _{y_v_bit} represents the _yth difference data in the previous collection line data after v bit compression Value. The head _{u_bit is} adjacent to the section corresponding to the head _{v_bit} , so u and v have different values. Compress the data of each section in turn, and combine the compressed values of all the difference data of the current row data into byte / int / word and other data.

S103. Send the compressed data to an external terminal.

In this embodiment, the MCU can send the compressed data to the external terminal in real time (that is, the compressed data is sent directly to the external terminal), or it can be sent to the external terminal at one time after all the data frames are compressed. The external terminal may be a computer device, a portable device (such as a mobile phone, a tablet computer, a smart watch, etc.) having a data processing function.

In this embodiment, a data frame uploaded by a sensor within a preset period is received, where the data frame includes at least one line of data; each line of data in the data frame is subjected to the same-bit compression processing or segment compression processing to obtain Compressing data; sending the compressed data to an external terminal. As a result, lossless compression processing of data with a small amount of data is realized, and the length of the compressed data is significantly reduced, which effectively shortens the transmission time of the compressed data.

FIG. 7 is a schematic structural diagram of a data compression apparatus according to Embodiment 2 of the present invention. As shown in FIG. 7, the apparatus in this embodiment may include:

The receiving module 10 is configured to receive a data frame uploaded by a sensor within a preset period, where the data frame includes at least one line of data;

A compression module 20, configured to perform same-bit compression processing or segment compression processing on each row of data in the data frame to obtain compressed data;

The sending module 30 is configured to send the compressed data to an external terminal.

Optionally, the compression module 30 is specifically configured to:

When the data frame includes 2 or more lines of data;

The data compression apparatus in this embodiment may execute the method shown in FIG. 2. For specific implementation processes and technical principles, refer to related descriptions in the method shown in FIG. 2, and details are not described herein again.

FIG. 8 is a schematic structural diagram of a data compression device provided in Embodiment 3 of the present invention. As shown in FIG. 8, the data compression device 40 in this embodiment includes:

The processor 41 and the memory 42;

The memory 42 is configured to store executable instructions, and the memory may also be a flash (flash memory).

The processor 41 is configured to execute executable instructions stored in a memory to implement each step in the method according to the foregoing embodiment. For details, refer to related descriptions in the foregoing method embodiments.

Optionally, the memory 42 may be independent or integrated with the processor 41.

When the memory 42 is a device independent of the processor 41, the data compression device 40 may further include:

The bus 43 is configured to connect the memory 42 and the processor 41.

In addition, an embodiment of the present application further provides a computer-readable storage medium. The computer-readable storage medium stores computer execution instructions. When at least one processor of the user equipment executes the computer execution instructions, the user equipment executes the foregoing various possibilities. Methods.

The computer-readable medium includes a computer storage medium and a communication medium, and the communication medium includes any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be an integral part of the processor. The processor and the storage medium may reside in an application-specific integrated circuit (ASIC). In addition, the application specific integrated circuit may be located in a user equipment. Of course, the processor and the storage medium may also exist as discrete components in a communication device.

A person of ordinary skill in the art may understand that all or part of the steps of implementing the foregoing method embodiments may be implemented by a program instructing related hardware. The aforementioned program may be stored in a computer-readable storage medium. When the program is executed, the steps including the foregoing method embodiments are executed; and the foregoing storage medium includes: a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, which can store program code. medium.

Those skilled in the art will readily contemplate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present invention is intended to cover any variation, use, or adaptive change of the present disclosure. These variations, uses, or adaptive changes follow the general principles of the present disclosure and include common general knowledge or conventional technical means in the technical field not disclosed by the present disclosure. . It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It should be understood that the present disclosure is not limited to the precise structure that has been described above and illustrated in the drawings, and various modifications and changes can be made without departing from the scope thereof. The scope of the disclosure is limited only by the following claims.

Claims

A data compression method, comprising:

Receiving a data frame uploaded by a sensor within a preset period, wherein the data frame includes at least one line of data;

Performing the same-bit compression processing or segment compression processing on each row of data of the data frame to obtain compressed data;

Sending the compressed data to an external terminal.
The method according to claim 1, wherein performing the same bit compression processing or the segment compression processing on each row of data of the data frame comprises:

Using the first line of data in the data frame as a reference line, and performing same-bit compression processing or segment compression processing on the reference line;

When the data frame includes 2 or more rows of data; starting from the second row of data, the previous row of data is used as the reference row of the next subsequent row of data to perform a difference operation to obtain a difference data row, and the difference data row Perform the same-bit compression process or the segment compression process.
The method according to claim 2, wherein performing the same-bit compression processing on the reference line comprises:

Hypothetical reference line comprises n data, are referred to as a 0, a 1, a 2 , ..., a n, a 0 as the basic data, data a i a i-1 by subtracting the reference value replacement in a row i to get the reference line after the difference operation, where i = 1,2,3 ..., n;

Determining the maximum value in the data other than the basic data in the reference row after the difference operation, and setting the number of compressed bits according to the maximum value;

According to the compression bit number, the same-bit compression processing is performed on the data in the reference line other than the basic data to obtain the compressed data corresponding to the reference line.
The method according to claim 2, wherein performing segment compression processing on the reference line comprises:

Hypothetical reference line comprises n data, are referred to as a 0, a 1, a 2 , ..., a n, a 0 as the basic data, data a i a i-1 by subtracting the reference value replacement in a row i to get the reference line after the difference operation, where i = 1,2,3 ..., n;

Divide the reference line after difference calculation into two or more sections according to the size of data other than the basic data in the reference line after difference calculation;

Set the number of compressed bits of data in each segment separately; compress the data in the segment according to the corresponding number of compressed bits to obtain the compressed data corresponding to the reference row; of which the compressed bits of two adjacent segments The number is different.
The method according to claim 2, characterized in that starting from the second line of data, performing a difference operation on the previous line of data as a reference line of an adjacent subsequent data line to obtain the difference data line, comprising:

Assume that the current line of data is the j + 1th line of data, and the j + 1th line of data includes n data, which are recorded as: a j + 1,0 , a j + 1,1 , a j + 1,2 , …, A j + 1, n ; the previous row of data of the current row of data is the j-th row of data, and the j-th row of data includes n data, which are recorded as: a j, 0 , a j, 1 , a j, 2 , ..., a j, n ; where j = 1, 2, 3 ..., N-1; N is the total number of rows of the data frame;

Subtract the corresponding value in the jth row of data from the value in the j + 1th row of data to obtain a difference data row, where the difference data row is recorded as: a j + 1,0 -a j, 0 , a j +1,1 -a j, 1 , a j + 1,2 -a j, 2 , ..., a j + 1, n -a j, n .
The method according to any one of claims 2-5, wherein performing the same-bit compression processing on the difference data line comprises:

Determining a maximum value in the data of the difference data line, and setting the number of compressed bits according to the maximum value;

Performing the same-bit compression processing on the difference data line according to the number of compressed bits, to obtain compressed data corresponding to the difference data line.
The method according to any one of claims 2-5, wherein performing segment compression processing on the difference data line comprises:

Dividing the difference data line into two or more sections according to a preset rule;

Set the number of compressed bits of data in each section separately; compress the data in the section according to the corresponding number of compressed bits to obtain the compressed data corresponding to the difference data line; where two adjacent sections are compressed The number of compressed bits is different.
A data compression device, comprising:

A receiving module, configured to receive a data frame uploaded by a sensor within a preset period, wherein the data frame includes at least one line of data;

A compression module, configured to perform same-bit compression processing or segment compression processing on each row of data in the data frame to obtain compressed data;

A sending module, configured to send the compressed data to an external terminal.
The apparatus according to claim 8, wherein the compression module is specifically configured to:

Using the first line of data in the data frame as a reference line, and performing same-bit compression processing or segment compression processing on the reference line;

When the data frame includes 2 or more rows of data; starting from the second row of data, the previous row of data is used as the reference row of the next subsequent row of data to perform a difference operation to obtain a difference data row, and the difference data row Perform the same-bit compression process or the segment compression process.
The apparatus according to claim 9, wherein performing the same-bit compression processing on the reference line comprises:

Hypothetical reference line comprises n data, are referred to as a 0, a 1, a 2 , ..., a n, a 0 as the basic data, data a i a i-1 by subtracting the reference value replacement in a row i to get the reference line after the difference operation, where i = 1,2,3 ..., n;

Determining the maximum value in the data other than the basic data in the reference row after the difference operation, and setting the number of compressed bits according to the maximum value;

According to the compression bit number, the same-bit compression processing is performed on the data in the reference line other than the basic data to obtain the compressed data corresponding to the reference line.
The apparatus according to claim 9, wherein performing segment compression processing on the reference line comprises:

Hypothetical reference line comprises n data, are referred to as a 0, a 1, a 2 , ..., a n, a 0 as the basic data, data a i a i-1 by subtracting the reference value replacement in a row i to get the reference line after the difference operation, where i = 1,2,3 ..., n;

Divide the reference line after difference calculation into two or more sections according to the size of data other than the basic data in the reference line after difference calculation;

Set the number of compressed bits of data in each segment separately; compress the data in the segment according to the corresponding number of compressed bits to obtain the compressed data corresponding to the reference row; of which the compressed bits of two adjacent segments The number is different.
The device according to claim 9, characterized in that starting from the second line of data, performing a difference operation on the previous line of data as a reference line of an adjacent subsequent data line to obtain a difference data line, comprising:

Assume that the current line of data is the j + 1th line of data, and the j + 1th line of data includes n data, which are recorded as: a j + 1,0 , a j + 1,1 , a j + 1,2 , …, A j + 1, n ; the previous row of data of the current row of data is the j-th row of data, and the j-th row of data includes n data, which are recorded as: a j, 0 , a j, 1 , a j, 2 , ..., a j, n ; where j = 1, 2, 3 ..., N-1; N is the total number of rows of the data frame;

Subtract the corresponding value in the jth row of data from the value in the j + 1th row of data to obtain a difference data row, where the difference data row is recorded as: a j + 1,0 -a j, 0 , a j +1,1 -a j, 1 , a j + 1,2 -a j, 2 , ..., a j + 1, n -a j, n .
The apparatus according to any one of claims 9-12, wherein performing the same-bit compression processing on the difference data line comprises:

Determining a maximum value in the data of the difference data line, and setting the number of compressed bits according to the maximum value;

Performing the same-bit compression processing on the difference data line according to the number of compressed bits, to obtain compressed data corresponding to the difference data line.
The apparatus according to any one of claims 9-12, wherein performing segment compression processing on the difference data line comprises:

Dividing the difference data line into two or more sections according to a preset rule;

Set the number of compressed bits of data in each section separately; compress the data in the section according to the corresponding number of compressed bits to obtain the compressed data corresponding to the difference data line; where two adjacent sections are compressed The number of compressed bits is different.
A data compression device, comprising:

Memory for storing programs;

A processor, configured to execute the program stored in the memory, and when the program is executed, the processor is configured to execute the data compression method according to any one of claims 1-7.
A computer-readable storage medium, characterized in that it stores instructions that, when run on a computer, causes the computer to execute the data compression method according to any one of claims 1-7.