A layout planning design method of an ICL instantiation network

Abstract

The application relates to the technical field of software engineering, in particular to a layout planning design method of an ICL instantiation network; constraint conditions between interconnected units are extracted, an ICL text corresponding to an iJTAG network is parsed, the interconnection relationship between a basic unit and an instantiation module is obtained, a set composed of the instantiation module and the basic unit and constraint conditions are input, all unit sets listed in a visual table are processed in a digital sequence numbering mode, the constraint conditions are units and modules with the interconnection relationship in the visual table, and the constraint conditions are listed as a constraint netlist; initialization setting is carried out on the iJTAG network, a layout is carried out on an initial network through an analog annealing algorithm, the layout result is repeatedly adjusted and optimized to meet an optimal solution of a target function, and the above steps are used to improve the accuracy of the layout.

Description

Technical Field

[0001] This invention relates to the field of software engineering technology, and in particular to a layout planning and design method for ICL instantiated networks. Background Technology

[0002] In the testing and access problem of reconfigurable scan networks, researchers study reconfigurable scan networks by manually drawing network module diagrams, where the instrument connectivity language defines the connection methods between iJTAG network modules.

[0003] When the ICL script is complex, manual layout can lead to low efficiency and low fault tolerance, resulting in low accuracy of the layout. Summary of the Invention

[0004] The purpose of this invention is to provide a layout planning and design method for ICL instantiated networks, aiming to solve the technical problem of low layout accuracy in the prior art.

[0005] To achieve the above objectives, the present invention employs a layout planning and design method for ICL instantiated networks, comprising the following steps:

[0006] Extract the constraints between interconnect units;

[0007] Limit the distance between unit modules that are subject to interconnection constraints;

[0008] Conduct layout planning.

[0009] In the step of extracting the constraints between interconnecting units, the extraction process is as follows:

[0010] The ICL text corresponding to the iJTAG network is parsed to extract all instances and basic units in the iJTAG network;

[0011] Obtain the interconnection relationship between the basic unit and the instantiated module;

[0012] List the visualizations in the table.

[0013] In the step of limiting the distance between unit modules that restrict interconnection constraints:

[0014] Input the set of instantiated modules and basic units, along with constraints, and visualize the set of all units M={m1, m2, ...} listed in the table.

[0015] In the step of limiting the distance between unit modules that restrict interconnection constraints:

[0016] All units and modules listed in the visualization table of ICL parsing are numbered sequentially. The constraint condition is that the units and modules in the visualization table have interconnection relationships, and the column is a constraint netlist N={N1, N2, ...}.

[0017] The planning steps in the layout planning process are as follows:

[0018] Perform initial setup for the iJTAG network, including setting the network size and module unit encoding;

[0019] The initial network is laid out using a simulated annealing algorithm;

[0020] The layout results are repeatedly adjusted and optimized using the Metropolis criterion to satisfy the optimal solution of the objective function.

[0021] In the step of deploying the initial network using the simulated annealing algorithm, K is the desired iterative adaptive factor, and n represents the scale of the deployment plan. Indicates the initial temperature. This represents the current iteration number of the algorithm, and 'a' represents the cooling parameter. The expression for the simulated annealing algorithm is:

[0022] ;

[0023] .

[0024] The beneficial effects of this invention are reflected in the following: by first extracting the constraints between interconnecting units, then limiting the distance between the interconnecting unit modules, and finally performing layout planning, the constraints between units are extracted based on the characteristics of the network structure and the language ICL used to describe the network. Through a cooling strategy, the layout planning of the iJTAG network is realized, thereby improving the accuracy of the layout. Attached Figure Description

[0025] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0026] Figure 1 This is a flowchart of the iJTAG network layout planning of the present invention.

[0027] Figure 2 This is a flowchart of the layout planning and design method for the ICL instantiated network of the present invention.

[0028] Figure 3 This is a flowchart of the steps for extracting constraints between interconnecting units according to the present invention.

[0029] Figure 4 This is a flowchart of the layout planning steps of the present invention. Detailed Implementation

[0030] Please see Figures 1 to 4 This invention provides a layout planning and design method for ICL instantiated networks, comprising the following steps:

[0031] S1: Extract the constraints between interconnect units;

[0032] S2: The distance between unit modules that restrict interconnection constraints;

[0033] S3: Perform layout planning.

[0034] In this embodiment, firstly, the constraints between interconnecting units are extracted; then, the distance between interconnecting unit modules is limited; finally, layout planning is performed. Based on the characteristics of the network structure and the ICL language used to describe the network, the constraints between units are extracted. A cooling strategy is used to achieve layout planning for the iJTAG network, thereby improving the accuracy of the layout.

[0035] Furthermore, in the step of extracting the constraints between interconnecting units, the extraction process is as follows:

[0036] S11: Parse the ICL text corresponding to the iJTAG network and extract all instances and basic units in the iJTAG network;

[0037] S12: Obtain the interconnection relationship between the basic unit and the instantiated module;

[0038] S13: List the visualization table.

[0039] In this implementation, the ICL text corresponding to the iJTAG network is first parsed to extract all instances and basic units in the iJTAG network. Then, the interconnection relationship between the basic units and instantiation modules is obtained, and a visualization table is created. Based on the visualization table, the distance between the interconnection constraints of the unit modules is restricted. Then, the layout planning is performed. Based on the characteristics of the network structure and the ICL language describing the network, the constraints between units are extracted. Through a cooling strategy, the layout planning of the iJTAG network is realized, thereby improving the accuracy of the layout.

[0040] Furthermore, in the step of limiting the distance between unit modules that constrain interconnection:

[0041] Input the set of instantiated modules and basic units, along with constraints, and visualize the set of all units M={m1, m2, ...} listed in the table.

[0042] Furthermore, in the step of limiting the distance between unit modules that constrain interconnection:

[0043] All units and modules listed in the visualization table of ICL parsing are numbered sequentially. The constraint condition is that the units and modules in the visualization table have interconnection relationships, and the column is a constraint netlist N={N1, N2, ...}.

[0044] In this implementation, the ICL text corresponding to the iJTAG network is first parsed to extract all instances and basic units in the iJTAG network. Then, the interconnection relationship between basic units and instantiated modules is obtained, and a visualization table is created. Based on the visualization table, the distance between the interconnection constraints of the unit modules is restricted. The set of instantiated modules and basic units, as well as the constraints, are input. All unit sets M = {m1, m2, ...} listed in the visualization table are processed by numerical sequential numbering. The constraints are the units and modules with interconnection relationships in the visualization table, listed as the constraint netlist N = {N1, N2, ...}. Then, the layout planning is performed. Based on the characteristics of the network structure and the language ICL used to describe the network, the constraints between units are extracted. Through a cooling strategy, the layout planning of the iJTAG network is realized, thereby improving the accuracy of the layout.

[0045] Furthermore, in the layout planning process, the planning steps are as follows:

[0046] S31: Color the rectangular units separately, coloring units with interconnection constraints blue and basic units yellow, and number all units sequentially with Arabic numerals.

[0047] S32: Initialize the iJTAG network settings, including setting the network size and module unit encoding;

[0048] S33: Layout the initial network using the simulated annealing algorithm;

[0049] S34: The layout results are repeatedly adjusted and optimized using the Metropolis criterion to satisfy the optimal solution of the objective function.

[0050] In this implementation, the ICL text corresponding to the iJTAG network is first parsed to extract all instances and basic units in the iJTAG network. Then, the interconnection relationships between basic units and instantiated modules are obtained, and a visualization table is created. Based on the visualization table, the distance between the interconnection constraints of the unit modules is restricted. The set of instantiated modules and basic units, along with the constraints, is input. The set of all units listed in the visualization table is M = {m1, m2, ...}. All units and modules listed in the visualization table obtained from the ICL parsing are numbered sequentially. The constraints are the units and modules with interconnection relationships in the visualization table, listed as a constraint netlist N = {N1, N2, ...}. Then, the rectangular units are... The iJTAG network is first colored blue, with interconnected units colored blue and basic units colored yellow. All units are then sequentially numbered using Arabic numerals. Next, the network is initialized, including setting the network size and module unit encoding, ensuring that the distance D between interconnected modules remains equal to the side length r of the basic unit (D=r). Simulated annealing is then used to map the initial network. Finally, the map results are repeatedly adjusted and optimized using the Metropolis criterion to find the optimal solution for the objective function. Based on the characteristics of the network structure and the ICL language used to describe it, the constraints between units are extracted. A cooling strategy is then employed to plan the map layout of the iJTAG network, thereby improving the accuracy of the map layout.

[0051] Furthermore, in the step of deploying the initial network using the simulated annealing algorithm, K is the desired iterative adaptive factor, and n represents the scale of the deployment plan. Indicates the initial temperature. This represents the current iteration number of the algorithm, and 'a' represents the cooling parameter. The expression for the simulated annealing algorithm is:

[0052] ;

[0053] .

[0054] Furthermore, the value of a ranges from 1.0 to 2.0.

[0055] In this implementation, the ICL text corresponding to the iJTAG network is first parsed to extract all instances and basic units in the iJTAG network. Then, the interconnection relationships between basic units and instantiated modules are obtained, and a visualization table is created. Based on the visualization table, the distance between the interconnection constraints of the unit modules is restricted. The set of instantiated modules and basic units, along with the constraints, is input. The set of all units listed in the visualization table is M = {m1, m2, ...}. All units and modules listed in the visualization table obtained from the ICL parsing are numbered sequentially. The constraints are the units and modules with interconnection relationships in the visualization table, listed as a constraint netlist N = {N1, N2, ...}. Then, the rectangular units are colored. The process involves first coloring interconnected units blue and basic units yellow, then sequentially numbering all units using Arabic numerals. Next, the iJTAG network is initialized, including setting the network size and module unit encoding, ensuring that the distance D between interconnected modules remains constant equal to the side length r of the basic unit (D=r). Simulated annealing is then used to map the initial network. Finally, the map layout is repeatedly adjusted and optimized using the Metropolis criterion to find the optimal solution for the objective function. Based on the characteristics of the network structure and the ICL language used to describe it, the constraints between units are extracted. A cooling strategy is employed to plan the iJTAG network layout, improving its accuracy. In the simulated annealing algorithm… ; K is the desired iterative adaptive factor, and n represents the scale of the layout planning, i.e., the number of units in the iJTAG module to be laid out and the number of instantiated modules. Indicates the initial temperature. This indicates the current iteration number of the algorithm, and 'a' represents the cooling parameter, which ranges from 1.0 to 2.0. The larger the value of 'a', the faster the cooling speed.

[0056] The above description discloses only one preferred embodiment of the present invention, and should not be construed as limiting the scope of the present invention. Those skilled in the art will understand that all or part of the processes of the above embodiments can be implemented, and equivalent changes made in accordance with the claims of the present invention are still within the scope of the invention.

Claims

1. A layout planning and design method for ICL instantiated networks, characterized in that, Includes the following steps: Extract the constraints between interconnect units; Constrain the distance between interconnected unit modules; input the set of instantiated modules and basic units and the constraints, and the set of all units listed in the visualization table M={m1, m2, ...}; number all units and modules listed in the visualization table of ICL parsing, and the constraints are the units and modules with interconnected relationships in the visualization table, listed as the constraint netlist N={N1, N2, ...}; Layout planning is performed; the planning steps are as follows: Perform initial setup for the iJTAG network, including setting the network size and module unit encoding; The initial network is deployed using simulated annealing; K is the desired iterative adaptive factor, and n represents the scale of the deployment plan. Indicates the initial temperature. This represents the current iteration number of the algorithm, and 'a' represents the cooling parameter. The expression for the simulated annealing algorithm is: ； ； The layout results are repeatedly adjusted and optimized using the Metropolis criterion to satisfy the optimal solution of the objective function; In the step of extracting the constraints between interconnecting units, the extraction process is as follows: The ICL text corresponding to the iJTAG network is parsed to extract all instances and basic units in the iJTAG network; Obtain the interconnection relationship between the basic unit and the instantiated module; List the visualizations in the table.

Images