JPWO2016121442A1 - In-vehicle control device, program writing device, program generation device, and program - Google Patents

Abstract

Provided are an in-vehicle control device, a program writing device, a program generation device, and a program that can perform reprogramming at high speed and easily. The ECU 300 includes a microcomputer 301, SRAM 302, FLASH memory 303, and communication device 305. The FLASH memory 303 is composed of a plurality of blocks and stores old programs. The communication device 305 receives the frame including the block data, the type of the block data, and the address of the block in which the block data is written (S250). The microcomputer 301 restores a new program from the block data to the SRAM 302 according to the type of block data (S255, S260) (S260), and writes one piece of the restored new program to the block corresponding to the address (S265, S270).

Description

  The present invention relates to an in-vehicle control device, a program writing device, a program generation device, and a program.

  In conventional reprogramming, a PC (Personal Computer) as a writing tool and an in-vehicle controller (ECU: Engine Control Unit) are connected via a low-speed CAN (Controller Area Network), and the load module (new program) is divided and transferred. While writing to the flash memory of the ECU.

  Even when the updated part of the new program with respect to the old program is small, the entire new program is transferred via CAN and the entire new program is written.

  Therefore, there is a problem that it takes time to write. On the other hand, the concept of differential reprogramming has been conventionally proposed (see, for example, Patent Document 1). That is, paragraph [0020] of Patent Document 1 describes “differential rewriting” as one of the rewriting methods.

JP 2011-081604 A

  In the technique disclosed in Patent Literature 1, generally, the difference between the entire new program and the entire old program is transmitted.

  However, in the microcomputer of the ECU, the size of the FLASH memory for storing the program is large, but the size of the SRAM (Static Random Access Memory) used as the work memory is small. For this reason, it is difficult to store the difference between the entire new program and the entire old program in the SRAM and restore the entire new program.

  An object of the present invention is to provide an in-vehicle control device, a program writing device, a program generation device, and a program that can perform reprogramming at high speed and easily.

  In order to achieve the above object, the basic idea of the present invention is that the FLASH memory built in the microcomputer of the ECU is composed of a plurality of blocks, and the new program and the old program are divided into blocks. Dividing and transferring the difference compressed data obtained by compressing the difference between the new program of the block and the old program of the plurality of blocks to the vehicle control device, and decompressing the differential compression data received on the vehicle control device side, the plurality of blocks of the FLASH memory The new program is restored using the old program and the writing to the corresponding block of the FLASH memory is repeated for each block. As a result, since the difference is further compressed, the entire new program can be restored by restoring the block unit even with a small SRAM. Of course, if there is room in the SRAM size, the new program may also generate and restore differentially compressed data in units of a plurality of blocks. Another object of the present invention is to reduce the writing time by using differentially compressed data obtained by compressing a difference, not a simple difference between old and new programs.

  Based on the above basic concept, the present invention is composed of a plurality of blocks, and is divided into a nonvolatile memory (FLASH) for storing old programs, a volatile memory (SRAM), and the size of each block. Differential block data that is generated by compressing a difference between a new program of the block and an old program of a plurality of blocks, or block data that includes compressed data obtained by compressing the new program of the block, the type of the block data, And a communication device that receives a frame including the address of the block of the non-volatile memory (FLASH), and the block program and the new program of the block from the block program and the old program of a plurality of blocks according to the type of the block data (SRAM) or new program of the block from the block data To restore the volatile memory (SRAM), in which a new program of the restored the block was set to and an arithmetic device for writing into the block corresponding to the address.

  According to the present invention, reprogramming can be performed quickly and easily. Problems, configurations, and effects other than those described above will be clarified by the following description of embodiments.

1 is a schematic diagram showing an overall configuration of a system according to an embodiment of the invention. It is a block diagram of PC shown in FIG. It is a block diagram of the vehicle-mounted system shown in FIG. FIG. 4 is a schematic diagram showing an internal configuration of an SRAM of the ECU shown in FIG. 3. FIG. 4 is a schematic diagram showing an internal configuration of a FLASH memory of the ECU shown in FIG. 3. It is a block diagram of difference compression data generation software. It is a block diagram of compressed data generation software. It is a block diagram of differential compression data generation software with a selection function. It is a block diagram of differential compression data generation software with a restriction | limiting function. It is a flowchart of the differential compression data generation software with a selection function which shows the process of PC of FIG. It is a flowchart of the difference compression data generation software with a restriction | limiting function which shows the process of PC of FIG. It is an outline of block selection in a new program with small changes. It is an outline of block selection in a new program in which a large program is added. It is the outline | summary of the several old block selection in the new program with which the big program was added. It is the outline | summary of the several old block selection in the new program from which the big program was deleted. It is a flowchart of block selection. It is a flowchart at the time of the some old block selection in the new program to which the big program was added. It is a flowchart at the time of the some old block selection in the new program from which the big program was deleted. It is a flowchart which shows the process of the server shown in FIG. It is a flowchart which shows the process of the gateway shown in FIG. It is an example of the block diagram of the flame | frame which a gateway produces | generates. It is a block diagram of restoration software. It is the structure of the decompression | restoration software of ECU corresponding to differential compression data generation software with a selection function and differential compression data generation software with a restriction | limiting function. It is a FLASH writing process flowchart of ECU corresponding to differential compression data generation software with a selection function. It is a FLASH writing process flowchart of ECU corresponding to differential compression data generation software with a restriction | limiting function.

  Hereinafter, the configuration and operation of a system including an in-vehicle control device according to an embodiment of the present invention will be described with reference to the drawings.

  First, the overall configuration of the system will be described with reference to FIG. FIG. 1 is a schematic diagram showing the overall configuration of a system according to an embodiment of the present invention.

  This system includes a program generation device 100 and an in-vehicle system 3.

  The program generation device 100 generates data from the new program and the old program stored in the vehicle-mounted control device included in the vehicle-mounted system 3, and transmits the generated data to the vehicle-mounted system 3. Details thereof will be described later with reference to FIGS.

  The program generation device 100 includes a PC 1 and a server 2. The PC 1 is connected to the server 2 via, for example, a LAN (Local Area Network). Note that the PC 1 and the server 2 may be directly connected using a cross cable.

  The program generation device 100 communicates with the in-vehicle system 3 wirelessly. Communication is performed, for example, via the Internet, a mobile phone network, a wireless LAN, or the like. In FIG. 1, relay devices such as routers and access points are not displayed for easy viewing of the drawing.

  The in-vehicle system 3 receives data from the program generation device 100 and updates the program of the in-vehicle control device included in the in-vehicle system 3 based on the received data. Details thereof will be described later with reference to FIGS.

  Next, the configuration of the PC 1 will be described with reference to FIG. FIG. 2 is a configuration diagram of the PC 1 shown in FIG.

  The PC 1 includes an arithmetic device 201 such as a CPU (Central Processing Unit), an input device 202 such as a keyboard and a mouse, a display device 203 such as an LCD (Liquid Crystal Display), a communication device 204 such as a NIC (Network Interface Card), a RAM ( A storage device 205 such as a random access memory (ROM), a read only memory (ROM), or a hard disk drive (HDD) is provided. The arithmetic device 201, the input device 202, the display device 203, and the communication device 204 are connected to a bus.

  The storage device 205 stores the same old program as the program stored in the flash memory of the in-vehicle control device included in the in-vehicle system 3 and a new program obtained by updating the old program.

  The configuration of the server 2 shown in FIG. 1 is the same as that of the PC 1. That is, the server 2 includes an arithmetic device 201S, an input device 202S, a display device 203S, a communication device 204S, and a storage device 205S.

  Next, the configuration of the in-vehicle system 3 will be described with reference to FIG. FIG. 3 is a configuration diagram of the in-vehicle system 3 shown in FIG.

The in-vehicle system 3 includes one gateway 310 (program writing device) and a plurality of ECUs 300 (300 _{1 to} 300 _n ). The gateway 310 and the ECU 300 communicate with each other via the in-vehicle network CAN.

  When the authentication is successful, the gateway 310 relays data between the network outside the vehicle and the CAN inside the vehicle.

  The ECU 300 includes a communication device 305 such as a microcomputer 301, various ICs (Integrated Circuits) 304 corresponding to each ECU 300, and a CAN transceiver. The microcomputer 301 includes an SRAM 302 (volatile memory) and a FLASH memory 303 (nonvolatile memory).

  The configuration of gateway 310 is basically the same as the configuration of ECU 300, but further includes a communication device according to a network protocol outside the vehicle. In other words, the gateway 310 includes a microcomputer 311, various ICs 314, a communication device 315 such as a CAN transceiver, and a communication device 316 according to a network protocol outside the vehicle. The microcomputer 311 includes an SRAM 312 and a FLASH memory 313.

  Next, the configuration of the SRAM 302 of the ECU 300 will be described with reference to FIG. FIG. 4 is a schematic diagram showing an internal configuration of the SRAM 302 shown in FIG.

  The SRAM 302 includes a first area 302a for temporarily storing data and a second area 302b for restoring the data stored in the first area 302a.

  In the present embodiment, as an example, the size of the SRAM 302 is 96 kB, the size of the first region 302a is 16 kB, and the size of the second region 302b is 64 kB.

  Next, the configuration of the FLASH memory 303 will be described with reference to FIG. FIG. 5 is a schematic diagram showing an internal configuration of the FLASH memory 303 shown in FIG.

  The FLASH memory 303 is composed of blocks of a plurality of sizes. In the present embodiment, as an example, the size of the FLASH memory 303 is 2 MB. The FLASH memory 303 is composed of two types of blocks of 8 kB and 64 kB. Here, the block is a minimum unit for erasing data. For example, when 4 kB data is written in an 8 kB block, 4 kB data is written after erasing 8 kB data.

  As shown in FIG. 5, the FLASH memory 303 stores old programs over 8 kB, 8 kB, 64 kB, 64 kB, 64 kB, 64 kB, and 64 kB blocks.

  Further, the FLASH memory 303 is configured so that the data in the first area 302a and the old program already existing in the FLASH memory 303 are stored in the second area of the SRAM 302 according to the type of data temporarily stored in the first area 302a of the SRAM 302. In this area 302b, so-called restoration software that can restore the new program or decompress the compressed data in the first area 302a to restore the new program is stored.

  Next, the outline of the differential compression data generation software will be described with reference to FIG. Note that the computing device 201 of the PC 1 executes the following processing by executing the differential compressed data generation software 600.

  The arithmetic unit 201 (difference compressed data generation software 600) generates the difference data 630 with the old program 610 and the new program 620 as inputs. The difference generation unit 601 generates a difference between the old program and the new program, and the compression unit 602 compresses the difference to generate differential compressed data 630. As described above, the differential compression generation software 600 not only generates a difference but also generates smaller differential compression data by compression.

  Next, an outline of the compressed data generation software will be described with reference to FIG. Note that the computing device 201 of the PC 1 executes the following processing by executing the compressed data generation software 700.

  The arithmetic device 201 (compressed data generation software 700) receives the new program 620 as input and generates compressed data 730. The compression unit 701 has a function of compressing a program. Thus, the compressed data generation software performs an operation of simply compressing the input program and generating compressed data.

  Next, the differential compression data generation software 800 with a selection function, which is one of the present invention, will be described with reference to FIG.

  In general, when the size of the differential compressed data of the old and new programs is compared with the size of the compressed data of the new program, the differential compressed data is smaller. This is because the differentially compressed data can utilize the information of the old program and can be made more compact. However, when the old and new programs are completely different programs, there are too many different parts, and the difference becomes too large and the compressed data may become smaller. Further, if the old program is not stored in the FLASH memory in the ECU 300 (in the case of the first writing), the differentially compressed data cannot be generated.

  Therefore, the configuration and operation of the differential compression data generation software 800 with a selection function invented in FIG. The differential compression data generation software 800 with a selection function has a configuration in which an input determination unit 830 and a selection unit 840 are added to the difference generation unit 810 and the compression unit 820. That is, the input determination unit 830 determines whether the old program 610 and the new program 620 are input or only the new program 620 is input in a determination 831. When the old program 610 and the new program 620 exist (831: YES), a difference is generated by the difference generation unit 810, and differential compressed data 841 obtained by compressing the difference by the compression unit 820 is generated and passed to the selection unit 840.

  If the size of the differential compression data 841 is equal to or smaller than the reference value (threshold) in the determination 842 (842: YES), the selection unit 840 outputs the differential compression data 841 as the output data 850. If it is larger than the reference value (842: NO), the compression unit 820 is instructed to compress the new program 620 via 815. The compression unit 820 generates compressed data 843 and temporarily holds it in the selection unit 840. The selection unit 840 uses the selection unit 844 to select the smaller of the difference compressed data 841 and the compressed data 843 and outputs the selected data to the output data 850.

  As a result, smaller differential compressed data or compressed data can be obtained. On the other hand, if the determination 831 of the input determination unit 830 is NO, the new program 620 is passed to the compression unit 820 via 815 to generate compressed data 843. The selection unit 840 uses the selection unit 844 to select the compressed data 843 and output it to the output data 850.

  As described above, the differential compressed data generation software 800 with a selection function can generate output data having a smaller size than the differential compressed data generation software 600. Furthermore, even when the old program does not exist, the new program can be compressed and output. However, a slightly simplified configuration is also conceivable. For example, when compressed data 843 is generated, the compressed data 843 may be used as the output data 850 without performing size comparison by the selection unit 844. This is because the determination unit 844 can be considered unnecessary because the difference compressed data is already determined to be equal to or greater than the reference value in the determination 842. The new program to be input may be a new program in one block divided into a plurality of blocks, and the old program may be an old program in several blocks divided into a plurality of blocks.

  Next, with reference to FIG. 9, the configuration and operation of differential compression data generation software 900 with a restriction function, which is one of the present invention, will be described.

  First, the necessity of the constraint function will be explained. When the differential compressed data and the compressed data are transmitted to the ECU 300, the differential compressed data and the compressed data are received by the first region 302a of the ECU 300. However, if the differentially compressed data or the compressed data has a size larger than that of the first area 302a, it is not possible to receive all of the data, and as a result, it cannot be restored. This is the need for constraints.

  Therefore, the differential compressed data generation software 900 with a constraint function has a configuration in which a constraint unit 980 is added in addition to the input determination unit 910, the difference generation unit 950, the compression unit 960, and the selection unit 970. The processing operation will be described below. The input includes the first area size 1S (925) of the ECU 300 and is information used by the restriction unit 980.

  First, the input determination unit 910 determines whether the old program 610 and the new program 620 are input or only the new program 620 is input in the determination 911, and if the old program 610 and the new program 620 exist ( 911: YES), the difference generation unit 950 generates a difference, and the compression unit 960 generates difference compressed data 971 obtained by compressing the difference. If the difference compressed data size is equal to or smaller than the reference value in determination 972, the selection unit 970 passes the difference compressed data 971 as selection data 981 to the constraint unit 980.

  If the size of the differentially compressed data 971 is larger than the reference value (972: NO), the compression unit 960 is instructed to compress the new program 620 via 915. The compression unit 960 compresses the new program 620 and generates compressed data 973. The selection unit 974 of the selection unit 970 passes the smaller of the difference compressed data 971 and the compressed data 973 as selection data 981 to the restriction unit 980.

  The restriction unit 980 compares the size (SS) of the selection data 981 with the first area size (1S) in the restriction means 982, and if the selection data 981 is smaller (SS ≦ 1S), the selection data 981 is output to the output data 930. Output as. Here, the selection data 981 is either the differential compressed data 971 or the compressed data 973. On the other hand, if the size (SS) of the selection data 981 is larger than the first area size (1S) (SS> 1S), the output data 930 becomes the new program itself.

  In the case of a new program, after erasing the block in the FLASH memory, it can be divided and transmitted to the first area and written to the block in multiple times.

  Next, a flowchart until the PC 1 generates differential compressed data or compressed data using the differential compressed data generation software 800 with a selection function shown in FIG. 8 and transmits it to the server 2 will be described with reference to FIG.

  The basic idea is not to generate differential compressed data or compressed data for the old program and the entire new program, but to divide the old and new programs into a plurality of blocks and the ECU 300 and the new program arranged in one block. In other words, differential compressed data or compressed data of an old program arranged in one or a plurality of blocks of the FLASH memory 303 is generated.

  The computing device 201 of the PC 1 first checks in step S10 whether an old program exists. If it does not exist (S10: NO), the new program is divided into blocks B (J) (J = 1, 2,..., N) of the FLASH memory 303 of the ECU 300 in step S40. In step S45, block B (J) is selected, and the process is repeated until step S60. In step S50, the compressed data is generated by compressing the new program of the selected block B (J) using the differential compression data generation software 800 with a selection function. The size of the compressed data is also stored.

  In step S55, the compressed data B (J) is transmitted to the server 2. In step S60, it is checked whether all blocks have been processed. If J = N (S60: YES), the process ends. If J.noteq.N, then J = J + 1 and return to step S45 to execute repeatedly.

  If an old program exists in step S10 (S10: YES), a new program and an old program are determined for each block B (I) (I = 1, 2,..., N) size in the FLASH memory 303 of the ECU 300 in step S15. Split. Here, the storage device 205 of the PC 1 stores the size of each block B (I) of the FLASH memory 303 of the ECU 300, the address of the block B (I), and the ID (identifier) of the ECU 300.

  The computing device 201 of the PC 1 performs initial setting (I = 1) of the loop relating to the block B (I) (step S20). In step S25, the computing device 201 of the PC 1 stores the new program of the block B (I) and the I blocks B (I), B (I-1), B (I-2), ..., B (1). The old program is input and the differential compression data generation software 800 with a selection function is executed. As a result, differential compressed data or compressed data of block B (I) is generated. The size is also stored. In step S30, the differential compressed data or compressed data of block B (I) is transmitted to the server 2. In step S35, it is checked whether all blocks have been processed. If I = N, the process ends. If I ≠ N, set I = I + 1, return to step S20, and execute repeatedly.

  As described above, the differential compressed data or the compressed data, the data size, the block size, and the block address can be transmitted to the server 2 for each block size of the FLASH memory 303 of the ECU 300.

  Next, FIG. 11 shows a flowchart until the PC 1 according to another invention transmits the differential compressed data, the compressed data, or the new program itself to the server 2 using the differential compressed data generation software 900 with the restriction function shown in FIG. explain. Similarly, the basic idea is not to generate differentially compressed data or compressed data of the entire old and new programs, but to divide the old and new programs into a plurality of blocks, and the new program arranged in one block and the flash memory of the ECU 300 The point is that differential compressed data or compressed data of the old program arranged in one or a plurality of blocks 303 is generated.

  The computing device 201 of the PC 1 checks whether an old program exists in step S70. If it does not exist (S70: NO), a process of transmitting the compressed data or the new program itself to the server 2 by dividing the new program into blocks in the processes after step S100 is performed.

  First, in step S100, the new program is divided into blocks B (J) (J = 1, 2,..., N) in the FLASH memory 303 of the ECU 300. In step S105, the block B (J) is selected, and the process is repeated until step S120. The new program of the block B (J) selected in step S110 and the first area size 1S (925 in FIG. 9) are input to execute the differential compressed data generation software 900 with a restriction function.

  As a result, the compressed data of the block B (J) or the new program itself is output. The data size is also stored. In the next step S115, the compressed data of B (J) or the new program itself is transmitted to the server 2. In step S120, it is checked whether all the blocks have been processed. If J = N (S120: YES), the process ends. If J ≠ N, J = J + 1 and return to step S105 to execute repeatedly.

  If an old program exists in step S70 (S70: YES), a new program and an old program are determined for each block B (I) (I = 1, 2,..., N) size in the FLASH memory 303 of the ECU 300 in step S75. Split. Here, the storage device 205 of the PC 1 stores the size of each block B (I) of the FLASH memory 303 of the ECU 300, the address of the block B (I), and the ID (identifier) of the ECU 300. The computing device 101 of the PC 1 performs initial setting (I = 1) of the loop relating to the block B (I) (step S80).

  The computing device 201 of the PC 1 determines that the new program and I blocks B (I), B (I-1), B (I-2),. The old program arranged in (1) and the first area size 1S (925 in FIG. 9) are input to execute the differential compressed data generation software 900 with a restriction function. As a result, differential compressed data or compressed data of B (I) or the new program itself is output, and is transmitted to the server 2 in step S90. In step S95, it is checked whether all blocks B (I) (I = 1 to N) have been processed. If I = N, the process ends. If I.noteq.N, then I = I + 1 and return to step S80 to execute repeatedly.

  As described above, the differential compressed data, the compressed data, or the new program, the data size, the block size, and the block address can be transmitted to the server 2 for each block size of the FLASH memory 303 of the ECU 300.

  The processing flow of the PC 1 in FIG. 10 and FIG. 11 described above divides the old and new programs into the same block B (I) unit of the FLASH memory of the ECU 300, and a plurality of new programs and multiple programs arranged in one divided block. The differential compression data was created from the old program placed in this block. The reason for this will be described with reference to FIGS. 12, 13, 13A, and 13B.

  OL10 in FIG. 12 shows a configuration in which the old program is divided into blocks B (1) to B (7) of the FLASH memory of the ECU. On the other hand, N10 indicates a configuration in which the new program is divided into blocks B (1) to B (7) of the FLASH memory of the ECU. V10 in the new program is an added / changed part. That is, it is the part where the old program is added or changed.

  On the other hand, R10, R20, and R30 indicate the instruction sequence of the microcomputer in which the reference address to the variable in V10 is changed with the addition / change of V10. That is, since the address of the variable is changed by adding / changing V10, the address of the variable so far is also changed accordingly, so the reference addresses of R10 to R30 are also changed at the same time. For this reason, the block B (3) of the new program N10 is added or changed by V10, the block B (5) is changed by R10 and R20, and the block B (6) is changed by R30.

  It should be noted here that the only real change is V10, and the changes of R10 to R30 are seen from the whole new program despite the occurrence of secondary changes accompanying the change of V10. That is not a very big change. Therefore, in the case of such a small change, even if the old and new programs generate differentially compressed data in the same block B (I) unit, the data size is often below the reference value.

  For this reason, when updating a program due to a software defect or the like, sufficiently small difference compressed data can be obtained even if the old and new programs are divided into blocks and the difference compressed data is generated between the same blocks.

  On the other hand, FIG. 13 is a diagram showing an old program OL20 and a new program N20 in which significant changes exist. Here, B (4) of N20 has a large additional change portion AD10. R100, R110, R120, R130, R140, and R150 indicate the address change of the reference variable accompanying the addition / change of AD10. Here, the new program of block B (3) of N20 is the same as B (3) of old program OL20 because there is no change, but the new program of block B (4) of N20 is block B (4) of OL20. Naturally, it is completely different from the old program.

  The next new program of block B (5) of N20 is very different from the old program of block B (5) of OL20 and is often similar to the old program of block B (4) of OL20. This is thought to be because the old program of B (4) of OL20 has moved to the new program part of B (5) of N20 due to the addition of AD10. Therefore, it can be understood that the optimum block selection method for generating differentially compressed data is not simply performed between the same blocks.

  Here, CP 100 in FIG. 13 indicates that it is better to generate differentially compressed data between old and new programs of B (3). On the other hand, CP110 in FIG. 13 shows that the new program of B (5) is similar to the old program of B (4), and CP120 in FIG. It shows that it is similar to the old program of 5). As a result, the difference compressed data is generated by the old program of B (4) and the new program of B (5), and the difference compressed data is generated by the old program of B (5) and the new program of B (6). It shows that the differential compression data size can be reduced.

  As described above, the outline of selecting the old program of the block B (I) most suitable for the new program of the block B (K) (K = 1 to N) has been described in detail.

  However, although the outline of selecting only one old block B (I) optimal for the block (K) of the new program has been described, a plurality of old blocks B (I) may be provided.

  FIG. 13A is a diagram illustrating an outline of selecting a plurality of old blocks B (I) (I = 1 to K) that are optimal for the new block B (K) when a large program is added to the new program N20. is there. That is, when a large program AD10 is added to the new block B (4), the old block corresponding to the new block B (5) has already been described as being optimal for B (4). A plurality of old blocks B (1) to B (4) including (4) may be selected.

  This is because, generally, the difference generation algorithm finds similar binary code in the old block and generates a difference, so that a larger old program can generate a smaller difference. Therefore, the plurality of old blocks most suitable for the new block B (6) are the six old blocks B (1) to B (6) designated by the CP 100A in FIG. 13A, and the new block B (5) The most suitable old blocks are B (1) to B (5) indicated by CP 110A in FIG. 13A, and the most suitable old blocks for new block B (4) are indicated by CP 120A in FIG. 13A. B (1) to B (4).

  As described above, when a large program is added, differentially compressed data is generated in descending order of the block number, and selection of a plurality of old blocks corresponding to the block of the new program is performed in the order of the block having the smallest number from that block. It is important to select a plurality. If the block of the old program is selected in this way, it is possible to select the old program to be used for restoration even if the block is rewritten to the new program.

  FIG. 13B shows an outline of selecting a plurality of blocks B (I) (I = N to K) of the old program that are most suitable for the block B (K) of the new program when a large program is deleted from the old program OL20. FIG.

  Block B (4) of the new program N20 indicates that the large program AD10B has been deleted. As a result, it is shown that the content is close to the content of the block B (5) of the old program OL20. As a result, it is considered that the N20 block B (5) is the optimal OL20 block B (6). Therefore, the blocks of the old program that are optimal for the block B (5) of N20 may be selected from a plurality of blocks B (5) to B (7) including the block B (6) of OL20. In general, the difference generation algorithm finds similar binary code in the old program and generates the difference, so that the larger old program can generate a smaller difference.

  Therefore, the plurality of OL20 blocks most suitable for the N20 block B (4) are the four old blocks B (4) to B (7) designated by the CP 100B, and the N20 block B (5) A plurality of blocks of the optimal OL 20 are B (5) to B (7) designated by the CP 110B, and a plurality of blocks of the optimal OL 20 for the block B (6) of the N 20 are B (B) designated by the CP 120B. 6) to B (7). As described above, when a large program is deleted, differentially compressed data is generated in ascending order of block numbers, and a plurality of old blocks corresponding to the new block are selected in order from the block having the largest number. It is important to choose. By selecting the block of the old program in this way, it is possible to select the old program to be used for restoration even if the block is rewritten to the new program.

  FIG. 14, FIG. 14 is a flowchart for selecting the old program block B (I) or a plurality of old blocks optimal for the new program block B (K) on the PC 1 in accordance with the outline of FIG. 13, FIG. 14A and 14B. Thereby, it is possible to select an old block or a plurality of old blocks that are optimal for generating differentially compressed data.

  First, FIG. 14 shows a processing flow for selecting the old program of block B (I) that is optimal for the new program of block B (K) (K = 1 to N) in FIG.

  The computing device 201 of the PC 1 divides the new program into blocks B (K) (K = 1 to N) of the FLASH memory 303 of the ECU 300 in step S130. In step S135, a new program of block B (K) (K = 1: initial value) is selected. In step S140, the old program is divided into blocks B (I) (I = 1 to N) of the FLASH memory 303 of the ECU 300. In step S145, block B (I) (I = 1: initial value) is selected, and in step S150, differentially compressed data of B (K) and B (I) is generated. Next, in step S155, the difference compressed data size is compared with the reference value. If the difference compressed data size is equal to or smaller than the reference value (step S155: YES), the old program of block B (I) is selected in step S170. Conversely, if the differentially compressed data size is larger than the reference value (step S155: NO), I = I + 1 is set in step S160, the process returns to step S145, and the process is repeated. If the result of comparing the old programs of all the blocks B (I) in step S155 is NO, since I = N in step S160, step S165 is executed, and no block (B (K) compression is performed. Select). In step S175, it is checked whether all B (K) (K = 1 to N) processing is completed. If K = N, the processing ends. If K ≠ N, K = K + 1 is set, and the process returns to step S135 to repeat the process.

  Thus, an old program having an optimum block can be selected for each B (K) (K = 1 to N).

  FIG. 14A is a flowchart when a plurality of old blocks are selected in a new program to which a large program is added.

  The computing device 201 of the PC 1 divides the new program into blocks B (K) (K = N to 1) of the FLASH memory 303 of the ECU 300 in step S130A. In step S135A, a new program of block B (K) (K = N: initial value) is selected. In step S140A, the old program is divided into blocks B (I) (I = 1 to N) of the FLASH memory 303 of the ECU 300.

  In step S145A, an old program of K blocks BB (BB = B (1) to B (K)) is selected, and differential compressed data of the new program of B (K) and the old program of BB is generated in step S150A. . Next, in step S155A, the differential compression data size is compared with the reference value. If the differential compression data size is equal to or smaller than the reference value (step S155A: YES), the old program from block B (1) to block B (K) is determined in step S170A. Select. On the other hand, if the differential compression data size is larger than the reference value (step S155A: NO), no block (compress B (K) new program) is selected in step S165A, and step K175 is set in step S175A. Returning to S135A, the process is repeated. The process ends when K = 1. Thus, starting from the new program of the block B (N) of the last block number N, the old programs (B (1) to B (K)) of a plurality of blocks corresponding to the new program of B (K) The selected compressed data is generated.

  The order of decoding from the differentially compressed data and the old program may be started from the last block.

  FIG. 14B is a flowchart when a plurality of old blocks are selected in a new program from which a large program is deleted.

  The computing device 201 of the PC 1 divides the new program into blocks B (K) (K = 1 to N) of the FLASH memory 303 of the ECU 300 in step S130B. In step S135B, a new program for block B (K) (K = 1: initial value) is selected. In step S140B, the old program is divided into blocks B (I) (I = 1 to N) of the FLASH memory 303 of the ECU 300.

  In step S145B, an old program of a plurality of blocks BB (BB = B (K) to B (N)) is selected. In step S150B, differential compressed data of the new program of B (K) and the old program of BB is generated. Next, in step S155B, the difference compressed data size is compared with the reference value. If the difference compressed data size is equal to or smaller than the reference value (step S155B: YES), the old program from block B (K) to block B (N) in step S170B. Select. On the other hand, if the differential compression data size is larger than the reference value (step S155B: NO), no block (compress B (K) new program) is selected in step S165B, and K = K + 1 is set in step S175B to step S135B. Return and repeat the process. The process ends when K = N. Thus, starting from the new program of block B (1) with the first block number 1, the old programs (B (K) to B (N)) of a plurality of blocks corresponding to the new program of B (K) The selected compressed data is generated.

  Further, the order of decoding from the differentially compressed data and the old program may be started from the first block.

  As described above, the method of selecting the old program of a plurality of blocks most suitable for the new program of blocks has been described in detail. In the example described with reference to FIGS. 14A and 14B, the differentially compressed data compresses the difference between the first data (old program) corresponding to a plurality of blocks and the second data (new program) corresponding to one block. It is a thing. Here, the first data includes at least one data obtained by dividing the old program into block sizes, and the second data includes one data obtained by dividing the new program into block sizes. Including.

  Next, the operation of the server 2 will be described with reference to FIG. FIG. 15 is a flowchart showing processing of the server 2 shown in FIG.

  The computing device 201S of the server 2 receives data of the block B (K) (K = 1 to N) (differential compressed data or compressed data or the new program itself) from the PC 1 in response to the request of the PC 1 by the communication device 204. (Step S180). The arithmetic device 201S of the server 2 stores the data received from the PC 1 in the storage device 205 (step S185). Here, the computing device 201S of the server 2 performs the processing from step S180 to step S185 for all blocks B (K) (K = 1 to N).

  Next, the arithmetic device 201S of the server 2 transmits the data of B (K) (K = 1 to N) stored in the storage device 205 to the gateway 310 using a predetermined event as a trigger (step S190). The predetermined event is, for example, a request from the gateway 310 at a predetermined timing, a request from the gateway 310 caused by a user performing a predetermined operation, or the like.

  Next, the operation of the gateway 310 will be described. FIG. 16 is a flowchart showing processing of the gateway 310 shown in FIG.

In response to the request from the server 2, the microcomputer 311 of the gateway 310 sends the data of the block B (K) (K = 1 to N) (differential compressed data or compressed data or the new program itself) via the communication device 316. Receive (step S200). The microcomputer 311 of the gateway 310 stores the data received from the server 2 in the FLASH memory 313 (step S205). Next, the microcomputer 311 of the gateway 310 sets all blocks B (K).
For (K = 1 to N), the processing from step S200 to step S205 is performed.

  The microcomputer 311 of the gateway 310 determines whether or not a condition for updating the program stored in the FLASH memory 303 of the ECU 300 is satisfied (step S210). For example, when a user performs a predetermined operation in a predetermined driving state, it is determined that the condition for updating the program is satisfied.

  When the condition for updating the program is satisfied (step S210: YES), the microcomputer 311 of the gateway 310 generates a frame from the data stored in the FLASH memory 313 (step S215).

  More specifically, as shown in FIG. 17, the microcomputer 311 of the gateway 310 refers to the command f1, the block data type f2, the block data size f3, the block data address f4 to which the block data is written, and the restoration process. A frame including the address f5 and block data f6 of the block of the old program is generated.

  Here, as the command f1, a command for instructing writing is set. The block data is differentially compressed data or compressed data of block B (K) or a new program. The block data type f2 indicates that the block data is one of differentially compressed data, compressed data, and a new program. The block data size f3 indicates any one of the differential compression data size, the compression data size, and the size of the new program itself.

  In this way, the microcomputer 311 (arithmetic unit) of the gateway 310 (program writing device) generates a frame in which the block data type f2 is added to the block data f6.

  Although not shown in FIG. 17, the frame includes the ID of the transmitting node and the ID of the receiving node. Here, the transmission node is the ID of the gateway 310, and the reception node is the ID of the ECU 300.

  Returning to FIG. 16, the microcomputer 311 of the gateway 310 transmits the generated frame to the ECU 300 via the communication device 316 (step S220).

  Next, restoration software arranged in the FLASH memory 303 of the ECU 300 will be described. FIG. 18 shows the configuration of the restoration software. Note that the arithmetic unit 301 of the ECU 300 executes the following processing by executing the restoration software 1800.

  The input to the arithmetic unit 301 (restoration software 1800) is the differential compressed data 1810 and the old program 1820. The restoration software 1800 includes a decompression unit 1840 that decompresses the compressed differential compressed data, a difference that is output from the decompression unit 1840, and a differential restoration unit 1850 that restores the new program 1830 from the old program 1820. As described above, the restoration software 1800 includes an extension unit and a difference restoration unit.

  On the other hand, in order to handle differential compressed data with a selection function and differential compressed data with a constraint function, it is necessary to restore not only the differential compressed data but also the compressed data. FIG. 19 shows a configuration of new decompression software 1900 corresponding to differential compression data generation software 800 with a selection function (FIG. 8) and differential compression data generation software 900 with a restriction function (FIG. 9). Note that the arithmetic unit 301 of the ECU 300 executes the following processing by executing the restoration software 1900.

  First, the block data 1910 and the old program 1920 are input to the arithmetic unit 301 (restoration software 1900). Block data 1910 is differentially compressed data or compressed data. The new program itself will be described later with reference to FIG. 21, but is not handled by the restoration software 1900. Therefore, the block data 1910 that is input to the decompression software 1900 is assumed to be differentially compressed data or compressed data.

  The restoration software 1900 is characterized in that it includes a data type determination unit 1960 in addition to the decompression unit 1940 and the difference restoration unit 1950. When the block data 1910 is input, the decompression unit 1940 generates data obtained by decompressing the block data 1910. If the type of data expanded in the determination 1961 is a difference, the data type determination unit 1960 passes the difference to the difference restoration unit 1950. The difference restoration unit 1950 generates a new program 1930 with the difference and the old program 1920 as inputs. On the other hand, if the type of data expanded in decision 1961 is a new program, the new program is output to 1930.

  As described above, the restoration software 1900 has a function of determining a difference or a new program within 1900. The output data 850 of the differential compression data generation software 800 with a selection function in FIG. 8 describes information that can be determined as differential compression data or compression data. Similarly, the output of the differential compression data generation software 900 with a restriction function in FIG. The output data 930 also includes discrimination information indicating that it is either differential compressed data, compressed data, or the new program itself.

  Next, a flowchart for restoring the block data (FIG. 10) transmitted by the differential compressed data generation software 800 with a selection function and updating the FLASH memory 303 of the ECU 300 will be described with reference to FIG.

  When ECU 300 receives the frame in step S230, ECU 300 inputs the block data and the old program of the block of the FLASH memory in ECU 300 to restoration software 1900 and executes restoration software 1900 in step S235. As a result, the new program is restored to the second area of the SRAM. Next, in step S240, the FLASH block at address f4 of the ECU 300 is erased to enable writing. Finally, in step S245, the new program in the second area of the SRAM is written into the block, and the process is terminated.

  The new program can be updated on a block basis. Updating all programs can be accomplished by receiving all frames (step S230) and writing a new program for each block.

  Next, a flowchart for restoring the block data (FIG. 11) transmitted by the differential compression data generation software 900 with the restriction function and updating the FLASH memory 303 of the ECU 300 will be described with reference to FIG.

  When ECU 300 receives the frame in step S250, ECU 300 divides the case into two types, block data type f2, differential compressed data or compressed data, and new program itself in step S255. In the case of differentially compressed data or compressed data, in step S260, the block data and the old program of the FLASH memory block in the ECU 300 are input to the restoration software 1900 to execute the restoration software 1900.

  As a result, the new program is restored to the second area of the SRAM. Next, in step S265, the FLASH block at the address f4 of the ECU 300 is erased to make it writable. Next, in step S270, the new program in the second area of the SRAM is written into the block, and the process ends. On the other hand, if the block data type f2 is the case of the new program itself in step S255, the FLASH block at the address f4 of the ECU 300 is erased and is in a writable state in step S265. In step S270, the new program is written to the block, and the process is terminated.

  The new program can be updated on a block basis. Updating all programs can be accomplished by receiving all frames (step S250) and writing a new program for each block.

  As described above, according to the present embodiment, reprogramming can be performed quickly and easily. Also, the user can perform reprogramming anywhere without bringing the vehicle to the dealer.

  In addition, this invention is not limited to above-described embodiment, Various modifications are included. For example, the above-described embodiment has been described in detail for easy understanding of the present invention, and is not necessarily limited to one having all the configurations described. Further, a part of the configuration of an embodiment can be replaced with the configuration of another embodiment, and the configuration of another embodiment can be added to the configuration of an embodiment. In addition, it is possible to add, delete, and replace other configurations for a part of the configuration of each embodiment.

  In the above-described embodiment, the program generation device 100 includes two computers (PC 1 and server 2), but the number of computers is arbitrary.

  In the above embodiment, transmission is performed in block units from the PC 1 to the server 2. However, if the memory capacity of the PC 1 or the server 2 is sufficient, a plurality of blocks of differential compressed data or compressed data may be transmitted together. Transmission from the server 2 to the gateway 310 depends on the capacity of the SRAM 312 and the FLASH memory 313 of the gateway 310. If the SRAM 312 and the FLASH memory 313 are sufficiently large, they may be transmitted together.

  On the other hand, transmission from the gateway 310 to the ECU 300 via the CAN should be performed in units of one or a plurality of blocks because the SRAM capacity 302 of the ECU is small. In this embodiment, one block size is used as the SRAM size necessary for restoration, but differentially compressed data and compressed data may be generated in units of a plurality of blocks according to the size of the SRAM 302. This selection may be determined by the size of the SRAM 302.

  In the above embodiment, the FLASH memory 303 is composed of blocks of two types, but may be composed of blocks of three or more different sizes. Further, the FLASH memory 303 may be composed of blocks of one kind of size.

  Further, each of the above-described configurations, functions, and the like may be realized by hardware by designing a part or all of them with, for example, an integrated circuit. Each of the above-described configurations, functions, and the like may be realized by software by interpreting and executing a program that realizes each function by the processor. Information such as programs, tables, and files for realizing each function can be stored in a recording device such as a memory, a hard disk, or an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD.

  In addition, the following aspects may be sufficient as embodiment of this invention.

(First aspect)
The arithmetic unit is
When the type of block data is differentially compressed data, the new program is restored from the old program stored in the block corresponding to the block data and address, and the restored new program is written to the block write address. In-vehicle control device.

(Second aspect)
The arithmetic unit is
An in-vehicle control device characterized in that, when the type of block data is compressed data, a new program is restored from the block data, and the restored new program is written to the write address of the block.

(Third aspect)
Non-volatile memory
An in-vehicle control device comprising at least two blocks of different sizes.

(Fourth aspect)
The in-vehicle control device, wherein the nonvolatile memory is a FLASH memory.

(5th aspect)
The in-vehicle control device, wherein the volatile memory is an SRAM.

(Sixth aspect)
The arithmetic unit is a microcomputer,
A volatile memory and a nonvolatile memory are built in a microcomputer.

(Seventh aspect)
An input determination step for determining whether or not the first data is input;
The selection process is
A differential compressed data generation program including outputting compressed data obtained by compressing second data when it is determined by the input determining step that the first data is not input.

(Eighth aspect)
An input determination step for determining whether or not the first data is input;
The selection process is
A differential compressed data generation program including outputting differential compressed data when it is determined in the input determining step that the first data is input and the size of the differential compressed data is smaller than a reference value.

1 ... PC
2 ... Server 3 ... In-vehicle system 100 ... Program generation device 101 ... Arithmetic device 102 ... Input device 103 ... Display device 104 ... Communication device 105 ... Storage device 201 ... Arithmetic device 202 ... Input device 203 ... Display device 204 ... Communication device 205 ... Storage device 300 ... ECU (on-vehicle control device)
301: Microcomputer (arithmetic unit)
302 ... SRAM (volatile memory)
302a: SRAM first area 302b: SRAM second area 303: FLASH memory (nonvolatile memory)
304 ... Various ICs
305 ... Communication device 310 ... Gateway (program writing device)
311 ... Microcomputer 312 ... SRAM
313: FLASH memory 314: Various ICs
315 ... Communication device (CAN protocol)
316: Communication device (network protocol outside the vehicle)
600 ... Differential compression data generation software 700 ... Compression data generation software 800 ... Differential compression data generation software 900 with selection function ... Differential compression data generation software 1800 with restriction function ... Differential compression data decompression software 1900 ... New differential compression data decompression software

Claims (20)

A non-volatile memory configured by a plurality of blocks and storing an old program;
Volatile memory,
First data including at least one data obtained by dividing the old program into the block size and second data including one data obtained by dividing the new program into the block size A communication device that receives differential compressed data obtained by compressing a difference, or block data including compressed data obtained by compressing the second data, a type of the block data, and a frame including a write address of the block;
An arithmetic device that restores the second data to the volatile memory according to the type of the block data, and writes the restored second data to the write address of the block;
A vehicle-mounted control device comprising: The in-vehicle control device according to claim 1,
The differentially compressed data is
A vehicle-mounted control device, wherein a difference between the first data and the second data in the same block is compressed. The in-vehicle control device according to claim 1,
The differentially compressed data is
A vehicle-mounted control device, wherein a difference between the first data and the second data in different blocks is compressed. The in-vehicle control device according to claim 1,
The differentially compressed data is
A vehicle-mounted control device, wherein a difference whose size is equal to or smaller than a reference value among the differences between the first data and the second data is compressed. The in-vehicle control device according to claim 1,
The differentially compressed data is
A vehicle-mounted control device, wherein a difference between the first data corresponding to a plurality of the blocks and the second data corresponding to one block is compressed. The in-vehicle control device according to claim 5,
The first data is:
An in-vehicle control device comprising an old program arranged in a plurality of blocks from the first block to the one block. The in-vehicle control device according to claim 5,
The first data is:
An in-vehicle control device comprising an old program arranged in a plurality of blocks from the one block to the last block. First block including at least one data obtained by dividing an old program stored in a non-volatile memory of the vehicle control device into a size of the block, and a new program of the block The block data is converted into differentially compressed data obtained by compressing the difference of second data including one piece of data obtained by dividing the data into size, or compressed data obtained by compressing the second data. An arithmetic unit for generating a frame with added types;
A communication device for transmitting the frame to the in-vehicle control device;
A program writing apparatus comprising: The program writing device according to claim 8,
The differentially compressed data is
A program writing apparatus, wherein a difference between the first data and the second data in the same block is compressed. The program writing device according to claim 8,
The differentially compressed data is
A program writing apparatus, wherein a difference between the first data and the second data in different blocks is compressed. The program writing device according to claim 8,
The first data is:
A program writing apparatus comprising an old program arranged in a plurality of blocks from a first block to the one block. The program writing device according to claim 8,
The first data is:
A program writing apparatus comprising an old program arranged in a plurality of blocks from the one block to the last block. The program writing device according to claim 8,
The differentially compressed data is
A program writing apparatus, wherein a difference between a predetermined number of the first data and the predetermined number of the second data is compressed. The program writing device according to claim 8,
The compressed data is
A program writing apparatus, wherein a predetermined number of the second data is compressed. A storage device for storing the same old program as the program stored in the nonvolatile memory of the vehicle control device, and a new program obtained by updating the old program;
It is obtained by dividing the first data including at least one data obtained by dividing the old program into the block size of the nonvolatile memory and the new program into the block size of the nonvolatile memory. A division unit that generates second data including one data, a difference generation unit that generates a difference between the first data and the second data, a compression unit that generates differential compressed data obtained by compressing the difference, and A selection unit configured to generate compressed data obtained by compressing the second data when the size of the differentially compressed data is equal to or larger than a reference value, and to select the smaller of the differentially compressed data or the compressed data as block data; An arithmetic unit;
A communication device for transmitting the block data to the in-vehicle control device;
A program generation device comprising: The program generation device according to claim 15,
An input determination unit for determining whether or not the first data is input;
The selection unit includes:
When the input determining unit determines that the first data is input, the differential compressed data is output. When the input determining unit determines that the first data is not input, the first data is output. A program generation apparatus that outputs compressed data obtained by compressing the second data. The program generation device according to claim 15,
The arithmetic unit is:
If the block data is larger by comparing the size of the block data with the size of the first area of the volatile memory of the in-vehicle controller for temporarily storing the block data, the block data And a restriction unit that sets the second data itself as the block data. First data including at least one data obtained by dividing the old program into the size of the block of the nonvolatile memory, and data obtained by dividing the new program into the size of the block of the nonvolatile memory A difference generation step of generating a difference between second data including one;
A selection step of outputting either differential compressed data obtained by compressing the difference or compressed data obtained by compressing the second data;
A program that causes an arithmetic unit to execute. The program according to claim 18, wherein
An input determination step of determining whether or not the first data is input;
The selection step includes
When the input determination step determines that the first data is input, the differential compression data is output. When the input determination step determines that the first data is not input, the first data A program characterized by outputting compressed data obtained by compressing the data of No. 2. A decompression process for decompressing the compressed data;
The data generated by the decompression step includes first data including at least one data obtained by dividing the old program into the size of the block of the nonvolatile memory, and a new program including the size of the block of the nonvolatile memory. A data type determination step for determining whether or not the difference between the second data including one piece of data obtained by dividing the data into two or the second data itself;
A differential restoration step of restoring a new program from the old program stored in the block of the difference and the nonvolatile memory;
If the data type determination step determines that the data type is a difference, the new program restored by the difference restoration step is output, and the data type determination step determines that the data type is the second data itself. If it is determined that there is an output step of outputting the second data;
A program that causes an arithmetic unit to execute.

Images