Differential processing method and device for OTA upgrade, electronic equipment and readable storage medium

Abstract

The invention provides a differential processing method and device for OTA upgrading, electronic equipment and a readable storage medium, and the method comprises the steps: dividing a new-version file and an old-version file of a to-be-upgraded ECU into a plurality of first data blocks and a plurality of second data blocks, which are the same in number, and determining the difference information between the corresponding first data blocks and second data blocks; the method comprises the following steps: firstly, determining a target compression algorithm based on data characteristics between data blocks according to Shannon entropy, and finally, compressing difference information between different data blocks through the corresponding target compression algorithm to generate a differential packet, so that the compression ratio is improved, the transmission data volume is greatly reduced, and the bandwidth and storage resources are saved.

Description

Technical Field

[0001] The present invention belongs to the technical field of vehicle OTA upgrading, and particularly relates to a differential processing method, device, electronic device and readable storage medium for OTA upgrading. Background Technique

[0002] OTA differential upgrade technology is a product of the development of intelligent connected vehicles. It realizes the remote update of vehicle software wirelessly to adapt to the increasing complexity and update requirements of the automotive software system. This technology effectively reduces the data transmission volume and download time by only transmitting the changed parts in the software update instead of the entire software package, and improves the upgrade efficiency. At the same time, differential upgrade ensures the security of the software version because it only updates the changed parts and ensures that the updated content is consistent with the target version through specific restoration tools.

[0003] OTA differential upgrade technology intelligently compares the differences between the new and old software versions, compresses the differential data, generates a differential package containing only the differential parts, and sends it to the vehicle end to implement the software update of the target parts.

[0004] In the prior art, a fixed compression algorithm is often used to compress the differential data. In this way, it is impossible to select a suitable compression algorithm according to the characteristics of the differential data, resulting in a low compression ratio and even a volume after compression that is larger than the original data. Summary of the Invention

[0005] Based on this, in view of the above technical problems, a differential processing method, device, electronic device and readable storage medium for OTA upgrading are provided.

[0006] The technical solution adopted by the present invention is as follows:

[0007] As a first aspect of the present invention, a differential processing method for OTA upgrading is provided, which is characterized by including:

[0008] S101. Divide the new version file and the old version file of the ECU to be upgraded into a plurality of first data blocks and a plurality of second data blocks with the same quantity respectively;

[0009] S102. Identify whether there is data difference between each first data block and the corresponding second data block. If so, find the differential data pair, record the position of the differential data, form differential information, and execute the next step;

[0010] S103. Calculate the Shannon entropy of the first data block with data differences and the corresponding second data block respectively. If the Shannon entropies of the two are equal, then use the DPCM algorithm as the target compression algorithm. If the Shannon entropies of the two are less than or equal to a preset threshold, then use the Huffman coding algorithm as the target compression algorithm. If the Shannon entropies of the two are greater than the preset threshold, then use the arithmetic coding algorithm as the target compression algorithm, where the value range of the threshold is 0.45 - 0.55;

[0011] S104. Use the target compression algorithm to compress all the difference information respectively;

[0012] S105. Generate a difference packet according to the compressed difference information packet.

[0013] As the second aspect of the present invention, there is provided a differential processing device for OTA upgrade, characterized in that it includes:

[0014] The first module is used for S101. Divide the new version file and the old version file of the ECU to be upgraded into multiple first data blocks and multiple second data blocks with the same quantity respectively;

[0015] The second module is used for S102. Identify whether there are data differences between each first data block and the corresponding second data block. If so, find the difference data pair, record the position of the difference data, form the difference information, and execute the next step;

[0016] The third module is used for S103. Calculate the Shannon entropy of the first data block with data differences and the corresponding second data block respectively. If the Shannon entropies of the two are equal, then use the DPCM algorithm as the target compression algorithm. If the Shannon entropies of the two are less than or equal to a preset threshold, then use the Huffman coding algorithm as the target compression algorithm. If the Shannon entropies of the two are greater than the preset threshold, then use the arithmetic coding algorithm as the target compression algorithm, where the value range of the threshold is 0.45 - 0.55;

[0017] The fourth module is used for S104. Use the target compression algorithm to compress all the difference information respectively;

[0018] The fifth module is used for S105. Generate a difference packet according to the compressed difference information packet.

[0019] As the third aspect of the present invention, there is provided an electronic device, including a storage module, where the storage module includes instructions loaded and executed by a processor, and when the instructions are executed, the processor executes the differential processing method for OTA upgrade in the first aspect above.

[0020] As a fourth aspect of the present invention, there is provided a computer-readable storage medium storing one or more programs which, when executed by a processor, implement the differential processing method for OTA upgrade in the first aspect above.

[0021] The present invention first divides the new version file and the old version file of the ECU to be upgraded into a plurality of first data blocks and a plurality of second data blocks with the same quantity, and determines the difference information between the corresponding first data blocks and second data blocks. Then, based on Shannon entropy, a target compression algorithm is determined according to the data characteristics between the data blocks. Finally, the difference information between different data blocks is respectively compressed by the corresponding target compression algorithm to generate a differential package, improving the compression rate, thus greatly reducing the amount of transmitted data and saving bandwidth and storage resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The present invention will be described in detail below in conjunction with the drawings and specific embodiments:

[0023] Figure 1 It is a flowchart of a differential processing method for OTA upgrade provided by an embodiment of the present invention;

[0024] Figure 2 It is a schematic diagram of a differential processing device for OTA upgrade provided by an embodiment of the present invention;

[0025] Figure 3 It is a schematic diagram of an electronic device provided by an embodiment of the present invention;

[0026] Figure 4 It is a schematic diagram of the application environment of an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0027] The embodiments of the present invention will be described below in conjunction with the accompanying drawings of the specification. It should be noted that the embodiments involved in this specification are not exhaustive and do not represent the only embodiments of the present invention. The following corresponding embodiments are only for clearly explaining the inventive content of the present invention and do not limit its embodiments. For those of ordinary skill in the art, various changes and modifications can be made on the basis of the description of this embodiment. Any obvious changes or modifications that belong to the technical concept and inventive content of the present invention are also within the protection scope of the present invention.

[0028] Figure 4The figure shows the environment to which the embodiments of the present application are applied, including an OTA server 110 and multiple OTA vehicle terminals 120. The two are connected through a mobile communication network (such as 2G / 3G / 4G or Wifi, etc.). During the OTA differential upgrade process, the OTA server 110 generates a differential package and sends it to the OTA vehicle terminal 120. The OTA vehicle terminal 120 performs differential upgrade on the corresponding ECU according to the received differential package.

[0029] As Figure 1 shown, the embodiments of the present application provide a differential processing method for OTA upgrade, which is applied to the OTA server 110, and its specific process is as follows:

[0030] S101. Divide the new version file and the old version file of the ECU to be upgraded into multiple first data blocks and multiple second data blocks with the same quantity respectively.

[0031] Herein, the new version file and the old version file refer to the new version firmware and the old version firmware of the ECU, both of which are IMG image files.

[0032] The sizes of the first data block and the second data block are determined according to the following rules:

[0033] The memory size for differential processing = the size of the data block * 10 * the number of processes, and the number of processes is at least 1.

[0034] By setting an appropriate number of processes, multiple data blocks can be processed in parallel, thereby accelerating the speed of differential processing.

[0035] After division, corresponding first data blocks and second data blocks can be formed.

[0036] The memory complexity of differential processing is approximately max(9A, 5A + 3B) + O(1), where A and B represent the sizes of the first data block and the second data block respectively, and the two are basically the same. O represents the remaining fixed memory overhead, which may be auxiliary variables required during the operation of the algorithm, buffer areas of constant size, etc. Therefore, in the case of 1 process, the memory complexity of differential processing is approximately 10 times that of the data block.

[0037] S102. Identify whether there is a data difference between each first data block and the corresponding second data block. If so, find the pair of difference data and record the position of the difference data. The pair of difference data and the corresponding position constitute difference information, and then execute the next step.

[0038] Assume that there is a difference at the eighth byte between the 1st first data block and the corresponding 1st second data block. Then, take the data at the eighth byte of both as a pair of difference data and record the eighth byte as the position. Among them, the difference data and the position of the two data blocks constitute a piece of difference information.

[0039] To improve efficiency, the specific process of S102 is as follows:

[0040] S21. Calculate the hash values of each first data block and each second data block respectively.

[0041] S22. Determine whether the hash values of each first data block and the corresponding second data block are different. If so, it means there is a data difference between the corresponding first data block and the corresponding second data block. Then, further find the difference data pairs between the corresponding first data block and the corresponding second data block by byte-by-byte matching.

[0042] S103. Calculate the Shannon entropy of the first data block with data difference and the corresponding second data block respectively. If the Shannon entropies of the two are equal, it means the data of the two has a high degree of continuity and correlation. Then, take the DPCM algorithm as the target compression algorithm. If the Shannon entropy of the two is less than or equal to the preset threshold, it means that some characters or patterns in the data of the two appear very frequently. Then, take the Huffman coding algorithm as the target compression algorithm. If the Shannon entropy of the two is greater than the preset threshold, it means that there are many complex patterns and uncertainties in the data of the two, the data distribution is relatively dispersed, and there are no obvious high-frequency characters or patterns. Then, take the arithmetic coding algorithm as the target compression algorithm.

[0043] Among them, the value range of the threshold is 0.45 - 0.55. In this embodiment, the threshold is selected as 0.5.

[0044] The DPCM algorithm is based on the principles of prediction and differential coding. It reduces the spatial redundancy of data by encoding the differences between adjacent samples, thereby achieving data compression. It utilizes the correlation between data and can effectively remove spatial redundancy information. Therefore, when the data between two data blocks has a high degree of continuity and correlation, the DPCM algorithm can play a good role and achieve a good compression effect. In addition, the LZW algorithm can also be used.

[0045] Huffman coding is a coding method based on the character occurrence frequency. It represents characters with higher frequencies with shorter codes and characters with lower frequencies with longer codes, so that the overall average coding length can be the shortest, thereby achieving efficient data compression. Therefore, when some characters or patterns in the data between two data blocks appear very frequently and there are obvious frequency distribution differences in the data, Huffman coding can make good use of this characteristic to efficiently compress high-frequency characters.

[0046] Arithmetic coding is an entropy coding algorithm that directly encodes the entire input data. It can better handle complex patterns and distributions in the data, mapping the entire data sequence into a real number interval for encoding, thus to a certain extent avoiding the limitation of having to be segmented into symbols for encoding like Huffman coding. Therefore, when there are no obvious high-frequency characters or patterns between two data blocks, the arithmetic coding algorithm can more effectively compress the data and improve the compression efficiency.

[0047] S104. Use the target compression algorithm to compress all the difference information respectively.

[0048] S105. Generate a difference packet according to the compressed difference information packets.

[0049] In this embodiment, all the difference information packets are packed into a tar packet as the difference packet.

[0050] As can be seen from the above, a differential processing method for OTA upgrade provided by an embodiment of the present application first divides the new version file and the old version file of the ECU to be upgraded into a plurality of first data blocks and a plurality of second data blocks with the same quantity, and determines the difference information between the corresponding first data block and the second data block. Then, based on the data characteristics between the data blocks, the target compression algorithm is determined according to Shannon entropy. Finally, the difference information between different data blocks is compressed respectively by the corresponding target compression algorithm to generate a difference packet, improving the compression ratio, thereby greatly reducing the amount of transmitted data and saving bandwidth and storage resources.

[0051] The differential processing device for OTA upgrade of one or more embodiments of the present invention will be described in detail below. Those skilled in the art can understand that these devices can all be configured by using commercially available hardware components according to the steps taught by this solution. Figure 2 FIG. shows a differential processing device for OTA upgrade provided by an embodiment of the present invention, as Figure 2 shown, the device includes a first module 11, a second module 12, a third module 13, a fourth module 14, and a fifth module 15.

[0052] The first module 11 is used for S101. Respectively divide the new version file and the old version file of the ECU to be upgraded into a plurality of first data blocks and a plurality of second data blocks with the same quantity.

[0053] Among them, the new version file and the old version file refer to the new version firmware and the old version firmware of the ECU, both of which are IMG image files.

[0054] The sizes of the first data block and the second data block are determined according to the following rules:

[0055] Memory size for differential processing = size of data block * 10 * number of processes, where the number of processes is at least 1.

[0056] By setting an appropriate number of processes, multiple data blocks can be processed in parallel, thus accelerating the speed of differential processing.

[0057] After partitioning, corresponding first data blocks and second data blocks can be formed.

[0058] The memory complexity of differential processing is approximately max(9A, 5A + 3B) + O(1), where A and B represent the sizes of the first data block and the second data block respectively, and they are basically the same. O represents the remaining fixed memory overheads, which may be auxiliary variables required during algorithm operation, buffer areas of constant size, etc. Therefore, in the case of 1 process, the memory complexity of differential processing is approximately 10 times that of the data block.

[0059] The second module 12 is used in S102 to identify whether there is a data difference between each first data block and the corresponding second data block. If so, find the pair of difference data and record the position of the difference data. The pair of difference data and the corresponding position constitute difference information, and then proceed to the next step.

[0060] Assume that there is a difference in the eighth byte between the 1st first data block and the corresponding 1st second data block. Then, take the data at the eighth byte of both as the pair of difference data and record the eighth byte as the position. Among them, the difference data and position of the two data blocks constitute a piece of difference information.

[0061] To improve efficiency, the specific process of S102 is as follows:

[0062] S21: Calculate the hash values of each first data block and the second data block respectively.

[0063] S22: Determine whether the hash values of each first data block and the corresponding second data block are different. If so, it means there is a data difference between the corresponding first data block and the second data block, and then further find the pair of difference data between the corresponding first data block and the second data block by byte-by-byte matching.

[0064] The third module 13 is used for S103, calculating the Shannon entropy of the first data block with data differences and the corresponding second data block respectively. If the Shannon entropies of the two are equal, it means that the data of the two has a high degree of continuity and correlation, then the DPCM algorithm is used as the target compression algorithm. If the Shannon entropy of the two is less than or equal to the preset threshold, it means that some characters or patterns in the data of the two appear very frequently, then the Huffman coding algorithm is used as the target compression algorithm. If the Shannon entropy of the two is greater than the preset threshold, it means that there are many complex patterns and uncertainties in the data of the two, the distribution of the data is relatively scattered, and there are no obvious high-frequency characters or patterns, then the arithmetic coding algorithm is used as the target compression algorithm.

[0065] Among them, the value range of the threshold is 0.45 - 0.55. In this embodiment, the threshold is selected as 0.5.

[0066] The DPCM algorithm is based on the principles of prediction and differential coding. By encoding the differences between adjacent samples, it reduces the spatial redundancy of the data, thereby achieving data compression. It utilizes the correlation between data and can effectively remove spatial redundancy information. Therefore, when the data between two data blocks has a high degree of continuity and correlation, the DPCM algorithm can play a good role and achieve a good compression effect. In addition, the LZW algorithm can also be used.

[0067] Huffman coding is a coding method based on the character occurrence frequency. It represents the characters with higher frequencies with shorter codes, while representing the characters with lower frequencies with longer codes, so that the overall average coding length is the shortest, thereby achieving efficient data compression. Therefore, when some characters or patterns in the data between two data blocks appear very frequently and there are obvious frequency distribution differences in the data, Huffman coding can make good use of this characteristic to efficiently compress high-frequency characters.

[0068] Arithmetic coding is an entropy coding algorithm that directly encodes the entire input data. It can better handle the complex patterns and distributions in the data, maps the entire data sequence to a real number interval for encoding, thereby avoiding to a certain extent the limitation of having to be segmented into symbols and then encoded like Huffman coding. Therefore, when there are no obvious high-frequency characters or patterns in the data between two data blocks, the arithmetic coding algorithm can more effectively compress the data and improve the compression efficiency.

[0069] The fourth module 14 is used for S104, compressing all the difference information respectively by using the target compression algorithm.

[0070] The fifth module 15 is used for S105, generating a difference packet according to the compressed difference information packet.

[0071] In this embodiment, all differential information packets are packaged into a tar package as a differential package.

[0072] In summary, the differential processing device for OTA upgrade provided in the above embodiment can execute the differential processing method for OTA upgrade provided in each of the foregoing embodiments.

[0073] With the same concept as above, the Figure 2 structure of the differential processing device for OTA upgrade shown above can be implemented as an electronic device. Figure 3 FIG. shows a schematic block diagram of the structure of an electronic device provided in an embodiment of the present invention.

[0074] As Figure 3 shown, the electronic device may include a storage module 21 and a processor 22.

[0075] The storage module 21 includes instructions loaded and executed by the processor 22, and when the instructions are executed, the processor 22 executes the steps according to various exemplary embodiments of the present invention described in the part of the differential processing method for OTA upgrade in the present specification.

[0076] It should be understood that the processor 22 may be a central processing unit (CPU), and the processor 22 may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0077] An embodiment of the present invention also provides a computer-readable storage medium, and the computer-readable storage medium stores one or more programs, and when the one or more programs are executed by a processor, the steps according to various exemplary embodiments of the present invention described in the part of the differential processing method for OTA upgrade in the present specification are implemented.

[0078] Those of ordinary skill in the art can understand that all or some of the steps in the methods disclosed above, and the functional modules / units in systems and devices, can be implemented as software, firmware, hardware, and their appropriate combinations. In the hardware implementation, the division between the functional modules / units mentioned above does not necessarily correspond to the division of physical components; for example, one physical component can have multiple functions, or one function or step can be executed by several physical components in cooperation. Some or all physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or can be implemented as hardware, or can be implemented as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable storage medium, which can include a computer-readable storage medium (or non-transitory medium) and a communication medium (or transitory medium).

[0079] As is well known to those of ordinary skill in the art, the term computer-readable storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information, such as computer-readable instructions, data structures, program modules, or other data. The computer-readable storage medium includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cassette, tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those of ordinary skill in the art that a communication medium typically contains computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and can include any information delivery medium.

[0080] Exemplarily, the computer-readable storage medium can be an internal storage module of the electronic device in the foregoing embodiments, such as the hard disk or memory of the electronic device. The computer-readable storage medium can also be an external storage device of the electronic device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, etc., equipped on the electronic device.

[0081] The electronic device and computer-readable storage medium provided in each of the foregoing embodiments first divide the new version file and the old version file of the ECU to be upgraded into a plurality of first data blocks and a plurality of second data blocks with the same quantity, and determine the difference information between the corresponding first data blocks and second data blocks. Then, based on the Shannon entropy, a target compression algorithm is determined according to the data characteristics between the data blocks. Finally, the difference information between different data blocks is compressed by the corresponding target compression algorithm respectively to generate a differential package, which improves the compression rate, thereby greatly reducing the amount of transmitted data and saving bandwidth and storage resources.

[0082] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalent technologies, the present application is also intended to include these changes and modifications.

Claims

1. A differential processing method for OTA upgrade, characterized in that, Including: S101: Divide the new version file and the old version file of the ECU to be upgraded into multiple first data blocks and multiple second data blocks with the same quantity respectively; S102: Identify whether there is a data difference between each first data block and the corresponding second data block. If so, find the difference data pair, record the position of the difference data, form difference information, and execute the next step; S103: Calculate the Shannon entropy of the first data block with data difference and the corresponding second data block respectively. If the Shannon entropies of the two are equal, use the DPCM algorithm as the target compression algorithm. If the Shannon entropies of the two are less than or equal to the preset threshold, use the Huffman coding algorithm as the target compression algorithm. If the Shannon entropies of the two are greater than the preset threshold, use the arithmetic coding algorithm as the target compression algorithm, where the value range of the threshold is 0.45 - 0.55; S104: Compress all the difference information respectively using the target compression algorithm; S105: Generate a difference packet according to the compressed difference information packet.

2. The differential processing method for OTA upgrade according to claim 1, wherein The S101 further includes: The size of the data block satisfies: the memory size for differential processing = the size of the data block * 10 * the number of processes, and the number of processes is at least 1.

3. The differential processing method for OTA upgrade according to claim 1, characterized in that, The S102 further includes: Calculate the hash value of each first data block and the second data block respectively; Judge whether the hash values of each first data block and the corresponding second data block are different. If so, it means there is a data difference between the corresponding first data block and the corresponding second data block, and find the difference data pair between the corresponding first data block and the corresponding second data block by byte-by-byte matching.

4. A differential processing method for OTA upgrade according to claim 1, characterized in that The threshold is 0.

5.

5. A differential processing device for OTA upgrade, characterized in that Including: The first module is used for S101: Divide the new version file and the old version file of the ECU to be upgraded into multiple first data blocks and multiple second data blocks with the same quantity respectively; The second module is used for S102: Identify whether there is a data difference between each first data block and the corresponding second data block. If so, find the difference data pair, record the position of the difference data, form difference information, and execute the next step; The third module is used for S103: Calculate the Shannon entropy of the first data block with data difference and the corresponding second data block respectively. If the Shannon entropies of the two are equal, use the DPCM algorithm as the target compression algorithm. If the Shannon entropies of the two are less than or equal to the preset threshold, use the Huffman coding algorithm as the target compression algorithm. If the Shannon entropies of the two are greater than the preset threshold, use the arithmetic coding algorithm as the target compression algorithm, where the value range of the threshold is 0.45 - 0.55; The fourth module is used for S104: Compress all the difference information respectively using the target compression algorithm; The fifth module is used for S105: Generate a difference packet according to the compressed difference information packet.

6. The differential processing device for OTA upgrade according to claim 5, wherein The S101 further includes: The size of the data block satisfies: the memory size for differential processing = the size of the data block * 10 * the number of processes, and the number of processes is at least 1.

7. The differential processing device for OTA upgrade according to claim 5, characterized in that, The S102 further includes: Calculate the hash value of each first data block and the second data block respectively; Determine whether the hash values of each first data block and the corresponding second data block are different. If so, it means that there is a data difference between the corresponding first data block and the corresponding second data block, and then find the difference data pairs between the corresponding first data block and the corresponding second data block by byte-by-byte matching.

8. An OTA upgrade differential processing device according to claim 5, characterized in that The threshold value is 0.

5.

9. An electronic device, characterized in that, It includes a storage module, and the storage module includes instructions loaded and executed by a processor. When the instructions are executed, they cause the processor to execute a differential processing method for OTA upgrade according to any one of claims 1-4.

10. A computer-readable storage medium storing one or more programs, characterized in that, When the one or more programs are executed by a processor, they implement a differential processing method for OTA upgrade according to any one of claims 1-4.

Images