KR20130104283A - Method of updating firmware - Google Patents

Abstract

PURPOSE: A firmware updating method is provided to reduce a space required for update by calculating firmware update for blocks. CONSTITUTION: A method for providing a firmware from a firmware server to a device is as follows: a step of generating an edit script in which a difference between old and new version firmwares is described by comparing the old and new version firmwares crossed to an mxn matrix (S23); and a step of transferring the edit script to the device (S24). The step of generating the edit script is as follows: a step of defining an arrangement of the old and new version firmwares; a step of arranging the old and new version firmwares in the mxn matrix; a step of finding a coordinate in which the values of the old and new version firmwares are same to generate a diagonal line; a step of deducting a shortest path reaching from a starting point (0,0) of the mxn matrix to (m,n); and a step of coding the shortest path. [Reference numerals] (10) Firmware server; (50) Update device; (S21) Request information about a firmware version; (S22) Transmit the information about a firmware version; (S23) Generate an edit script by comparing firmwares; (S24) Transmit the edit script; (S25) Copy an old version firmware; (S26) Update the old version firmware to a new version firmware by using the edit script

Description

How to update firmware {Method of updating firmware}

The present invention relates to a firmware update method.

Most modern industrial devices have a special purpose and have software (SW) to perform them. The software that enters the device is called embedded software or firmware. With the rapid development of the CPU, the role of firmware is also increasing in various ways.

Firmware is usually updated continuously to reflect additional customer requirements, or to solve problems the product has in hardware (HW) or software (SW), and the firmware update of the product is done in various ways.

Some products use special equipment to update, while others connect to a LAN cable to automatically access the manufacturer's server and retrieve the latest update. Recently, wireless has been used for firmware updates.

Firmware updates should always be provided with care, because if a firmware update fails, the product may need to be left to the manufacturer to recover.

Meanwhile, the most important performance indicators for firmware update include firmware update speed and stability.

Korean Unexamined Patent Publication No. 2010-0110652 compares the firmware of the previous version with the firmware to be updated and updates only the difference. However, the patent does not disclose a file comparison method, data to be transmitted and a method of restoring the same.

The present invention provides an update system that can reduce the amount of information required for the firmware update to the maximum and improve the stability and the speed of the firmware update.

In a method of providing firmware to a device by a firmware server according to an exemplary embodiment of the present invention, a difference between the old version firmware and the new version firmware may be compared by orthogonally arranging the old version firmware and the new version firmware in an mxn matrix. Generating the described edit script; And transmitting the edit script to the device.

The editing script generating step may include: defining an arrangement of the old version firmware and the new version firmware; Arranging the old version firmware and the new version firmware in the mxn matrix; Generating diagonal lines by finding coordinates of a new version firmware and an old version firmware value in the mxn matrix; Deriving the shortest path from the (0,0) coordinates of the m-by-n matrix to the (m, n) coordinates; And encoding the shortest path.

The encoding may include inserting a deletion code into a path moving to the right and inserting the insertion code into a path moving downward in the shortest path.

The method may further include directly transmitting the new version firmware to the device if the capacity of the edit script is greater than or equal to a reference capacity.

The method may further include generating an overflow script that records a location at which a buffer of the device overflows based on a result of comparing the number of deletion codes and insertion codes of the edit script and a buffer size of the device; And transmitting the overflow script to the device, wherein the edit script transmitting step includes updating the edit script on a block basis to update the old version firmware blocked on the basis of the overflow script. And transmitting to the device in units of blocks.

In a method of updating a firmware by a device according to an exemplary embodiment of the present invention, a difference between the old version firmware and the new version firmware is obtained by comparing orthogonally arranging the old version firmware and the new version firmware in an mxn matrix from a firmware server. Receiving an edit script describing the; And reconfiguring the old version firmware based on the edit script to update the new version firmware.

The firmware updating step may include copying the old version firmware stored in a memory into a buffer and flushing the memory; And copying the old version firmware into the memory, without copying a value associated with the delete code of the edit script into the memory, and inserting a value associated with the insert code of the edit script into the corresponding region of the memory. And reconfiguring the version firmware.

Receiving an overflow script that records the location of the buffer overflow of the device, based on a comparison result of the number of the deletion code and the insertion code of the edit script and the buffer size of the device before the edit script receiving step; And dividing the old version firmware into block units based on the overflow position, and securing an update space in the memory, and receiving the edit script in the block units to block the old version firmware. Can be reconstructed in units.

The present invention can derive the difference between firmware versions simply and accurately, and minimize the amount of information required for updating. In addition, the present invention can reduce the space required for the update by performing the firmware update operation for each block, it is possible to increase the safety of the firmware update.

1 is a block diagram schematically illustrating a firmware update system according to an embodiment of the present invention.
2 is a diagram illustrating a firmware update method according to an embodiment of the present invention.
3 to 7 are views for explaining an edit script generation method according to an embodiment of the present invention.
8 is a view for explaining a firmware update method according to another embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings. Like reference numbers in the drawings denote like elements. In the following description of the present invention, if it is determined that a detailed description of a related known function or configuration may unnecessarily obscure the subject matter of the present invention, the detailed description thereof will be omitted.

There are two ways to reduce the size of a file to be transferred during firmware update, using a compression algorithm and a file comparison. Most firmware updates are made to customer requirements or bug patches from previous versions of the file, so many of the files do not change. Therefore, the method of using the file comparison algorithm as a method of reducing the capacity during the firmware update is more efficient than the method of using the compression.

Embodiments of the present invention utilize a file comparison method using an " O (ND) Difference Algorithm " to find the shortest difference between two different arrays.

In most cases, the compilation of the firmware consists of 1) preprocessor processing, 2) converting functions into symbol files and converting them into object files. 3) addressing the symbol tables, and 3) using library files and object files before the symbol tables. According to the address, linking, that is, address mapping, 4) execution file (or binary file) is created. At this time, the address of symbol table is slightly different for each compiler. However, the address of symbol table should be set based on certain criteria such as alphabetical order of file name to be compiled. Thus, if you modify a particular function, only the system information part, such as the address part and header of that function, is changed, and most other files are compiled the same. When the function is created, it intercepts and moves backward binary information according to the symbol table address generation method. Usually, firmware updates tend to be more patched than a lot of fixes, and due to the above characteristics, patches don't show much change between the file to be updated and the previous file. Considering such an update environment, an "O (ND) Difference Algorithm" is effective in performing a firmware update.

1 is a block diagram schematically illustrating a firmware update system according to an embodiment of the present invention.

Referring to FIG. 1, the firmware update system 1 includes a firmware server 10 and an update device (hereinafter referred to as a “device”) 50.

The firmware server 10 includes a communication unit 101, an edit script generation unit 103, and an overflow script generation unit 105.

The communication unit 101 transmits and receives data with the device 50 by wire or wirelessly. The communication unit 101 requests version information of the current firmware from the device 50 and receives version information of the current firmware. The communication unit 101 transmits the edit script and the overflow script to the device 50.

If the current firmware version of the device 50 is an old version, the edit script generation unit 103 generates an edit script describing a difference between the old version firmware and the new version firmware by using an O (ND) difference algorithm. The edit script generation unit 103 orthogonally arranges the Hex Codes of the old version firmware and the new version firmware file in an mxn matrix, compares them, finds the shortest difference between the two arrays, codes them, and generates the edit script. The edit script includes insertion code for inserting data and deletion code for deleting data. A detailed method of generating an edit script will be described later. When the overflow script is generated, the edit script generation unit 103 receives a block edit script from the device 50, divides the edit script into blocks, and transmits the edit script to the device 50.

The overflow script generation unit 105 generates an overflow script that records a position at which the buffer of the device 50 overflows based on a result of comparing the number of deletion codes and insertion codes of the edit script.

The device 50 may include a laptop, a mobile phone, a PDA, a digital camera, an MP3 player, a set top box, and a digital camcorder. The device 50 includes a communication unit 501, a firmware update unit 503, a memory 505, and a buffer 507.

The communication unit 501 transmits and receives data to or from the firmware server 10 by wire or wirelessly. The communication unit 501 receives the version information of the current firmware from the firmware server 10 and transmits the version information of the current firmware. In this case, the communication unit 501 may transmit the size information of the buffer 507 together. The communication unit 501 receives an edit script and an overflow script from the firmware server 10.

The firmware updater 503 reconfigures the old version firmware based on the edit script and updates the new version firmware. The firmware updater 503 copies the old version firmware stored in the memory 505 to the buffer 507 and flushes the memory 505. The firmware updater 503 copies the old version firmware of the buffer 507 to the memory 505, but does not copy the data related to the delete code of the edit script to the memory 505, but the data related to the insert code of the edit script. Inserts into the corresponding area of memory 505 and reconstructs the old version firmware.

If the size of the buffer 507 is not sufficient, the firmware updater 503 updates the old version firmware block by block. The firmware updater 503 divides the old version firmware into blocks based on the overflow location of the overflow script, and moves the old version firmware into the memory unit 505 in blocks to secure space for data insertion during the update. Let's do it. The firmware updater 503 copies the old version firmware stored in the memory 505 from the first block to the buffer 507 in block units, and the first block is flushed from the memory 505. The firmware updater 503 receives the edit script in block units and reconstructs the old version firmware in block units. A detailed method of updating the firmware will be described later.

The memory 505 may be implemented as flash as nonvolatile memory and stores firmware.

The buffer 507 may be implemented in RAM as volatile memory, and temporarily stores the firmware when updating the firmware.

2 is a diagram illustrating a firmware update method according to an embodiment of the present invention. 3 to 7 are views for explaining an edit script generation method according to an embodiment of the present invention. Hereinafter, for convenience of description, the array A and the array B are represented by numbers, but the same may be applied to the array by replacing the array with the Hex Code of the firmware file.

Referring to FIG. 2, the firmware server 10 requests the current device firmware version information from the update device 50 (S21). The update device 50 transmits the current firmware version information (S22). The firmware server 10 includes an old version firmware and a firmware version to be updated (hereinafter referred to as "new version firmware"). As another example, the firmware server 10 may include only a new version of firmware, and the old version firmware may be requested by the update device 50 and transmitted.

If it is determined that the current firmware version of the update device 50 is an old version, the firmware server 10 compares the old version firmware with the new version firmware and generates an edit script (S23). The edit script is a code that describes the difference between the old version firmware and the new version firmware in order to convert the old version firmware array to the new version firmware array.

Referring to FIG. 3, the edit script generation unit 103 of the firmware server 10 defines an old version firmware array A and a new version firmware array B (S231). Then, '0' is inserted at the beginning of each array (A, B).

The edit script generation unit 103 forms an mxn matrix, and arranges the old version firmware array A and the new version firmware array B on the matrix (S233). Where m is 1 greater than the length of the new version firmware array B (Length (B + 1)), and n is 1 greater than the length of the old version firmware array A (Length (A + 1). ))to be. The old version firmware array A is placed from the top left to the right of the matrix, and the new version firmware arrangement B is placed from the top left to the bottom of the matrix. The leading zero is at the (0,0) coordinate of the matrix.

4 shows an example of arranging an old version firmware array A and a new version firmware array B on a 10x11 matrix. In FIG. 4, it is assumed that the old version firmware array A is array A = [1, 3, 6, 2, 5, 7, 8, 9, 10], and the new version firmware array B is array B = [1. , 3, 4, 2, 6, 3, 5, 7, 6, 9, 10].

The edit script generation unit 103 generates diagonal lines by finding coordinates having the same value in the row of the new version firmware array B and the column of the old version firmware array A based on the new version firmware array B ( S235). That is, in the jth row, if the column having the same value as the jth row is the kth column, that is, the row and the column of the (j, k) coordinates have the same value. In this case, draw a diagonal line between the (j-1, k-1) and (j, k) coordinates.

5 shows an example of generating a diagonal line in the matrix. An example will be described with reference to FIG. 5. In the first row of the array B, the value is 1, and the array A with the code value of 1 is the first column. Thus, a diagonal line is drawn between the (0,0) and (1,1) coordinates. In the second row of the array B, the value is 3 and the array A with the value of 3 is the second column. Thus, a diagonal line is drawn between the (1,1) and (2,2) coordinates. In the fourth row of the array B, the value is 2, and the array A with the value of 2 is the fourth column. Thus, a diagonal line is drawn between the (3,3) and (4,4) coordinates. In the fifth row of array B, the value is 6, and array A with the value of 6 is the third column. Thus, a diagonal line is drawn between the (4,2) and (5,3) coordinates. After the sixth row, diagonal lines are drawn in the same way.

The edit script generation unit 103 derives the fastest path from the (0,0) coordinate of the matrix to the (m, n) coordinate (S237). The movement can only be done diagonally down, to the right, or to the bottom right, and all three directions assume the same distance. You can create an edit script using the fastest path. The path with the most diagonal lines is the fast path, and the longest diagonal line is called the longest common sequence (LCS). The ultimate goal is to find Shortest Edit Script (SES) with LCS, and the method of deriving SES, that is, the fastest path, is not particularly limited in the present invention and various conventional algorithms may be used.

6 exemplarily shows the result of deriving the fastest path from the (0,0) coordinate to the (m, n) coordinate of the matrix.

The edit script generation unit 103 generates the edit script by encoding the derived shortest path (S239). Starting at the (0,0) coordinates, the travel distance is added one by one each time moving diagonally down, to the right, or to the bottom right. Diagonal movement paths are not coded. The right moving path is indicated by (current moving distance + D) using the deletion code D. For example, if the third movement is a movement to the right, it is 3D. The downward movement path is indicated by the insertion code I, as (the current movement distance + I + the value of the row indicated by the moved position). For example, if the fourth movement moves downward, and the value of the row of the moved position is X, the value is 4IX. In this way, the coding is performed up to the (m, n) coordinates. The result is an edit script.

7 shows an example of creating an edit script. Referring to FIG. 7, the first diagonal shift, the second diagonal shift, the third downward shift, the fourth downward shift, the fifth diagonal shift, the sixth downward shift, and the seventh right shift from the (0,0) coordinate The shortest path to (m, n) coordinates is shown by, and the like.

For example, when moving to the 3rd down, the value of the 3rd row is 4, so it is displayed as 3I4. The seventh right shift is represented by 7D. Diagonal shifts are not coded. Thus, the final edit script is Edit Script = [3I4, 4I2, 6I3, 7D, 10I6, 11D]. D means Delete and I means Insert.

If there is a D in the edit script based on the array A, delete the value of the number before the D in the array A and treat the position of the value empty. If there is an I in the edit script, insert the value after I in the array (A). After this process, the array A is changed to the same as the array B as follows. The device 50 receives the edit script and performs a firmware update by changing the array A to the array B.

[1, 3, 6, 2, 5, 7, 8, 9, 10] => 3I4 => [1, 3, 4, 6, 2, 5, 7, 8, 9, 10]

[1, 3, 4, 6, 2, 5, 7, 8, 9, 10] => 4I2 => [1, 3, 4, 2, 6, 2, 5, 7, 8, 9, 10]

[1, 3, 4, 2, 6, 2, 5, 7, 8, 9, 10] => 6I3 => [1, 3, 4, 2, 6, 3, 2, 5, 7, 8, 9 , 10]

[1, 3, 4, 2, 6, 3, 2, 5, 7, 8, 9, 10] => 7D => [1, 3, 4, 2, 6, 3, (), 5, 7, 8, 9, 10]

[1, 3, 4, 2, 6, 3, (), 5, 7, 8, 9, 10] => 10I6 => [1, 3, 4, 2, 6, 3, (), 5, 7 , 6, 8, 9, 10]

[1, 3, 4, 2, 6, 3, (), 5, 7, 6, 8, 9, 10] => 11D => [1, 3, 4, 2, 6, 3, (), 5 , 7, 6, (), 9, 10]

Referring back to FIG. 2, the firmware server 10 transmits an edit script to the update device 50 (S24). In this case, the firmware server 10 compares the edit script capacity with the new version firmware capacity and exceeds the reference capacity. For example, when the firmware server 10 exceeds 80% of the new version firmware capacity, the firmware server 10 does not transmit the edit script. Send it. This is because the new version firmware recovery takes more time than the benefit of reducing the data transfer time due to the edit script transmission. The firmware server 10 transmits the edit script to the update device 50 through a predetermined update protocol when the edit script capacity is less than or equal to the reference capacity.

When the update device 50 receives the edit script, the update device 50 copies the old version firmware stored in the memory 505 to the buffer 507 and backs it up (S25). The update device 50 then deletes (flushes) the data of the region to be updated in the memory 505.

The update device 50 updates the old version firmware to the new version firmware using the edit script (S26). The firmware update unit 503 of the update device 50 copies the value from the beginning of the old version firmware array copied to the buffer 507 to the position indicated by the first code of the edit script, to the memory 505. If the edit script is "D", then the corresponding value of the old firmware is not copied. If the edit script is "I", the value corresponding to I is created in memory before the old version's firmware is copied into memory. In the same way, when the last code of the edit script is executed, a new version firmware is generated.

Referring to FIG. 7, the edit script is [3I4, 4I2, 6I3, 7D, 10I6, 11D], and the old version firmware array A is [1, 3, 6, 2, 5, 7, 8, 9, 10. ] Is assumed.

The firmware updater 503 copies the first and second values of the old version firmware of the buffer 507 to the memory 505 by the first code 3I4 of the edit script, and before copying the third value 6 to the memory 505. Produces 4 That is, [1, 3, 4] are stored in the memory 505. And 6 is the fourth value of array A. Next, edit script 4I2 generates 2 in memory 505 before copying the fourth value 6. That is, [1, 3, 4, 2] are stored in the memory 505. And 6 is the fifth value of array A. Next, by the edit script 6I3, the fifth value 6 is copied to the memory 505, and 3 is created in the memory 505 before the sixth value 2 is copied. That is, [1, 3, 4, 2, 6, 3] is stored in the memory 505. And 2 is the seventh value of array A. Next, by the edit script 7D, the seventh value 2 is not copied, and by the next edit script 10I6, the eighth and ninth values 5, 7 are copied into the memory 505, before the tenth value 8 is copied. Create 6 in memory 505. That is, [1, 3, 4, 2, 6, 3, 5, 7, 6] are stored in the memory 505. And 8 is the eleventh value of the array A. By the following edit script 11D, the eleventh value 8 is not copied, but the twelfth and thirteenth values 9 and 10 are copied into the memory 505. That is, [1, 3, 4, 2, 6, 3, 5, 7, 6, 9, 10] is stored in the memory 505. As a result, [1, 3, 4, 2, 6, 3, 5, 7, 6, 9, 10], which is the new version firmware array B, is generated in the memory 505.

8 is a view for explaining a firmware update method according to another embodiment of the present invention. Detailed description of the same parts as the embodiment of FIG. 2 will be omitted below.

Referring to FIG. 8, the firmware server 10 requests the current device firmware version information from the update device 50 (S31). The update device 50 transmits the current firmware version information (S32). In this case, the update device 50 may transmit its own buffer capacity information while transmitting the current firmware version information.

The embodiment of FIG. 2 should back up the old version firmware to buffer 507. Certain embedded systems may not use enough memory to reduce costs. Therefore, in the embodiment of FIG. 8, the edit script is transmitted and updated in block units.

If it is determined that the current firmware version of the update device 50 is an old version, the edit script generation unit 103 of the firmware server 10 generates an edit script by comparing the old version firmware with the new version firmware ( S33). Edit script generation has been described with reference to FIGS. 3 to 7.

The overflow script generation unit 105 of the firmware server 10 generates an overflow script (S34). The overflow script generator 105 generates an overflow script in which the number of edit scripts I is equal to the buffer size N of the update device 50, that is, the overflow position is recorded. The buffer size N may be a character unit when the firmware is a file, or may be a byte unit when the firmware is a binary file. The overflow script generation unit 105 compares the number of I and D from the beginning of the edit script, subtracts the number of D from the number of I, finds a position where the number of I is larger than N, and overflows this position once. Record as location. The overflow script generation unit 105 compares the number of I and D again in the overflow position 1, subtracts the number of D from the number of I, finds a position where the number of I is larger than N, and finds this position twice. Judging by the overflow position. This is done until the end of the edit script.

The firmware server 10 transmits the overflow script to the update device 50 (S35).

The firmware update unit 503 of the update device 50 secures an update space based on the overflow script (S36). The firmware updater 503 secures the space of the data to be inserted into the memory 505 in units of buffer size (N), and the space is read / write of the memory 505 in one operation. Set to page. In order to secure a stable space, a space reclamation operation is performed at the rear of the memory 505, and the old version firmware blocking by the overflow position is performed at the rear. If the block is between the overflow positions, the last block of the old version firmware is moved backward of the memory 505 by {overflow number x N}. The second block behind moves back the memory 505 by {(overflow count-1) x N}. That is, the k th block is moved backward of the memory 505 by {(overflow number-k) x N}. This space saving operation is performed for all blocks from k = 0 to k = b (b = number of blocks). Thereafter, the old version firmware is reconfigured using the edit script in units of blocks to update the new version firmware.

The update device 50 requests the edit script of the first block B1 of the old version firmware to the firmware server 10 (S37a).

After the firmware server 10 blocks the edit script, the firmware server 10 transmits the edit script of the first block B1 to the update device 50 through a predetermined update protocol (38a).

The firmware update unit 503 of the update device 50 copies the first block B1 of the old version firmware stored in the memory 505 into the buffer 507 (S39a), and the corresponding block B1 of the memory 505. Remove it. The update device 50 updates the first block B1 of the old version firmware to the new version firmware by using the edit script of the first block B1 (S40a). The update method has been described in the embodiment of FIG.

The same process as steps S37a to S40a is performed from the second block B2 to the last block Bk of the old version firmware. In FIG. 8, the process of updating the intermediate blocks is omitted, and steps S37k to S40k which are the process of updating the last block Bk are illustrated.

The update device 50 copies the memory at the back to the front to remove the free area from the front of the memory 505 to remove the free area resulting from the deletion.

In this embodiment, by performing the update operation for each block, the space required for the update can be reduced, and the safety of the update can be improved.

Embodiments of the present invention may be applied for fast firmware update in an environment in which communication is not smooth (for example, wireless). In addition, the embodiments of the present invention can be decrypted only by knowing the firmware file of the previous version, so that it can be used as one of the firmware update security methods.

While the present invention has been described with reference to exemplary embodiments, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims. Accordingly, the true scope of the present invention should be determined by the technical idea of the appended claims.

Claims (10)

A method for providing firmware to a device by a firmware server, the method comprising:
Generating an edit script describing the difference between the old version firmware and the new version firmware by orthogonally arranging the old version firmware and the new version firmware in an mxn matrix; And
And transmitting the edit script to the device. The method of claim 1, wherein the editing script generation step,
Defining an arrangement of the old version firmware and the new version firmware;
Arranging the old version firmware and the new version firmware in the mxn matrix;
Generating diagonal lines by finding coordinates of a new version firmware and an old version firmware value in the mxn matrix;
Deriving the shortest path from the (0,0) coordinates of the m-by-n matrix to the (m, n) coordinates; And
Encoding the shortest path; firmware providing method of a firmware server comprising a. The method of claim 2, wherein the encoding step,
And inserting a deletion code into a path moving to the right and inserting the insertion code into a path moving downward in the shortest path. The method of claim 1,
If the capacity of the edit script is greater than or equal to a reference capacity, transmitting the new version firmware directly to the device. The method of claim 1,
Requesting version information of a current firmware from the device; And
Receiving version information of the current firmware;
Generating the edit script if the current firmware version is an old version. The method of claim 3,
Generating an overflow script on which the buffer of the device overflows based on a result of comparing the number of deletion codes and insertion codes of the edit script and a buffer size of the device; And
Transmitting the overflow script to the device;
The sending of the edit script may include transmitting the edit script to the device in units of blocks so as to update the old version firmware blocked on the basis of the overflow script in units of blocks. How to Provide. In the method for the device to update the firmware,
Receiving, from a firmware server, an edit script describing the difference between the old version firmware and the new version firmware by orthogonally arranging the old version firmware and the new version firmware in an mxn matrix; And
Reconfiguring the old version firmware based on the edit script and updating the new version firmware to the new version firmware. The method of claim 7, wherein the firmware update step,
Copying the old version firmware stored in a memory into a buffer and flushing the memory; And
Copy the old version firmware to the memory, but do not copy the value associated with the delete code of the edit script to the memory, and insert the value associated with the insert code of the edit script into the corresponding region of the memory. Reconfiguring the firmware; firmware update method comprising a device. The method of claim 7, wherein before the step of receiving the edit script,
Receiving an overflow script that records a location at which a buffer of the device overflows based on a result of comparing the number of deletion codes and insertion codes of the edit script and a buffer size of the device; And
Dividing the old version firmware into block units based on the overflow position, and securing an update space in the memory;
And receiving the edit script in the block unit and reconfiguring the old version firmware in the block unit. The method of claim 7, wherein
Receiving version information of a current firmware from the firmware server; And
And transmitting version information of the current firmware.

Images