Time sequence adjusting method and device, equipment and medium

By obtaining and analyzing the timing resource reports and violation paths of the FPGA prototype version, and determining and adjusting the time division multiplexing path, the problem of timing violations in the FPGA prototype version is solved, and the timing convergence efficiency and production cycle are improved.

CN119067025APending Publication Date: 2024-12-03SHANDONG YUNHAI GUOCHUANG CLOUD COMPUTING EQUIP IND INNOVATION CENT CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411161615.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-22
Publication Date
2024-12-03

Smart Images

  • Figure CN119067025A_ABST
    Figure CN119067025A_ABST
Patent Text Reader

Abstract

The invention discloses a time sequence adjusting method, device and equipment and a medium, and relates to the field of integrated circuit design. When it is confirmed that the time sequence violation of the FPGA prototype version exists, re-segmentation iteration is not adopted, and the time sequence violation reason of the FPGA prototype version is determined by obtaining a time sequence resource report, a violation path reason and a netlist file corresponding to each FPGA prototype version of the time sequence violation; and determining newly added time division multiplexing paths based on the netlist file, performing pre-layout on the newly added time division multiplexing paths, determining an interconnection relationship, performing physical region constraint on time division multiplexing modules corresponding to the newly added time division multiplexing paths, and generating a project file after time sequence path adjustment to complete time sequence convergence. According to the scheme, the problem of time sequence violation is solved by adding and adjusting the off-chip interconnected time division multiplexing paths, the situation that the whole platform version needs to be segmented and iterated again due to individual path time sequence violation is avoided, and the time sequence convergence efficiency is greatly improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of integrated circuit design, and in particular to a timing adjustment method, device, equipment and medium. Background Art

[0002] Field Programmable Gate Array (FPGA) prototype plays a key role in the design and verification of Application Specific Integrated Circuit (ASIC); it provides a verification platform for simulating the behavior of ASIC, helping hardware and software developers improve their work efficiency. As the complexity of ASIC design increases, the resource requirements of FPGA prototypes are also increasing, and multiple FPGAs are usually required to build a prototype platform.

[0003] FPGA prototype production is the process of adapting ASIC design to multiple FPGAs, which mainly includes steps such as compilation, segmentation, mapping, timing convergence and bit file generation. Among them, timing convergence is the difficulty of multi-chip prototype platforms, and each FPGA must meet the timing requirements. If the timing of one FPGA is not met, the segmentation strategy and resource configuration need to be modified, and the entire process needs to be redone, which is very time-consuming. In traditional prototype production, it mainly relies on the experience of engineers and multiple attempts at segmentation; however, even if the timing violation is small, it still needs to be re-segmented, which increases the uncertainty of the production cycle and easily delays subsequent verification work.

[0004] In view of the above problems, how to solve the problem that in the current FPGA prototype version production, every time the FPGA has a timing violation, it needs to be re-segmented, which is inefficient and is an urgent problem to be solved by technicians in this field. Summary of the invention

[0005] The purpose of the present invention is to provide a timing adjustment method, device, equipment and medium to solve the problem of low efficiency in the current FPGA prototype version production, in which every time a timing violation occurs in the FPGA, the FPGA needs to be re-segmented.

[0006] In order to solve the above technical problems, the present invention provides a timing adjustment method, comprising:

[0007] When there is a field programmable gate array prototype version whose timing cannot converge, obtain a timing resource report, a violation path reason and a netlist file corresponding to each field programmable gate array prototype version whose timing cannot converge; wherein the timing resource report contains at least data on congestion, high fan-out, wiring density and resource utilization;

[0008] Mapping the timing resource report and the violation path cause to the corresponding netlist file, so as to mark the timing information corresponding to the prototype version of the field programmable gate array in the netlist file;

[0009] Determine a newly added time-division multiplexing path according to the netlist file, and pre-layout the newly added time-division multiplexing path;

[0010] Generating each of the newly added time-division multiplexing paths based on each of the netlist files, and determining the interconnection relationship of each of the newly added time-division multiplexing paths in each of the netlist files;

[0011] Physical area constraints are performed on the time division multiplexing modules corresponding to each of the newly added time division multiplexing paths, and an engineering file after the timing path adjustment is generated to complete timing closure.

[0012] On the one hand, before obtaining the timing resource report, violation path reason and netlist file corresponding to each of the field programmable gate array prototype versions whose timing cannot converge, the method further includes:

[0013] configuring each of the field programmable gate array prototype versions;

[0014] Determining whether configuration of all the field programmable gate array prototype versions is completed;

[0015] If the configuration of all the field programmable gate array prototype versions is not completed, returning to the step of configuring each field programmable gate array prototype version;

[0016] If configuration of all the field programmable gate array prototype versions is completed, determining whether there is a field programmable gate array prototype version whose timing cannot converge;

[0017] If the timing of the field programmable gate array prototype version cannot be converged, a bitstream file is generated and a platform adaptation operation is performed to complete the production of the field programmable gate array prototype version;

[0018] If there is a field programmable gate array prototype version whose timing cannot converge, determine whether the resource occupancy rates of all field programmable gate array prototype versions whose timing cannot converge are not greater than a first threshold, and whether the corresponding maximum setup time violation or maximum hold time violation is not less than a second threshold;

[0019] If the resource occupancy rate of the field programmable gate array prototype version whose timing cannot converge is greater than a first threshold, and / or the corresponding maximum setup time violation or maximum hold time violation is less than a second threshold, then the system clock frequency is reduced or the resource allocation of each field programmable gate array prototype version is adjusted, and each field programmable gate array prototype version is split again;

[0020] If the resource occupancy rates of all the field programmable gate array prototype versions whose timing cannot converge are not greater than the first threshold, and the corresponding maximum setup time violation or maximum hold time violation are not less than the second threshold, then the step of obtaining the timing resource report, violation path cause and netlist file corresponding to each of the field programmable gate array prototype versions whose timing cannot converge is entered.

[0021] On the other hand, obtaining the timing resource report and the violation path cause corresponding to each of the field programmable gate array prototype versions whose timing cannot converge, includes:

[0022] Acquire data of congestion, high fan-out, routing density and resource utilization of each of the field programmable gate array prototype versions to obtain the timing resource report;

[0023] Obtaining a timing report of each of the field programmable gate array prototype versions, and deriving a corresponding timing violation path based on each of the timing reports;

[0024] Each of the timing violation paths is analyzed to determine the cause of the violation path.

[0025] On the other hand, mapping the timing resource report and the violation path cause to the corresponding netlist file to mark the timing information corresponding to the field programmable gate array prototype version in the netlist file includes:

[0026] Mapping the data of congestion, high fan-out, routing density and resource utilization of each field programmable gate array prototype version to the corresponding netlist file at the chip level;

[0027] Marking each of the timing violation paths and its corresponding time division multiplexing module into the corresponding netlist file;

[0028] According to each of the violation path causes, high fan-out register information on the timing violation path based on the high fan-out is copied.

[0029] On the other hand, determining a newly added time-division multiplexing path according to the netlist file and pre-layout the newly added time-division multiplexing path includes:

[0030] According to each of the netlist files and the register information, determining whether the resource utilization rate of the time division multiplexing position adjacent to the timing violation path is lower than a third threshold;

[0031] If not, the next position adjacent to the time division multiplexing position is used as the new time division multiplexing position adjacent to the timing violation path, and the process returns to the step of determining whether the resource utilization rate of the time division multiplexing position adjacent to the timing violation path is lower than a third threshold value according to each of the netlist files and the register information;

[0032] If yes, determining the newly added time division multiplexing path according to the time division multiplexing position;

[0033] Instantiate time division multiplexing related modules according to the time division multiplexing positions and their quantities; wherein the related modules at least include a clock module, a multiplexer, a demultiplexer, a receiving buffer, a sending buffer and a data encoding and decoding module;

[0034] A constraint statement of the time division multiplexing module corresponding to the newly added time division multiplexing path is written according to the time division multiplexing position and the netlist file.

[0035] On the other hand, generating each of the newly added time-division multiplexing paths based on each of the netlist files, and determining the interconnection relationship of each of the newly added time-division multiplexing paths in each of the netlist files, includes:

[0036] Determining whether the timing violation of the timing violation path is caused by high fan-out;

[0037] If so, maintaining the timing violation path;

[0038] If not, the timing violation path is disconnected.

[0039] On the other hand, after physically constraining the time division multiplexing modules corresponding to each of the newly added time division multiplexing paths and generating the engineering file after the timing path adjustment, the method further includes:

[0040] Generate a bitstream file and perform platform adaptation operations to complete the production of the field programmable gate array prototype version;

[0041] Generates a log containing information about the timing violation handling process.

[0042] In order to solve the above technical problems, the present invention further provides a timing adjustment device, comprising:

[0043] An acquisition module is used to acquire a timing resource report, a violation path reason and a netlist file corresponding to each field programmable gate array prototype version whose timing cannot converge when there is a field programmable gate array prototype version whose timing cannot converge; wherein the timing resource report at least includes data on congestion, high fan-out, wiring density and resource utilization;

[0044] A mapping module, used for mapping the timing resource report and the violation path cause to the corresponding netlist file, so as to mark the timing information corresponding to the prototype version of the field programmable gate array in the netlist file;

[0045] A determination module, used to determine a newly added time-division multiplexing path according to the netlist file, and pre-layout the newly added time-division multiplexing path;

[0046] A generating module, used to generate each of the newly added time-division multiplexing paths based on each of the netlist files, and determine the interconnection relationship of each of the newly added time-division multiplexing paths in each of the netlist files;

[0047] The constraint module is used to perform physical area constraints on the time division multiplexing modules corresponding to each of the newly added time division multiplexing paths, and generate an engineering file after the timing path is adjusted to complete timing convergence.

[0048] In order to solve the above technical problems, the present invention further provides a timing adjustment device, comprising:

[0049] Memory for storing computer programs;

[0050] A processor is used to implement the steps of the above-mentioned timing adjustment method when executing the computer program.

[0051] In order to solve the above technical problem, the present invention also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the above timing adjustment method are implemented.

[0052] The present invention provides a method for obtaining timing resource reports, violation path reasons and netlist files corresponding to each field programmable gate array prototype version whose timing cannot converge when there is a field programmable gate array prototype version whose timing cannot converge; wherein the timing resource report at least contains data on congestion, high fan-out, wiring density and resource utilization; mapping the timing resource report and the violation path reasons to the corresponding netlist file, so as to mark the timing information of the corresponding field programmable gate array prototype version in the netlist file; determining a newly added time-division multiplexing path according to the netlist file, and pre-layout the newly added time-division multiplexing path; generating each newly added time-division multiplexing path based on each netlist file, and determining the interconnection relationship of each newly added time-division multiplexing path in each netlist file; performing physical area constraints on the time-division multiplexing modules corresponding to each newly added time-division multiplexing path, and generating an engineering file after the timing path is adjusted, so as to complete the timing convergence.

[0053] The beneficial effect of the present invention is that when it is confirmed that the timing of the FPGA prototype version cannot converge, the method of re-segmentation and iteration is not adopted, but the timing resource report, violation path reason and netlist file corresponding to each FPGA prototype version that cannot converge the timing are obtained, so as to clarify the timing violation reason of the FPGA prototype version; further based on the netlist file containing the timing violation reason, the newly added time-division multiplexing path is determined, and after the newly added time-division multiplexing path is pre-layouted and the interconnection relationship is determined, the time-division multiplexing module corresponding to each newly added time-division multiplexing path is physically constrained, and the engineering file after the timing path adjustment is generated to complete the timing convergence. In this way, the scheme achieves the solution of congestion, too long timing path, high fan-out and other timing violation problems by increasing and adjusting the time-division multiplexing path of off-chip interconnection, avoiding the need for the entire platform version to be re-segmented and iterated due to the timing violation of individual paths, greatly improving the efficiency of timing convergence, and accelerating the production cycle of the FPGA prototype version.

[0054] In addition, the present invention also provides a timing adjustment device, equipment and medium, with the same effects as above. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] In order to more clearly illustrate the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0056] Figure 1 A flowchart of making a traditional FPGA prototype version provided by an embodiment of the present invention;

[0057] Figure 2 A flowchart of a timing adjustment method provided by an embodiment of the present invention;

[0058] Figure 3 A flowchart for making an optimized FPGA prototype version provided by an embodiment of the present invention;

[0059] Figure 4 A schematic diagram of an FPGA prototype platform before and after timing adjustment provided by an embodiment of the present invention;

[0060] Figure 5 A schematic diagram of a timing adjustment device provided by an embodiment of the present invention;

[0061] Figure 6 A schematic diagram of a timing adjustment device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0062] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0063] The core of the present invention is to provide a timing adjustment method, device, equipment and medium to solve the problem of low efficiency in the current FPGA prototype version production, in which every time a timing violation occurs in the FPGA, the FPGA needs to be re-segmented.

[0064] In order to enable those skilled in the art to better understand the solution of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0065] Figure 1 The flowchart of the traditional FPGA prototype version production provided by the embodiment of the present invention. Figure 1 As shown in the figure, in order to realize the production of FPGA prototype version, the register transfer level code (RTL) source file of ASIC chip is imported into the electronic design automation (EDA) tool for compilation to diagnose the design file and add debugging analysis probes to complete the circuit design compilation. Next, pre-segmentation is performed according to the needs of the prototype platform user to automatically segment the design. Then, the design is segmented according to the interconnection relationship of each chip obtained in the previous step. After that, the system wiring and system generation are completed through the EDA tool. This step is mainly carried out according to the timing requirements. Then, each FPGA is subjected to circuit synthesis steps such as synthesis compilation, pre-mapping and mapping. The Vivado tool is used for layout and routing, and the goal is to complete the timing convergence of the FPGA, which may require trying different strategies. It can be understood that the Vivado tool is an EDA tool for FPGA design. It provides a complete design process from design input, synthesis, layout and routing to verification and simulation. The Vivado tool has a highly integrated design environment and a new generation of tools from system to chip level, which are all based on a shared scalable data model and a common debugging environment. Its main functions include RTL code writing, functional simulation, synthesis and implementation. The goal of the Vivado tool is to help hardware designers reduce compilation time and design iterations while providing more accurate power estimates.

[0066] In the specific implementation, if the timing convergence cannot be completed, it is necessary to readjust the parameters such as resource allocation and clock frequency of each chip, which requires the experience and multiple attempts of engineers, and may require re-pre-segmentation, segmentation, system wiring, system generation, comprehensive compilation, pre-mapping, mapping, Vivado layout and wiring and other links, which is time-consuming and cannot guarantee timing convergence. Finally, when the timing of all FPGAs converges and generates a bit file, the prototype version is completed. If the timing of one of the FPGAs is not satisfied or fails to be implemented, it is necessary to adjust appropriately and repeat the above process. It can be seen that the traditional FPGA prototype version production method consumes a lot of time for the producer, and the version production time is uncertain, which is very likely to cause delays for the subsequent prototype verification personnel. In order to solve the above problems, the present invention provides a timing adjustment method.

[0067] Figure 2 A flowchart of a timing adjustment method provided by an embodiment of the present invention. Figure 2 As shown, the method includes:

[0068] S10: When there are FPGA prototype versions whose timing cannot be converged, obtaining a timing resource report, a violation path reason, and a netlist file corresponding to each FPGA prototype version whose timing cannot be converged.

[0069] The timing resource report at least includes data on congestion, high fan-out, routing density, and resource utilization.

[0070] During the FPGA prototype version production process, when it is confirmed that the timing of some FPGA prototype versions cannot converge and there are timing violations, the timing resource report, violation path reasons and netlist files corresponding to each FPGA prototype version whose timing cannot converge are obtained.

[0071] It should be noted that the timing resource report contains at least data on congestion, high fan-out, routing density, and resource utilization. Congestion, high fan-out, routing density, and resource utilization are four important concepts that describe the implementation of the design inside the FPGA and directly affect the timing performance and resource utilization efficiency of the design. Specifically, congestion refers to the situation where the routing resources inside the FPGA are insufficient, resulting in a long routing path or inability to route through. Congestion usually occurs in areas of the design that require large routing resources, such as high-speed interfaces and complex logic. Congestion will increase signal delays, which in turn affects the timing performance of the design. High fan-out refers to the connection of the output of a signal or module to the inputs of multiple other signals or modules. High fan-out will reduce the driving capability of the signal and increase the delay and power consumption of the signal. In FPGA design, high fan-out usually needs to be solved by adding buffers or using dedicated routing resources. Routing density refers to the degree of use of routing resources inside the FPGA. A higher routing density means that routing resources are used more fully, but it also increases the risk of congestion. In FPGA design, it is necessary to reasonably plan the use of routing resources according to the design requirements and FPGA resource characteristics to balance the relationship between routing density and timing performance. Resource utilization refers to the ratio of FPGA logic resources used by the design to the total FPGA resources. A higher resource utilization means that the design makes full use of the FPGA's logic resources, but it also increases the difficulty and risk of design implementation. In FPGA design, it is necessary to reasonably plan the use of logic resources according to the design requirements and FPGA resource characteristics to balance the relationship between resource utilization and design implementation difficulty.

[0072] In addition, the netlist file is a description file of the logical structure of the FPGA design. It is generated after performing synthesis in FPGA design tools such as Vivado. The netlist file consists of cells, pins, ports, and networks. It contains the connection relationship and attribute information between the various logic units in the design. The netlist file is an important intermediate product in FPGA design. It is used for subsequent layout and routing, timing analysis, and programming download steps. Through the netlist file, the FPGA design tool can determine how the design is implemented inside the FPGA and generate the corresponding bitstream file for configuring the FPGA.

[0073] In this embodiment, there is no restriction on the process of obtaining the timing resource report and the violation path reason, which depends on the specific implementation situation.

[0074] S11: Map the timing resource report and the violation path reason to the corresponding netlist file, so as to mark the timing information of the corresponding field programmable gate array prototype version in the netlist file.

[0075] Further, the timing resource report and the violation path cause are mapped to the corresponding netlist file, so as to mark the timing information of the corresponding FPGA prototype version in the netlist file, thereby obtaining multiple FPGA netlist files containing the timing information of the FPGA prototype version. In this embodiment, the specific process of mapping the timing resource report and the violation path cause to the corresponding netlist file is not limited and depends on the specific implementation situation.

[0076] S12: Determine a newly added time-division multiplexing path according to the netlist file, and pre-layout the newly added time-division multiplexing path.

[0077] After obtaining the netlist file that maps the timing resource report and the cause of the violation path, it is necessary to analyze some key information of the FPGA prototype version based on the relevant information in the netlist file to determine the newly added time-division multiplexing path. It is worth noting that the newly added time-division multiplexing path is a supplement to the original time-division multiplexing path in the FPGA prototype platform version; by adding a new time-division multiplexing path, the problem of the current FPGA prototype version timing not being able to converge can be solved. After determining the newly added time-division multiplexing path, in order to configure the newly added time-division multiplexing path, it is also necessary to pre-layout the newly added time-division multiplexing path.

[0078] In this embodiment, there is no restriction on the determination method and pre-layout process of the newly added time division multiplexing path, which depends on the specific implementation situation.

[0079] S13: Generate each newly added time-division multiplexing path based on each netlist file, and determine the interconnection relationship of each newly added time-division multiplexing path in each netlist file.

[0080] S14: Physically constraining the time division multiplexing modules corresponding to each newly added time division multiplexing path, and generating an engineering file after the timing path is adjusted to complete timing convergence.

[0081] Furthermore, the newly determined time-division multiplexing paths are generated in all netlist files, and the interconnection relationship of each newly added time-division multiplexing path is determined in each netlist file. The time-division multiplexing modules corresponding to each newly added time-division multiplexing path are constrained by physical blocks (Pblocks). In FPGA design, Pblock is a constraint method for defining physical areas, which allows designers to specify specific areas inside the FPGA chip to implement specific logic functions or meet specific layout and routing requirements. By using Pblock constraints, designers can better control the layout and routing process of the design and improve the timing performance and resource utilization efficiency of the design. Finally, generate the engineering file after the timing path adjustment, that is, the Vivado engineering file, to complete the timing convergence.

[0082] In this embodiment, when it is confirmed that the timing of the FPGA prototype version cannot converge, the method of re-segmentation and iteration is not adopted, but the timing resource report, violation path reason and netlist file corresponding to each FPGA prototype version that cannot converge timing are obtained, so as to clarify the timing violation reason of the FPGA prototype version; further based on the netlist file containing the timing violation reason, the newly added time-division multiplexing path is determined, and after the newly added time-division multiplexing path is pre-layouted and the interconnection relationship is determined, the time-division multiplexing module corresponding to each newly added time-division multiplexing path is physically constrained, and the engineering file after the timing path adjustment is generated to complete the timing convergence. In this way, the scheme solves the timing violation problems such as congestion, too long timing path, and high fan-out by adding and adjusting the time-division multiplexing path of off-chip interconnection, avoiding the need for the entire platform version to be re-segmented and iterated due to the timing violation of individual paths, greatly improving the efficiency of timing convergence, and accelerating the production cycle of the FPGA prototype version.

[0083] Based on the above embodiments, in some embodiments, before obtaining the timing resource report, violation path reason and netlist file corresponding to each field programmable gate array prototype version whose timing cannot be converged, the method further includes:

[0084] S101: configuring each field programmable gate array prototype version;

[0085] S102: Determine whether the configuration of all FPGA prototype versions is completed; if not, return to step S101; if yes, proceed to step S103:

[0086] S103: Determine whether the timing of the field programmable gate array prototype version cannot converge; if not, proceed to step S104; if so, proceed to step S105;

[0087] S104: Generate a bitstream file and perform platform adaptation operations to complete the production of a field programmable gate array prototype version;

[0088] S105: Determine whether the resource occupancy rates of all FPGA prototype versions whose timing cannot converge are not greater than the first threshold, and whether the corresponding maximum setup time violation or maximum hold time violation is not less than the second threshold; if not, proceed to step S106; if yes, proceed to step S10;

[0089] S106: Lowering the system clock frequency or adjusting resource allocation of each FPGA prototype version, and re-segmenting each FPGA prototype version.

[0090] Figure 3 Flowchart of the optimized FPGA prototype version provided by the embodiment of the present invention. In order to avoid multiple re-segmentation iterations, such as Figure 3 As shown, this solution configures all FPGA prototype versions first, and then determines whether the timing cannot converge. It can be understood that the configuration of the FPGA prototype version specifically includes operations such as comprehensive compilation, pre-mapping, mapping, and placement and routing.

[0091] In a specific implementation, it is determined in real time whether the configuration of all FPGA prototype versions is completed. If the configuration of all FPGA prototype versions is not completed, it returns to the step of configuring each FPGA prototype version; if the configuration of all FPGA prototype versions is completed, it is determined whether there is any FPGA prototype version whose timing cannot converge.

[0092] If there is no FPGA prototype version whose timing cannot converge, a bitstream file is generated and a platform adaptation operation is performed to complete the production of the FPGA prototype version. If there is an FPGA prototype version whose timing cannot converge, the multi-chip collaborative timing violation path integration process is started. Specifically, it is determined whether the resource occupancy rate of all FPGA prototype versions whose timing cannot converge is not greater than the first threshold, and the corresponding maximum setup time violation or maximum hold time violation is not less than the second threshold. This embodiment does not impose any restrictions on the first threshold and the second threshold. For example, the first threshold can be set to 50% and the second threshold can be set to -2ns. Then, it is determined whether the resource occupancy rate of all FPGA prototype versions whose timing cannot converge is not greater than 50%, and the corresponding maximum setup time violation or maximum hold time violation is not less than -2ns.

[0093] If the resource occupancy rate of the FPGA prototype version whose timing cannot be converged is greater than the first threshold, and / or the corresponding maximum setup time violation or maximum hold time violation is less than the second threshold, it is considered that the threshold for multi-chip collaborative processing is not met at this time, and it is still necessary to re-split and iterate to eliminate the timing violation: reduce the system clock frequency or adjust the resource allocation of each FPGA prototype version, and re-split each FPGA prototype version. If the resource occupancy rate of all FPGA prototype versions whose timing cannot be converged is not greater than the first threshold, and the corresponding maximum setup time violation or maximum hold time violation is not less than the second threshold, it is considered that the threshold for multi-chip collaborative processing is met at this time, and the step of obtaining the timing resource report, violation path cause and netlist file corresponding to each FPGA prototype version whose timing cannot be converged is entered, so as to eliminate the timing violation by adding a time-division multiplexing path.

[0094] Based on the above embodiments, in some embodiments, obtaining the timing resource report and the violation path reason corresponding to each field programmable gate array prototype version whose timing cannot converge includes:

[0095] S107: Obtain data on congestion, high fan-out, routing density, and resource utilization of each field programmable gate array prototype version to obtain a timing resource report;

[0096] S108: Obtaining a timing report of each field programmable gate array prototype version, and deriving a corresponding timing violation path based on each timing report;

[0097] S109: Analyze each timing violation path to determine the cause of the violation path.

[0098] In the specific implementation, in order to obtain the timing resource report and the cause of the violation path, the data of congestion, high fan-out, wiring density and resource utilization of each FPGA prototype version are obtained to obtain the timing resource report; the timing report of each FPGA prototype version is obtained, specifically the timing report generated by the Vivado tool, and the corresponding timing violation path is derived based on each timing report. Finally, each timing violation path is analyzed to determine the cause of the violation path. In this way, the acquisition of the timing resource report and the cause of the violation path is realized.

[0099] Based on the above embodiments, in some embodiments, the timing resource report and the violation path cause are mapped to the corresponding netlist file, so as to mark the timing information of the corresponding field programmable gate array prototype version in the netlist file, including:

[0100] S111: Mapping the data of congestion, high fan-out, wiring density and resource utilization of each field programmable gate array prototype version to a corresponding netlist file at the chip level;

[0101] S112: marking each timing violation path and its corresponding time division multiplexing module into a corresponding netlist file;

[0102] S113 copies the high fan-out register information on the timing violation path based on the high fan-out according to the cause of each violation path.

[0103] In order to realize the mapping of the netlist file, in the specific implementation, the congestion, high fan-out, wiring density and resource utilization data of each FPGA prototype version are mapped to the corresponding netlist file according to the slice level (SLICE). It should be noted that in FPGA, SLICE (Slice Logic Cell) is the basic logic unit used to implement combinational logic and sequential logic. The slice level refers to the logic resource level inside the FPGA chip, that is, the SLICE level. This level of resources is the smallest configurable logic block in the FPGA, usually composed of a lookup table (LUT), a flip-flop (Flip-Flop), a multiplexer (MUX) and some other logic gates. In FPGA design, slice-level design refers to the process of designing and optimizing directly on the logic resources inside the FPGA chip.

[0104] Furthermore, each timing violation path and its corresponding time-division multiplexing module are extracted and annotated into the corresponding netlist file. Finally, according to the cause of each violation path, the high fan-out register information on the timing violation path based on high fan-out is copied. In this way, the mapping of timing resource report and violation path cause to netlist file is realized.

[0105] On the basis of the above embodiments, in some embodiments, determining a newly added time-division multiplexing path according to a netlist file and pre-layout the newly added time-division multiplexing path includes:

[0106] S121: judging whether the resource utilization rate of the time-division multiplexing position adjacent to the timing violation path is lower than a third threshold value according to each netlist file and register information; if not, proceeding to step S122; if yes, proceeding to step S123;

[0107] S122: taking the next position adjacent to the time division multiplexing position as a new time division multiplexing position adjacent to the timing violation path, and returning to step S121;

[0108] S123: Determine a newly added time division multiplexing path according to the time division multiplexing position;

[0109] S124: Instantiate time division multiplexing related modules according to the time division multiplexing positions and their quantities;

[0110] Among them, the relevant modules at least include a clock module, a multiplexer, a demultiplexer, a receiving buffer, a transmitting buffer and a data encoding and decoding module;

[0111] S125: Compile constraint statements of the time division multiplexing module corresponding to the newly added time division multiplexing path according to the time division multiplexing position and the netlist file.

[0112] In order to determine the newly added time-division multiplexing path and pre-layout it, in the specific implementation, it is determined whether the resource utilization rate of the time-division multiplexing position adjacent to the timing violation path is lower than the third threshold value according to each netlist file and register information. In this embodiment, there is no restriction on the size of the third threshold value, for example, it can be set to 20%, depending on the specific implementation situation.

[0113] If the resource utilization rate of the time division multiplexing position adjacent to the timing violation path is not lower than the third threshold, it is considered that the time division multiplexing position adjacent to the timing violation path does not support the newly added time division multiplexing path, and the next position adjacent to the time division multiplexing position needs to be used as a new time division multiplexing position adjacent to the timing violation path, and return to step 121 to re-judge. If the resource utilization rate of the time division multiplexing position adjacent to the timing violation path is lower than the third threshold, it is considered that the time division multiplexing position adjacent to the timing violation path supports the newly added time division multiplexing path, and the newly added time division multiplexing path is determined according to the time division multiplexing position.

[0114] Further, according to the time-division multiplexing position and its number, the time-division multiplexing related modules are instantiated. It should be noted that the related modules at least include a clock module (all time-division multiplexing transmission rates on the FPGA prototype version are the same, so the clock generation module does not need to be instantiated again, and the clock signal can be connected to the newly instantiated module), a multiplexer, a demultiplexer, a receiving buffer, a transmitting buffer and a data encoding and decoding module. Finally, according to the time-division multiplexing position and the netlist file, the constraint statements of the time-division multiplexing module corresponding to the newly added time-division multiplexing path are written to facilitate the generation of the newly added time-division multiplexing path. It should be noted that the transmission rate of the newly added time-division multiplexing path must be consistent with the transmission rate of the original time-division multiplexing path. In this way, the determination and pre-layout of the newly added time-division multiplexing path are realized.

[0115] On the basis of the above embodiments, in some embodiments, each newly added time-division multiplexing path is generated based on each netlist file, and the interconnection relationship of each newly added time-division multiplexing path is determined in each netlist file, including:

[0116] S131: Determine whether the timing violation of the timing violation path is caused by high fan-out; if so, proceed to step S132; if not, proceed to step S133;

[0117] S132: maintain timing violation path;

[0118] S133: Disconnect the timing violation path.

[0119] After the newly added time-division multiplexing paths are obtained, each newly added time-division multiplexing path is generated based on each netlist file. In the specific implementation, it is also necessary to consider whether the newly added time-division multiplexing path overlaps with the original time-division multiplexing path.

[0120] Specifically, determine whether the timing violation of the timing violation path of the FPGA prototype version is caused by high fan-out; if it is confirmed that the timing violation of the timing violation path of the FPGA prototype version is caused by high fan-out, there is no need to disconnect the original timing violation path; if it is confirmed that the timing violation of the timing violation path of the FPGA prototype version is not caused by high fan-out, it is necessary to disconnect the original timing violation path to ensure the normal operation of the newly added time-division multiplexing path.

[0121] Based on the above embodiments, in some embodiments, after physically constraining the time division multiplexing modules corresponding to each newly added time division multiplexing path and generating the engineering file after the timing path adjustment, it also includes:

[0122] S15: Generate a bitstream file and perform platform adaptation operations to complete the production of a field programmable gate array prototype version;

[0123] S16: Generate a log containing information about the timing violation processing process.

[0124] In the specific implementation, after the time-division multiplexing modules corresponding to each newly added time-division multiplexing path are physically constrained and the engineering file after the timing path adjustment is generated, the timing convergence is completed. In order to finally generate the FPGA prototype version, the bitstream file is specifically generated and the platform adaptation operation is performed to complete the production of the FPGA prototype version. At the same time, in order to enable users to better understand the timing violation processing and adjustment process, a log containing the information of the timing violation processing process is further generated, so that users can analyze the entire process according to the log content.

[0125] In addition, after the FPGA prototype version is completed, the FPGA prototype can be further tested for performance. First, by analyzing the power consumption report of the FPGA prototype, it is possible to evaluate whether the power consumption of the design meets the requirements. Power consumption analysis can help find potential power consumption hotspots, such as high-power logic modules or interfaces, and unnecessary power consumption waste. These problems may cause heat dissipation problems or shortened battery life in actual applications. Other performance tests can also be performed, such as signal integrity analysis and electromagnetic compatibility testing. These tests can help find other problems that the design may encounter in actual applications, such as reduced signal transmission quality or electromagnetic interference. Through performance testing, the feasibility of the design can be fully evaluated and subsequent optimization work can be guided. If power consumption hotspots are found, the logic design can be optimized or a low-power implementation method can be adopted. The results of performance testing can also be used to guide subsequent ASIC design and verification work to improve the success rate and performance of ASIC design.

[0126] In order to enable those skilled in the art to better understand the present solution, the timing adjustment method provided by the present solution is described below with reference to specific examples.

[0127] Figure 4 Schematic diagram of the FPGA prototype platform before and after the timing adjustment provided by the embodiment of the present invention. Figure 4 As shown, after timing adjustment, a large ASIC-designed logic circuit A in the field programmable gate array prototype version A is changed into two slightly smaller logic circuits A1 and A2. Specifically, a part of the logic is copied into two parts, and then a new time-division multiplexing path A6-C4 is added to transmit the relevant signals to the field programmable gate array prototype version C. This method solves the high fan-out problem and the problem of local area congestion. The field programmable gate array prototype version A and the field programmable gate array prototype version C need to add two time-division multiplexing positions A6 and C4 respectively, instantiate the corresponding time-division multiplexing modules to the area, add the corresponding timing constraint statements, and constrain the newly added time-division multiplexing modules to this area through Pblock constraints.

[0128] Further check the signals transmitted through the time-division multiplexing path A6-C4, and disconnect the old time-division multiplexing paths in A7, A8, and C1. In the field programmable gate array prototype version B, the connection between logic circuit B and logic circuit D adds the time-division multiplexing path B6-D2, and transfers part of the signals originally passing through the time-division multiplexing path B7-D1 to the time-division multiplexing path B6-D2. This is mainly to solve the congestion problem, the long path from logic circuit B to B7, or the situation where there are too many time-division multiplexing signals and cause timing violations. This processing method requires removing the path transmitted on the time-division multiplexing path B6-D2 from the time-division multiplexing path B7-D1, and adding or updating the timing constraints at B6 and B7. In the field programmable gate array prototype version C, the time division multiplexing path C8-D7 is adjusted to the time division multiplexing path C7-D7. This method is mainly used to deal with the timing violation caused by the long path when the logic wiring in the field programmable gate array prototype version C is near C8. Therefore, the time division multiplexing path C8-D7 is released and the time division multiplexing path C7-D7 is interconnected.

[0129] In the above embodiments, the timing adjustment method is described in detail, and the present invention also provides a corresponding embodiment of the timing adjustment device.

[0130] Figure 5 Schematic diagram of a timing adjustment device provided by an embodiment of the present invention. Figure 5 As shown, the timing adjustment device includes:

[0131] The acquisition module 10 is used to obtain the timing resource report, violation path reason and netlist file corresponding to each field programmable gate array prototype version whose timing cannot converge when the timing of the field programmable gate array prototype version cannot converge; wherein the timing resource report at least includes data on congestion, high fan-out, wiring density and resource utilization.

[0132] The mapping module 11 is used to map the timing resource report and the violation path reason to the corresponding netlist file, so as to mark the timing information of the corresponding field programmable gate array prototype version in the netlist file.

[0133] The determination module 12 is used to determine the newly added time-division multiplexing path according to the netlist file and pre-layout the newly added time-division multiplexing path.

[0134] The generating module 13 is used to generate each newly added time-division multiplexing path based on each netlist file, and determine the interconnection relationship of each newly added time-division multiplexing path in each netlist file.

[0135] The constraint module 14 is used to perform physical area constraints on the time division multiplexing modules corresponding to each newly added time division multiplexing path, and generate an engineering file after the timing path is adjusted to complete timing convergence.

[0136] In some embodiments, it also includes:

[0137] A configuration submodule, used for configuring each field programmable gate array prototype version;

[0138] The first judgment submodule is used to judge whether the configuration of all the field programmable gate array prototype versions is completed; if the configuration of all the field programmable gate array prototype versions is not completed, the configuration submodule is triggered; if the configuration of all the field programmable gate array prototype versions is completed, the second judgment submodule is triggered;

[0139] The second judgment submodule is used to judge whether the timing of the prototype version of the field programmable gate array cannot converge; if the timing of the prototype version of the field programmable gate array cannot converge, the first generation submodule is triggered; if the timing of the prototype version of the field programmable gate array cannot converge, the third judgment submodule is triggered;

[0140] The first generation submodule is used to generate a bit stream file and perform platform adaptation operations to complete the production of a field programmable gate array prototype version;

[0141] The third judgment submodule is used to judge whether the resource occupancy rates of all the prototype versions of the field programmable gate array whose timing cannot converge are not greater than the first threshold, and the corresponding maximum setup time violation or the maximum hold time violation are not less than the second threshold; if the resource occupancy rate of the prototype version of the field programmable gate array whose timing cannot converge is greater than the first threshold, and / or the corresponding maximum setup time violation or the maximum hold time violation is less than the second threshold, the segmentation submodule is triggered; if the resource occupancy rates of all the prototype versions of the field programmable gate array whose timing cannot converge are not greater than the first threshold, and the corresponding maximum setup time violation or the maximum hold time violation is not less than the second threshold, the acquisition module 10 is triggered;

[0142] The segmentation submodule is used to reduce the system clock frequency or adjust the resource allocation of each field programmable gate array prototype version, and re-segment each field programmable gate array prototype version.

[0143] In some embodiments, the acquisition module 10 includes:

[0144] A first acquisition submodule is used to acquire data of congestion, high fan-out, routing density and resource utilization of each field programmable gate array prototype version to obtain a timing resource report;

[0145] A second acquisition submodule is used to acquire a timing report of each field programmable gate array prototype version, and derive a corresponding timing violation path based on each timing report;

[0146] The analysis submodule is used to analyze each timing violation path to determine the cause of the violation path.

[0147] In some embodiments, the mapping module 11 includes:

[0148] A first mapping submodule is used to map the data of congestion, high fan-out, wiring density and resource utilization of each field programmable gate array prototype version to a corresponding netlist file at a chip level;

[0149] A first marking submodule is used to mark each timing violation path and its corresponding time division multiplexing module into a corresponding netlist file;

[0150] The first copy submodule is used to copy the high fan-out register information on the high fan-out timing violation path according to the cause of each violation path.

[0151] In some embodiments, the determination module 12 includes:

[0152] The fourth judgment submodule is used to judge whether the resource utilization rate of the time-division multiplexing position adjacent to the timing violation path is lower than the third threshold value according to each netlist file and register information; if not, trigger the selection submodule; if so, trigger the first determination submodule;

[0153] A submodule is selected, which is used to use the next position adjacent to the time division multiplexing position as a new time division multiplexing position adjacent to the timing violation path, and return to the step of determining whether the resource utilization rate of the time division multiplexing position adjacent to the timing violation path is lower than a third threshold according to each netlist file and register information;

[0154] A first determination submodule, used to determine a newly added time division multiplexing path according to the time division multiplexing position;

[0155] An instantiation submodule, used to instantiate time-division multiplexing related modules according to the time-division multiplexing position and its quantity; wherein the related modules at least include a clock module, a multiplexer, a demultiplexer, a receiving buffer, a sending buffer and a data encoding and decoding module;

[0156] A submodule is written to write constraint statements of the time division multiplexing module corresponding to the newly added time division multiplexing path according to the time division multiplexing position and the netlist file.

[0157] In some embodiments, the generating module 13 includes:

[0158] A fifth judgment submodule is used to judge whether the timing violation of the timing violation path is caused by high fan-out; if so, the timing violation path is maintained; if not, the disconnection submodule is triggered;

[0159] The disconnect submodule is used to disconnect the timing violation path.

[0160] In some embodiments, it also includes:

[0161] The second generation submodule is used to generate a bit stream file and perform platform adaptation operations to complete the production of a field programmable gate array prototype version;

[0162] The third generation submodule is used to generate a log containing information about the timing violation processing process.

[0163] Since the embodiments of the apparatus part correspond to the embodiments of the method part, please refer to the description of the embodiments of the method part for the embodiments of the apparatus part, which will not be repeated here.

[0164] In addition, the present invention also provides a computer program product, including a computer program / instruction, which implements the steps of the above-mentioned timing adjustment method when executed by a processor.

[0165] Figure 6 A schematic diagram of a timing adjustment device provided by an embodiment of the present invention. Figure 6 As shown, the timing adjustment device includes:

[0166] A memory 20, used for storing computer programs;

[0167] The processor 21 is used to implement the steps of the timing adjustment method mentioned in the above embodiment when executing the computer program.

[0168] The timing adjustment device provided in this embodiment may include but is not limited to a smart phone, a tablet computer, a laptop computer, or a desktop computer.

[0169] Among them, the processor 21 may include one or more processing cores, such as a 4-core processor, an 8-core processor, etc. The processor 21 can be implemented in at least one hardware form of a digital signal processor (DSP), a field programmable gate array (FPGA), and a programmable logic array (PLA). The processor 21 may also include a main processor and a coprocessor. The main processor is a processor for processing data in an awake state, also known as a central processing unit (CPU); the coprocessor is a low-power processor for processing data in a standby state. In some embodiments, the processor 21 may be integrated with a graphics processing unit (GPU), and the GPU is responsible for rendering and drawing the content to be displayed on the display screen. In some embodiments, the processor 21 may also include an artificial intelligence (AI) processor, which is used to process computing operations related to machine learning.

[0170] The memory 20 may include one or more computer-readable storage media, which may be non-transitory. The memory 20 may also include a high-speed random access memory, and a non-volatile memory, such as one or more disk storage devices, flash memory storage devices. In this embodiment, the memory 20 is at least used to store the following computer program 201, wherein, after the computer program is loaded and executed by the processor 21, it can implement the relevant steps of the timing adjustment method disclosed in any of the aforementioned embodiments. In addition, the resources stored in the memory 20 may also include an operating system 202 and data 203, etc., and the storage method may be temporary storage or permanent storage. Among them, the operating system 202 may include Windows, Unix, Linux, etc. Data 203 may include but is not limited to data related to the timing adjustment method.

[0171] In some embodiments, the timing adjustment device may further include a display screen 22 , an input / output interface 23 , a communication interface 24 , a power supply 25 , and a communication bus 26 .

[0172] Those skilled in the art will understand that Figure 6 The structure shown in the figure does not constitute a limitation on the timing adjustment device, and may include more or less components than those shown in the figure.

[0173] Finally, the present invention also provides an embodiment corresponding to a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps recorded in the above method embodiment are implemented.

[0174] It is understandable that if the method in the above embodiment is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc. Various media that can store program codes.

[0175] The above is a detailed introduction to a timing adjustment method, device, equipment and medium provided by the present invention. The various embodiments in the specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same and similar parts between the embodiments can be referenced to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part description. It should be pointed out that for ordinary technicians in this technical field, without departing from the principle of the present invention, several improvements and modifications can be made to the present invention, and these improvements and modifications also fall within the scope of protection of the present invention.

[0176] It should also be noted that, in this specification, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "comprise", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the statement "comprises a ..." does not exclude the presence of other identical elements in the process, method, article or device including the element.

Claims

1. A timing adjustment method, It is characterized in that include: When there is a field programmable gate array prototype version whose timing cannot converge, obtain a timing resource report, a violation path reason and a netlist file corresponding to each field programmable gate array prototype version whose timing cannot converge; wherein the timing resource report contains at least data on congestion, high fan-out, wiring density and resource utilization; Mapping the timing resource report and the violation path cause to the corresponding netlist file, so as to mark the timing information corresponding to the prototype version of the field programmable gate array in the netlist file; Determine a newly added time-division multiplexing path according to the netlist file, and pre-layout the newly added time-division multiplexing path; Generating each of the newly added time-division multiplexing paths based on each of the netlist files, and determining the interconnection relationship of each of the newly added time-division multiplexing paths in each of the netlist files; Physical area constraints are performed on the time division multiplexing modules corresponding to each of the newly added time division multiplexing paths, and an engineering file after the timing path adjustment is generated to complete timing closure.

2. The timing adjustment method according to claim 1, It is characterized in that Before obtaining the timing resource report, violation path reason and netlist file corresponding to each of the field programmable gate array prototype versions whose timing cannot be converged, the method further includes: configuring each of the field programmable gate array prototype versions; Determining whether configuration of all the field programmable gate array prototype versions is completed; If the configuration of all the field programmable gate array prototype versions is not completed, returning to the step of configuring each field programmable gate array prototype version; If configuration of all the field programmable gate array prototype versions is completed, determining whether there is a field programmable gate array prototype version whose timing cannot converge; If the timing of the field programmable gate array prototype version cannot be converged, a bitstream file is generated and a platform adaptation operation is performed to complete the production of the field programmable gate array prototype version; If there is a field programmable gate array prototype version whose timing cannot converge, determine whether the resource occupancy rates of all field programmable gate array prototype versions whose timing cannot converge are not greater than a first threshold, and whether the corresponding maximum setup time violation or maximum hold time violation is not less than a second threshold; If the resource occupancy rate of the field programmable gate array prototype version whose timing cannot converge is greater than a first threshold, and / or the corresponding maximum setup time violation or maximum hold time violation is less than a second threshold, then the system clock frequency is reduced or the resource allocation of each field programmable gate array prototype version is adjusted, and each field programmable gate array prototype version is split again; If the resource occupancy rates of all the field programmable gate array prototype versions whose timing cannot converge are not greater than the first threshold, and the corresponding maximum setup time violation or maximum hold time violation are not less than the second threshold, then the step of obtaining the timing resource report, violation path cause and netlist file corresponding to each of the field programmable gate array prototype versions whose timing cannot converge is entered.

3. The timing adjustment method according to claim 1, It is characterized in that Obtaining the timing resource report and the violation path reason corresponding to each of the field programmable gate array prototype versions whose timing cannot converge, including: Acquire data of congestion, high fan-out, routing density and resource utilization of each of the field programmable gate array prototype versions to obtain the timing resource report; Obtaining a timing report of each of the field programmable gate array prototype versions, and deriving a corresponding timing violation path based on each of the timing reports; Each of the timing violation paths is analyzed to determine the cause of the violation path.

4. The timing adjustment method according to claim 3, It is characterized in that The step of mapping the timing resource report and the violation path cause to the corresponding netlist file, so as to mark the timing information corresponding to the prototype version of the field programmable gate array in the netlist file, comprises: Mapping the data of congestion, high fan-out, routing density and resource utilization of each field programmable gate array prototype version to the corresponding netlist file at the chip level; Marking each of the timing violation paths and its corresponding time division multiplexing module into the corresponding netlist file; According to each of the violation path causes, high fan-out register information on the timing violation path based on the high fan-out is copied.

5. The timing adjustment method according to claim 4, It is characterized in that Determining a newly added time-division multiplexing path according to the netlist file and pre-laying out the newly added time-division multiplexing path includes: According to each of the netlist files and the register information, determining whether the resource utilization rate of the time division multiplexing position adjacent to the timing violation path is lower than a third threshold; If not, the next position adjacent to the time division multiplexing position is used as the new time division multiplexing position adjacent to the timing violation path, and the process returns to the step of determining whether the resource utilization rate of the time division multiplexing position adjacent to the timing violation path is lower than a third threshold value according to each of the netlist files and the register information; If yes, determining the newly added time division multiplexing path according to the time division multiplexing position; Instantiate time division multiplexing related modules according to the time division multiplexing positions and their quantities; wherein the related modules at least include a clock module, a multiplexer, a demultiplexer, a receiving buffer, a sending buffer and a data encoding and decoding module; A constraint statement of the time division multiplexing module corresponding to the newly added time division multiplexing path is written according to the time division multiplexing position and the netlist file.

6. The timing adjustment method according to claim 5, It is characterized in that The generating of each newly added time-division multiplexing path based on each of the netlist files, and determining the interconnection relationship of each newly added time-division multiplexing path in each of the netlist files, includes: Determining whether the timing violation of the timing violation path is caused by high fan-out; If so, maintaining the timing violation path; If not, the timing violation path is disconnected.

7. The timing adjustment method according to claim 1, It is characterized in that After physically constraining the time division multiplexing modules corresponding to each of the newly added time division multiplexing paths and generating an engineering file after the timing path is adjusted, the method further includes: Generate a bitstream file and perform platform adaptation operations to complete the production of the field programmable gate array prototype version; Generates a log containing information about the timing violation handling process.

8. A timing adjustment device, It is characterized in that include: An acquisition module is used to acquire a timing resource report, a violation path reason and a netlist file corresponding to each field programmable gate array prototype version whose timing cannot converge when there is a field programmable gate array prototype version whose timing cannot converge; wherein the timing resource report at least includes data on congestion, high fan-out, wiring density and resource utilization; A mapping module, used for mapping the timing resource report and the violation path cause to the corresponding netlist file, so as to mark the timing information corresponding to the prototype version of the field programmable gate array in the netlist file; A determination module, used to determine a newly added time-division multiplexing path according to the netlist file, and pre-layout the newly added time-division multiplexing path; A generating module, used to generate each of the newly added time-division multiplexing paths based on each of the netlist files, and determine the interconnection relationship of each of the newly added time-division multiplexing paths in each of the netlist files; The constraint module is used to perform physical area constraints on the time division multiplexing modules corresponding to each of the newly added time division multiplexing paths, and generate an engineering file after the timing path is adjusted to complete timing convergence.

9. A timing adjustment device, It is characterized in that include: Memory for storing computer programs; A processor, configured to implement the steps of the timing adjustment method according to any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the timing adjustment method according to any one of claims 1 to 7 are implemented.