A method and system for evaluating programming speed
By calculating the ratio of theoretical to actual chip programming time, the time loss at each stage is quantified, solving the problem that users cannot judge the rationality of chip programming time, and realizing transparency and optimization of the programming process.
Patent Information
- Application Number
- CN202611332705.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-08-31
- Publication Date
- 2026-11-17
AI Technical Summary
Users cannot accurately determine whether the chip programming time is reasonable. Existing technology cannot distinguish the time consumption of each stage, resulting in the actual chip programming speed being far lower than its potential, especially when programming large amounts of data, the efficiency loss is severe.
A method for evaluating programming speed is provided. By calculating the theoretical programming time T1, the theoretical programming time T2, the algorithm programming time T3, and the actual programming time T4, the programming speed is evaluated using the ratios T1/T2, T2/T3, and T3/T4, and the time loss of each step is quantified.
Users can clearly understand the chip's true programming capabilities, identify bottlenecks, optimize the programming process, and improve efficiency.
Smart Images

Figure CN123114498A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of chip programming technology, and in particular to a method and system for evaluating programming speed. Background Technology
[0002] In the field of chip programming, when a user wants to program a new chip model, they need to submit an algorithm development application for the new chip model to a programming service provider. After the programming service provider completes the development, they deliver the chip programming algorithm to the user. The user can then use the chip programming algorithm to write or read data from the target chip (such as an MCU, eMMC, etc.). During the process of using the algorithm, the user only sees the total time spent in the entire programming process, but cannot judge whether this total time is reasonable, let alone know how fast the target chip can actually be programmed under ideal conditions.
[0003] In real-world scenarios, the time consumed during programming is caused by a variety of factors. For example, programming algorithms can only simulate the timing of the chip's communication interface as closely as possible, but cannot achieve the theoretical speed of the communication interface. This means that even if the interface speed is fixed, the actual processing time may far exceed the theoretical limit. Another example is that the data file to be programmed may contain many discontinuous address segments, with valid data divided into many small blocks interspersed with large blank spaces. This causes frequent address jumps during the programming process, generating significant additional protocol overhead and time consumption. Furthermore, the chip needs to write a series of configuration information during the programming process, and the configuration process itself also adds time.
[0004] However, existing technical solutions only provide a general total programming time, failing to differentiate the time consumed by each of the aforementioned stages, and also failing to inform users of the chip's theoretical programming speed limit. Without a comparison, even if the chip's actual programming speed is far below its potential, users are unlikely to notice, let alone request targeted optimization of the programming algorithm or data file layout. When programming extremely large amounts of data (e.g., programming tens of gigabytes of data to eMMC at once), the time wastage and efficiency loss caused by this lack of information are particularly pronounced. Summary of the Invention
[0005] Therefore, it is necessary to provide a method for evaluating programming speed to address the existing problems. This method can objectively evaluate programming speed, quantify the time loss caused by various factors, and help users understand the true programming capability of the chip and the bottlenecks in the actual programming process.
[0006] The specific plan is as follows: A method for evaluating programming speed, comprising the following steps: S100. Obtain the following information: The theoretical chip programming time T1 is the minimum time required for interface transmission and flash memory physical programming under full-load interface operation. The theoretical programming time T2 is the programming time used when applying a specific programming method. The chip algorithm programming time T3 is derived from the chip programming algorithm. The actual chip programming time T4 is the complete programming time under real-world conditions. S200. Calculate one or more of the following values: T1 / T2, T2 / T3, T3 / T4, T1 / T4. S300: The burning speed is evaluated using the value obtained from S200.
[0007] In one embodiment, in step S200, T1 / T2 reflects the time consumption of the selected programming method.
[0008] In one embodiment, T2 / T3 reflects the time loss caused by the performance of the programming algorithm.
[0009] In one embodiment, T3 / T4 reflects the additional time loss caused by the data file duty cycle and chip configuration.
[0010] In one embodiment, T1 / T4 reflects the total time loss from the theoretical limit to the final actual burning of the entire system.
[0011] In one embodiment, the specific calculation method for the theoretical chip programming time T1 includes: aligning the interface rate with the page programming time and block erase time of the flash memory to obtain the theoretical time consumption without any idle time or additional operations.
[0012] In one embodiment, the specific calculation method for the theoretical programming time T2 includes: based on the selected programming implementation method, adjusting the calculation method according to T1 to obtain the theoretical programming time T2.
[0013] In one embodiment, the specific calculation method for chip algorithm programming time T3 includes: combining the actual chip and chip programming algorithm, creating a specially customized data file. The total amount of effective data in the data file is exactly the same as that in the actual programming file, but the data is stored continuously in the address space, and no chip configuration operation is performed during programming. Using the customized data file, the target programming algorithm is run on the actual chip, and the measured time is the chip algorithm programming time T3.
[0014] In one embodiment, the specific calculation method for the actual chip programming time T4 includes: directly using the real data file to be programmed and the chip configuration information required by the user, performing the complete programming process on the real chip, and recording the total time from start to finish.
[0015] A programming speed evaluation system, comprising: The data acquisition module is used to acquire information from the burning speed evaluation method. The data calculation and evaluation module is used to calculate one or more of the following values based on the information obtained by the data acquisition module: T1 / T2, T2 / T3, T3 / T4, T1 / T4, and to evaluate the burning speed based on the calculated values.
[0016] The beneficial effects of this application are as follows: This application addresses the pain point of users being unable to perceive the true programming capabilities of a chip. Previously, programming service providers only offered one algorithm to complete the programming process, providing users with only a general total time consumption, making it impossible to determine whether this time consumption was reasonable. This invention upgrades the delivered chip programming algorithm from a single algorithm to a set of algorithms that can output four key metrics. This allows users to evaluate the programming process and subsequently improve it, thereby increasing programming efficiency.
[0017] Specifically, through the method described in this application, users can obtain four times with clear physical meaning: 1. By using the chip's theoretical programming time T1, users can obtain the fastest programming speed that the chip can achieve under physical limits and establish a theoretical reference benchmark.
[0018] 2. By using the theoretical burning time T2, users can clearly see the shortest time that can be theoretically achieved under the currently selected burning method, and intuitively see the proportion of theoretical time loss brought about by the burning method itself by the ratio of T1 to T2.
[0019] 3. By utilizing the chip algorithm programming time T3, users can independently measure the efficiency loss caused by the programming algorithm in terms of interface implementation and process overhead, after eliminating interference from data file layout and chip configuration, and intuitively understand the quality of algorithm implementation through the T2 / T3 ratio.
[0020] 4. By using the actual chip programming time T4, users can obtain the true total programming time. Through the ratios of T3 / T4 and T1 / T4, users can distinguish the additional overhead caused by data files and chip configuration information, as well as the efficiency of the entire programming system.
[0021] This allows users to establish a transparent and quantifiable understanding of programming time, identifying the time consumed by each of the four key stages: theoretical limits, method selection, algorithm implementation, and data and configuration. Low T2 / T3 ratios indicate significant room for improvement in the efficiency of the programming algorithm itself, which can be addressed by optimizing the chip programming algorithm. Low T3 / T4 ratios suggest optimizing the continuity of the data file or simplifying the chip configuration items. Attached Figure Description
[0022] Figure 1 This is a schematic diagram illustrating the factors determining the theoretical chip programming time T1 in an embodiment of this application.
[0023] Figure 2 This is a schematic diagram illustrating the factors determining the theoretical burning time T2 of the method in an embodiment of this application.
[0024] Figure 3 This is a schematic diagram illustrating the factors determining the chip algorithm programming time T3 in an embodiment of this application.
[0025] Figure 4 This is a schematic diagram illustrating the factors determining the actual chip programming time T4 in an embodiment of this application.
[0026] Figure 5 This is a schematic diagram illustrating the specific calculation method of the theoretical chip programming time T1 in an embodiment of this application.
[0027] Figure 6 This is a schematic diagram illustrating the specific calculation method of the theoretical burning time T2 in an embodiment of this application.
[0028] Figure 7 This is a schematic diagram illustrating the specific calculation method of chip algorithm programming time T3 in an embodiment of this application.
[0029] Figure 8 This is a schematic diagram illustrating the specific calculation method for the actual chip programming time T4 in an embodiment of this application. Detailed Implementation
[0030] To make the above-mentioned objects, features, and advantages of the present invention more apparent and understandable, specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Many specific details are set forth in the following description to provide a thorough understanding of the present invention. However, the present invention can be practiced in many other ways different from those described herein, and those skilled in the art can make similar modifications without departing from the spirit of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed below.
[0031] An embodiment of this application provides a method for evaluating programming speed, the method comprising: S100. Obtain the following information: The theoretical chip programming time T1 is the minimum time required for interface transmission and flash memory physical programming under full-load interface operation. The theoretical programming time T2 is the programming time used when applying a specific programming method. The chip algorithm programming time T3 is derived from the chip programming algorithm. The actual chip programming time T4 is the complete programming time under real-world conditions. S200. Calculate one or more of the following values: T1 / T2, T2 / T3, T3 / T4, T1 / T4. S300: The burning speed is evaluated using the value obtained from S200.
[0032] Specifically, the theoretical chip programming time T1 in step S100 is derived from the first simulation algorithm. This is the fastest programming time that the chip can physically achieve, representing the theoretical limit. It depends only on two hardware-determined factors: 1. Communication interface speed: For example, when programming an MCU, the maximum speed when writing byte by byte using the commonly used SWD protocol, or when programming an eMMC, the speed using SDR, DDR, HS200, HS400, etc.
[0033] 2. Chip flash memory characteristics: such as the programming time of a page inside the flash memory, the block erase time, and other inherent parameters determined by the chip design.
[0034] Both of these factors can be found in the chip reference manual or datasheet. The theoretical programming time of the chip is the minimum time necessary for interface transmission and flash memory physical programming, assuming the interface is operating at full capacity with no unnecessary operations. Factors determining the theoretical programming time T1 of the chip include... Figure 1 As shown.
[0035] Specifically, taking the eMMC chip specified in JESD84-B51 as an example, and using the HS400 mode with the highest communication interface speed, we will demonstrate the calculation formula of the first simulation algorithm.
[0036] Table 1
[0037] Based on the data in Table 1, the specific calculation method for T1 is as follows: (1), (2), (3).
[0038] Specifically, the theoretical programming time T2 in step S100 is derived from the second simulation algorithm. There may be multiple feasible programming methods for the same chip. For example, for an MCU, the bootloader can be downloaded to SRAM via the SWD interface first, and then the bootloader programs the Flash (ICP method); alternatively, data can be written directly to the Flash register via the SWD interface. For eMMC, four different methods can be chosen: SDR, DDR, HS200, and HS400. Different implementation methods have different programming times. In some scenarios, due to limitations in the user's final requirements, the theoretically fastest programming method cannot be used. The theoretical programming time depends on three factors: 1. Communication interface speed: Same as the theoretical programming time T1 of the chip.
[0039] 2. Flash memory characteristics: Same as the theoretical programming time T1 of the chip.
[0040] 3. Selected programming implementation method: Taking MCU as an example, there are ICP method and SWD interface operation to write to register; taking eMMC as an example, there are four different programming methods: SDR, DDR, HS200, and HS400. Among them, HS400 has the fastest programming speed. However, the HS400 method for eMMC cannot perform verification and read operations. Some factories must verify the chip according to their production process requirements, so they will not use this method.
[0041] T2, based on T1, incorporates the impact of the programming method itself on time. If the selected method happens to be the theoretically optimal implementation, then T2 can be equal to T1; otherwise, T2 will be greater than T1. The factors determining the theoretical programming time T2 are as follows: Figure 2 As shown.
[0042] Specifically, taking the eMMC chip specified in the JESD84-B51 protocol as an example, we will use four different programming methods specified in the protocol—SDR, DDR, HS200, and HS400—to demonstrate the calculation formula of the second simulation algorithm.
[0043] Table 2
[0044] Based on the data in Table 2, the specific method for calculating T2 is as follows: (4), (5), (6), In formula (4), Wmethod f method γ method It is determined by the programming method.
[0045] 1) In the SDR method, W method For 1 bit, 4 bits and 8 bits, f method 52MHz, γ method The value is 1.
[0046] 2) In the DDR method, W method For 4 bits and 8 bits, f method 52MHz, γ method The value is 2.
[0047] 3) In the HS200 method, W method For 4 bits and 8 bits, f method 200MHz, γ method The value is 1.
[0048] 4) In the HS400 method, W method For 8 bits, f method 200MHz, γ method The value is 2.
[0049] In formula (6), ρ is determined by the programming method. The eMMC chips specified by the JESD84-B51 protocol all support programming while transmitting data, i.e., ρ=1.
[0050] Specifically, the chip programming time T3 in step S100 is derived from the chip programming algorithm. After determining the programming implementation method, the programming algorithm will simulate the timing of the communication interface. However, in reality, due to the limitations of the programmer's hardware performance and the complexity of the communication interface, the actual programming algorithm can hardly achieve a perfect theoretical waveform when simulating the timing waveform of the communication interface, and there will inevitably be some implementation loss. This translates to better programming algorithms, where a better algorithm will have a timing sequence closer to the theoretical timing. Besides the limitations of simulating the communication interface timing, the actual programming process inevitably involves some unavoidable fixed time overhead, such as chip power-on, power-off, unlocking the Flash area, and status checks, all of which consume time.
[0051] The T3 consists of four components: communication protocol interface implementation, chip flash memory characteristics, selected programming implementation method, and programming time overhead.
[0052] 1. Communication Protocol Interface Implementation: In chip programming algorithms, the simulated communication interface timing waveform approaches the perfect theoretical waveform. Higher performance chip programming algorithms produce simulated interface timing waveforms that are closer to the perfect waveform.
[0053] 2. Chip flash memory characteristics: Same as point 2 of T1, and point 2 of T2.
[0054] 3. Selected burning method: Same as point 3 in T2.
[0055] 4. Fixed programming time overhead: During the chip programming process, additional operations will inevitably be performed in addition to writing or reading data, such as the time spent powering on the chip, the time spent unlocking the Flash area inside the chip before writing data, etc. These operations are unavoidable, otherwise programming cannot be performed.
[0056] It's important to distinguish here that "communication protocol interface implementation" refers to the actual simulation efficiency of the communication interface timing in the algorithm, which differs from the "communication interface rate" in T1 and T2, which represents the theoretical limit. T3 reflects the time consumed for ideal continuous data burning under a specific burning algorithm. It includes the overhead of algorithm implementation but does not include the additional time required for data file layout and chip configuration. The factors determining the chip algorithm burning time T3 are as follows: Figure 3 As shown.
[0057] Specifically, the actual chip programming time T4 in step S100 is derived from the chip programming algorithm. This is the complete programming time for the user in a real-world scenario. It adds two factors closely related to real-world scenarios to the various factors considered in T3: data file duty cycle and chip configuration time.
[0058] In real-world scenarios, the valid data in the programming files used by users is often not continuous. Taking eMMC programming as an example, the programming files used are huge, usually measured in GB, and cannot maintain all data continuity internally, containing numerous and large blank areas. Programmers typically skip these blank areas during the programming process; however, when there are many blank areas, frequent address segment jumps mean more protocol communication overhead, affecting the final programming time.
[0059] The components of T4 include: communication protocol interface implementation, chip flash memory characteristics, programming implementation method, programming fixed time overhead, data file duty cycle, and chip configuration time overhead, totaling six items. T4 is the total programming time that the user ultimately sees in the traditional solution.
[0060] 1. Communication protocol interface implementation: Same as point 1 of T3.
[0061] 2. Chip flash memory characteristics: Same as point 2 of T1, point 2 of T2, and point 2 of T3.
[0062] 3. Selected burning implementation method: Same as point 3 of T2, same as point 3 of T3.
[0063] 4. Fixed burning time overhead: Same as point 4 of T3.
[0064] 5. Data file page duty cycle: This refers to the distribution of valid data in the data file to be burned across the entire address range. If the valid data is concentrated and continuous, there will be fewer address jumps and less overhead; if the valid data is divided into multiple scattered segments with a large number of blank areas in between, repeated address jumps must be made during burning, significantly increasing the time consumption.
[0065] 6. Chip configuration time: The time spent on various configurations of the chip (such as option bytes, protection bits, peripheral initialization parameters, etc.) before or during programming.
[0066] Factors determining the actual programming time T4 of the chip, such as Figure 4 As shown.
[0067] With the four time points T1, T2, T3, and T4, a model for evaluating the burning speed can be established. The model analyzes the time loss caused by each step using the following ratios: 1. T1 / T2: Reflects the time consumption caused by the chosen programming method. The closer this value is to 1, the closer the selected programming implementation method is to the theoretical optimality.
[0068] 2. T2 / T3: Reflects the time loss caused by the performance of the programming algorithm, which is mainly determined by the interface implementation efficiency and fixed time overhead.
[0069] 3. T3 / T4: Reflects the additional time loss caused by the data file duty cycle and chip configuration.
[0070] 4. T1 / T4: Reflects the total time loss of the entire system from the theoretical limit to the final actual burning process. Users can use this to clearly judge how much efficiency potential the current burning solution still has.
[0071] The following details the calculation methods and corresponding algorithms for T1 to T4.
[0072] To obtain the aforementioned four times, this invention upgrades the delivered chip programming algorithm from a single programming algorithm to a set of programming algorithms capable of outputting four key time indicators. The algorithm set consists of at least a first simulation algorithm, a second simulation algorithm, and a chip programming algorithm, with the specific relationships as follows: 1. Calculation of T1: The first simulation algorithm takes the communication interface speed and the chip's flash memory characteristics as inputs, and calculates the theoretical programming time of the chip using a dedicated simulation theoretical time calculation method. This algorithm does not depend on the actual chip, but only on the parameters in the datasheet, and calculates the shortest programming time under theoretical conditions. For example, the algorithm will "granularly align" the interface speed with the flash memory's page programming time, block erase time, etc., to obtain the theoretical time consumption without any idle time or extra operations.
[0073] The method of obtaining T1 is as follows Figure 5 As shown.
[0074] 2. Calculation of T2: The second simulation algorithm, based on the communication interface rate and chip flash memory characteristics, adds a selected programming implementation method. According to the selected programming implementation method (e.g., ICP method and SWD register writing method in MCU programming, SDR, DDR, etc. in eMMC programming), the calculation method is adjusted based on T1 to obtain the theoretical programming time.
[0075] The method of obtaining T2 is as follows Figure 6 As shown.
[0076] 3. Calculation of T3: This requires combining the actual chip and the chip programming algorithm. A custom data file is created, containing the same total amount of valid data as the actual programming file, but with data stored contiguously in the address space. No chip configuration operations are performed during programming (to exclude configuration time). Using this custom file, the target programming algorithm is run on the actual chip, and the measured time is the chip algorithm programming time T3.
[0077] The method of obtaining T3 is as follows Figure 7 As shown.
[0078] 4. Calculation of T4: Using the actual data file to be programmed and the chip configuration information required by the user, the complete programming process is executed on the actual chip, and the total time from start to finish is recorded, which is the actual chip programming time T4.
[0079] The method of obtaining T4 is as follows Figure 8 As shown.
[0080] Unlike existing technologies that only provide one algorithm for programming, in this invention, the programming service provider, in addition to providing the programming algorithm, also provides the aforementioned first and second simulation algorithms for calculating T1 and T2. The simulation algorithms have two significant advantages: first, they are very simple, mainly focusing on the granular matching of communication interface speed and chip flash memory characteristics, thus their development and maintenance costs are extremely low; second, they do not require actual chip hardware and can be calculated instantly in an offline host computer environment. For chips in the same series (e.g., the STM32 series), only a few parameters need to be adjusted to reuse the same set of simulation algorithms, serving a large number of models.
[0081] This model allows users to clearly see for the first time how much time is determined by the chip's physical limitations, how much by the choice of programming method, how much by the algorithm implementation quality, and how much by data layout and configuration overhead, all within the existing programming environment and data file. A significantly low T2 / T3 ratio indicates substantial room for optimization in the programming algorithm; a low T3 / T4 ratio suggests considering optimizing the continuity of the data file or simplifying chip configuration items. This invention significantly improves the transparency of programming efficiency perception, providing clear guidance for various optimization activities.
[0082] Based on the above analysis, the method of this application has the following characteristics: 1. A set of chip programming algorithms for evaluating programming speed and four methods for obtaining programming time, the specific contents of which include: ① A first simulation algorithm for calculating the theoretical programming time T1 of the chip. This algorithm does not depend on the actual chip and takes the communication interface rate and the characteristics of the chip flash memory as input. ② A second simulation algorithm for calculating the theoretical programming time T2. This algorithm does not depend on the actual chip and takes the communication interface rate, chip flash memory characteristics and programming implementation method as inputs. ③ The chip programming algorithm and its associated continuous data file used to obtain the chip algorithm programming time T3; ④ The chip programming algorithm, actual data file, and chip configuration information used to obtain the actual chip programming time T4.
[0083] 2. Using the chip programming algorithm set and the four programming times obtained, an evaluation system is established using these four times, including one or more of T1 / T2, T2 / T3, T3 / T4, and T1 / T4. The ratio is used to quantify the loss of programming time caused by each step, and thereby identify the steps that can be optimized.
[0084] 3. To obtain the programming time T3, a special continuous data file is created, whose total effective data volume is equal to that of the actual file to be programmed. However, the special feature is that the data is stored completely continuously in the address space and no chip configuration operation is performed during the programming process.
[0085] 4. The first and second simulation algorithms for obtaining the programming times T1 and T2 are independent of the actual chip. For different chips, as long as their communication interface rate, chip flash memory characteristics and programming implementation methods are consistent, the same set of first and second simulation algorithms can be used.
[0086] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0087] The embodiments described above are merely illustrative of several implementations of the present invention, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the present invention, and these all fall within the protection scope of the present invention. Therefore, the protection scope of this invention patent should be determined by the appended claims.
Claims
1. A method for evaluating programming speed, characterized in that, include: S100. Obtain the following information: The theoretical chip programming time T1 is the minimum time required for interface transmission and flash memory physical programming under full-load interface operation. The theoretical programming time T2 is the programming time used when applying a specific programming method. The chip algorithm programming time T3 is derived from the chip programming algorithm. The actual chip programming time T4 is the complete programming time under real-world conditions. S200. Calculate one or more of the following values: T1 / T2, T2 / T3, T3 / T4, T1 / T4. S300: The burning speed is evaluated using the value obtained from S200.
2. The method for evaluating programming speed according to claim 1, characterized in that, In step S200, T1 / T2 reflects the time consumption of the selected programming method.
3. The method for evaluating programming speed according to claim 1, characterized in that, T2 / T3 reflects the time loss caused by the performance of the programming algorithm.
4. The method for evaluating programming speed according to claim 1, characterized in that, T3 / T4 reflects the additional time loss caused by the data file duty cycle and chip configuration.
5. The method for evaluating programming speed according to claim 1, characterized in that, T1 / T4 reflects the overall time loss from the theoretical limit to the final actual burning of the entire system.
6. The method for evaluating programming speed according to claim 1, characterized in that, The specific calculation method for the chip's theoretical programming time T1 includes: aligning the interface speed with the page programming time and block erase time of the flash memory to obtain the theoretical time consumption without any idle time or additional operations.
7. The method for evaluating programming speed according to claim 1, characterized in that, The specific calculation method for the theoretical burning time T2 includes: based on the selected burning implementation method, adjusting the calculation method on the basis of T1 to obtain the theoretical burning time T2.
8. The method for evaluating programming speed according to claim 1, characterized in that, The specific calculation method for chip algorithm programming time T3 includes: combining the actual chip and chip programming algorithm, creating a specially customized data file. The total amount of effective data in this data file is exactly the same as that in the real programming file, but the data is stored contiguously in the address space, and no chip configuration operation is performed during programming. Using this customized data file, the target programming algorithm is run on the real chip, and the measured time is the chip algorithm programming time T3.
9. The method for evaluating programming speed according to claim 1, characterized in that, The specific calculation method for the actual chip programming time T4 includes: directly using the actual data file to be programmed and the chip configuration information required by the user, executing the complete programming process on the actual chip, and recording the total time from start to finish.
10. A programming speed evaluation system, characterized in that, include: The data acquisition module is used to acquire the information in step S100 of the burning speed evaluation method according to any one of claims 1 to 9; The data calculation and evaluation module is used to calculate one or more of the following values based on the information obtained by the data acquisition module: T1 / T2, T2 / T3, T3 / T4, T1 / T4, and to evaluate the burning speed based on the calculated values.
