Method, computer device and storage medium for optimizing digital logic circuit

By directly identifying the target netlist in the digital logic circuit, the problem of time-consuming establishment of timing charts is solved, the optimization efficiency of digital logic circuits is improved, and the accurate identification and optimization of netlists with large delays is achieved.

CN118551703BActive Publication Date: 2024-11-15X TIMES DESIGN AUTOMATION CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411021874.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-07-29
Publication Date
2024-11-15
Estimated Expiration
2044-07-29

AI Technical Summary

Technical Problem

During the EDA software layout and wiring process, the establishment of the timing chart takes a long time, resulting in a large time overhead for identifying the target netlist, affecting the optimization efficiency of the digital logic circuit. Especially when the timing chart cannot be established, the target net with a large delay cannot be identified without identifying the target net with a large delay. table, affecting the overall timing optimization effect.

Method used

By obtaining the netlist of the digital logic circuit, determining the signal driving end and the signal receiving end, determining the constraints based on these endpoints, directly identifying the target netlist without establishing a timing chart, thereby optimizing the digital logic circuit.

Benefits of technology

It saves time to set up timing charts, improves the optimization efficiency of digital logic circuits, and can identify target netlists with large delays without the need for timing charts, improving the optimization effect of layout and routing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118551703B_ABST
    Figure CN118551703B_ABST
Patent Text Reader

Abstract

The present application provides a method, computer device and storage medium for optimizing digital logic circuits. The method includes: obtaining a netlist of the digital logic circuit, determining a signal driver and a signal receiver of the netlist, determining constraints based on the signal driver and the signal receiver, determining a target netlist of the digital logic circuit according to the constraints, and optimizing the digital logic circuit based on the target netlist. The above method can identify the target netlist in the digital logic circuit without establishing a timing diagram, saving the time of establishing the timing diagram, thereby improving the optimization efficiency of the digital logic circuit.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of digital logic circuits, and in particular to a method, a computer device, and a storage medium for optimizing digital logic circuits. Background Art

[0002] When using EDA software for layout and routing, in order to avoid timing violations caused by long arrival times, it is necessary to find a target netlist with a potentially long arrival time and perform timing optimization and control on the target netlist. In related technologies, in order to identify the target netlist, a timing diagram can be established first, and then the target netlist can be matched and identified based on the timing diagram. However, the establishment of a timing diagram is very time-consuming, and identifying the target netlist based on the timing diagram will result in a large time overhead for optimizing digital logic circuits. Summary of the invention

[0003] In view of this, the purpose of the present application is to propose a method, a computer device and a storage medium for optimizing a digital logic circuit, so as to solve or partially solve the above-mentioned problem.

[0004] Based on the above objectives, in a first aspect, the present application provides a method for optimizing a digital logic circuit, comprising:

[0005] Obtaining a netlist of the digital logic circuit;

[0006] Determine a signal driving end and a signal receiving end of the netlist;

[0007] Determining a constraint condition based on the signal driving end and the signal receiving end;

[0008] Determine a target netlist of the digital logic circuit according to the constraint conditions;

[0009] The digital logic circuit is optimized based on the target netlist.

[0010] In a second aspect of the present application, a computer device is provided, including:

[0011] one or more processors, memory; and

[0012] one or more programs;

[0013] The one or more programs are stored in the memory and executed by one or more processors, and the programs include instructions for executing the method described in the first aspect.

[0014] According to a third aspect of the present application, a non-volatile computer-readable storage medium containing a computer program is provided. When the computer program is executed by one or more processors, the processors execute the method described in the first aspect.

[0015] As can be seen from the above, the present application provides a method, computer device and storage medium for optimizing digital logic circuits. The method includes: obtaining a netlist of the digital logic circuit, determining a signal driver and a signal receiver of the netlist, determining constraints based on the signal driver and the signal receiver, determining a target netlist of the digital logic circuit according to the constraints, and optimizing the digital logic circuit based on the target netlist. The above method can identify the target netlist in the digital logic circuit without establishing a timing diagram, saving the time for establishing the timing diagram, thereby improving the optimization efficiency of the digital logic circuit. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the present application or related technologies, the drawings required for use in the embodiments or related technical descriptions are briefly introduced below. Obviously, the drawings described below are only embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0017] Figure 1 A schematic diagram of an exemplary timing diagram 100 according to an embodiment of the present application is shown.

[0018] Figure 2A FIG. 2 is a schematic diagram of an exemplary first digital logic circuit 200 according to an embodiment of the present application.

[0019] Figure 2B FIG. 2 is a schematic diagram of another exemplary first digital logic circuit 200 according to an embodiment of the present application.

[0020] Figure 3A A schematic diagram showing an exemplary Manhattan distance according to an embodiment of the present application is shown.

[0021] Figure 3B FIG. 4 is a schematic diagram of an exemplary second digital logic circuit 300 a according to an embodiment of the present application.

[0022] Figure 3C FIG. 4 is a schematic diagram of an exemplary third digital logic circuit 300 b according to an embodiment of the present application.

[0023] Figure 4 FIG. 4 is a flow chart of an exemplary method 400 for optimizing a digital logic circuit according to an embodiment of the present application.

[0024] Figure 5 A schematic structural diagram of an exemplary computer device 500 according to an embodiment of the present application is shown. DETAILED DESCRIPTION

[0025] In order to make the objectives, technical solutions and advantages of the present application more clearly understood, the present application is further described in detail below in combination with specific embodiments and with reference to the accompanying drawings.

[0026] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present application should be the usual meanings understood by people with ordinary skills in the field to which the present application belongs. The "first", "second" and similar words used in the embodiments of the present application do not represent any order, quantity or importance, but are only used to distinguish different components. "Including" or "comprising" and similar words mean that the elements or objects appearing in front of the word cover the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0027] It is understandable that before using the technical solutions of each embodiment of the present application, the type, scope of use, usage scenarios, etc. of the personal information involved will be informed to the user in an appropriate manner, and the user's authorization will be obtained.

[0028] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly remind the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can independently choose whether to provide personal information to the electronic device, application, server, storage medium or other software or hardware that performs the operation of the technical solution of the present application according to the prompt message.

[0029] As an optional but non-limiting implementation, in response to receiving the user's active request, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0030] It is understandable that the above notification and the process of obtaining user authorization are merely illustrative and do not constitute a limitation on the implementation method of this application. Other methods that meet relevant laws and regulations may also be applied to the implementation method of this application.

[0031] EDA (Electronic Design Automation) refers to the use of computers and specially designed software tools to assist in the design process of electronic systems. EDA tools play an important role in all stages of electronic design, including logic design, synthesis, layout and routing, timing analysis, power consumption analysis, etc. Among them, timing and layout and routing compatibility analysis, as one of the key links in electronic system design, is of great significance to ensure the stability, performance and reliability of electronic systems.

[0032] In electronic system design, timing refers to the time characteristics of signal propagation in the circuit. In timing analysis, we need to pay attention to the propagation time of the signal from one trigger to another, as well as the performance requirements of various timing specifications. Placement and routing refers to placing the various components in the logic circuit at a certain position on the chip and wiring them. Reasonable layout and routing has an important impact on circuit performance, power consumption, and chip area.

[0033] EDA software layout and routing needs to meet timing requirements. Establishing a timing margin (Setup Slack) is an important indicator to indicate whether there is a timing violation in the routing results of the signal netlist (signal nets). Netlist (Net), also known as network table, is a representation of network connections and connections. Its content mainly includes information such as the types of components in the circuit, packaging information, and connection relationships. The netlist usually contains at least one signal driver and one or more signal receiving ends (load). Routing requires the signal driver and all signal receiving ends of the netlist to be routed through.

[0034] Establishing Timing Margin = Required Time (Data Required Time) – Arrival Time (Data Arrival Time), where the Required Time is the latest arrival time that the data can be captured by the receiving end in order to ensure the timing requirements; the Arrival Time is the time when the signal actually reaches the signal receiving end from the signal driver end, which is the time when the data actually arrives at the receiving end. It should be noted that the Delay Time is a part of the Arrival Time. The larger the Delay Time, the larger the Arrival Time. If the Establishing Timing Margin is a negative number, then there is a timing violation. From the calculation formula for establishing the timing margin above, it can be seen that if the Arrival Time is relatively large, then it may cause the Establishing Timing Margin to be negative, resulting in a timing violation.

[0035] When EDA software is used for layout and routing, in order to avoid timing violations caused by long arrival times, it is necessary to find the target netlists (timing critical nets) whose arrival times may be long during the layout and routing iterations, and perform timing optimization and control for the target netlists. In related technologies, in order to identify the target netlist, a timing graph can be established first, and then the target netlist can be matched and identified based on the timing graph.

[0036] Figure 1 A schematic diagram of an exemplary timing diagram 100 according to an embodiment of the present application is shown.

[0037] like Figure 1 As shown, the timing graph 100 may be a directed acyclic graph (DAG). The graph is composed of a node set and a directed edge set. Among them:

[0038] 1. Directed edges indicate the direction of signal transmission.

[0039] 2. Path: A sequence of nodes. In this node sequence, there is a directed edge between any two adjacent nodes, making the two nodes the tail node and the head node of the edge respectively.

[0040] 3. Delay: Each edge of a directed acyclic graph can be bound to a positive number, representing the signal transmission delay in the physical world.

[0041] For each node in the timing diagram 100, the arrival time and required time of each node need to be calculated. There are many paths from one node (for example, node A) to another node (for example, node B). When performing layout and routing, it is necessary to calculate the establishment timing margin of each node based on the arrival time and required time of each node, and then find the path with a larger delay in the path based on the establishment timing margin of each node. Then, the target netlist is identified based on the path found in the timing diagram. In this way, after the target netlist is identified according to the timing diagram, the layout and routing optimization of the target netlist can be performed, thereby achieving the purpose of optimizing the digital logic circuit.

[0042] It is understood that the number of nodes in the timing diagram 100 is only exemplary. There may be more nodes in a digital logic circuit, and more paths may be formed between more nodes. However, when performing layout and routing, the arrival time, required time, and setup time margin need to be calculated for each node to find a path with a larger delay, which results in a large time overhead for optimizing the digital logic circuit.

[0043] In addition, in some scenarios, such as directly importing DEF (Design Exchange Format) files, there may be a problem that the timing diagram cannot be established due to the missing parameter information in the DEF file. In this case, the timing diagram cannot be established, and the target netlist cannot be identified based on the timing diagram, and thus the optimization of digital logic circuit layout and routing cannot be performed.

[0044] The timing diagram is a network whose topology changes continuously during the layout and routing iteration process. The topology changes are manifested as the increase or decrease of nodes or edges, the change of arrival time and required time value in the node, which causes the importance of a node to change over time. In this way, since the timing diagram is a network structure that changes continuously over time, when using the timing diagram to identify the target netlist, some target netlists may be missed. These missed target netlists are often target netlists with potentially large delays. On this basis, when performing layout and routing optimization, these missed target netlists cannot be optimized in the early stage of layout and routing iteration, which in turn affects the overall timing optimization effect of the digital logic circuit.

[0045] In view of this, the present application provides a method, computer device and storage medium for optimizing digital logic circuits. The method includes: obtaining a netlist of the digital logic circuit, determining a signal driver and a signal receiver of the netlist, determining constraints based on the signal driver and the signal receiver, determining a target netlist of the digital logic circuit according to the constraints, and optimizing the digital logic circuit based on the target netlist. The above method can identify the target netlist in the digital logic circuit without establishing a timing diagram, saving the time for establishing the timing diagram, thereby improving the optimization efficiency of the digital logic circuit.

[0046] The method for optimizing digital logic circuits provided by the present application may not require the establishment of a timing diagram. In some embodiments, the target netlist in the digital logic circuit may be determined by constraints, and then the routing of the target netlist may be optimized during layout and routing, thereby achieving optimization of the digital logic circuit.

[0047] Figure 2A FIG. 2 is a schematic diagram of an exemplary first digital logic circuit 200 according to an embodiment of the present application.

[0048] like Figure 2AAs shown, the first digital logic circuit 200 may include a first unit 202, a second unit 204, a third unit 206, and a fourth unit 208. The first unit 202, the second unit 204, the third unit 206, and the fourth unit 208 may be basic logic units, flip flops, etc. Each unit may include a pin (e.g., a first pin 212, a second pin 214, and a third pin 216) for inputting or outputting signals. Multiple units may be connected through a netlist. In this embodiment, the netlist connects the first pin 212, the second pin 214, and the third pin 216.

[0049] It should be noted that the connections of modules, pins and netlists in the first digital logic circuit 200 are exemplary. In practical applications, the digital logic circuit may include more modules, pins and more connection modes, which are not limited in this application.

[0050] In order to identify a target netlist with a large delay in a digital logic circuit, in some embodiments, after obtaining all netlists in the digital logic circuit, the signal driver and signal receiving end (load) of each netlist can be determined. Figure 2A Taking the netlist shown in as an example, taking the second pin 214 and the third pin 216 as an example, assuming that the second pin 214 and the third pin 216 are connected through the netlist, the second pin 214 can be the signal driving end of the netlist, and the third pin 216 can be the signal receiving end of the netlist.

[0051] After the signal driver and signal receiver of each netlist are determined, in some embodiments, the area of ​​the minimum rectangular area (net Boundary Box area, net BBOX area) covering the signal driver and signal receiver of each netlist can be calculated. Figure 2A As shown, taking the second pin 214 connected to the third pin 216 and the first pin 212 through the netlist as an example, the second pin 214 is the signal driving end of the netlist, the first pin 212 and the third pin 216 are the signal receiving ends of the netlist, and the first pin 212, the second pin 214, and the third pin 216 are connected through the first connection 218 of the netlist. The first rectangular area 210 can be the minimum rectangular area that can cover the first pin 212, the second pin 214, and the third pin 216, and the area of ​​the first rectangular area 210 can be the first area.

[0052] Figure 2B FIG. 2 is a schematic diagram of another exemplary first digital logic circuit 200 according to an embodiment of the present application.

[0053] like Figure 2BAs shown, taking the example of the second pin 214 being connected to the fourth pin 220 through the netlist, the second pin 214 is the signal driving end of the netlist, the fourth pin 220 is the signal receiving end of the netlist, and the second pin 214 is connected to the fourth pin 220 through the second connection 224 of the netlist. The second rectangular area 222 can be the minimum rectangular area covering the second pin 214 and the fourth pin 220, and the area of ​​the second rectangular area 222 can be the second area.

[0054] Combination Figure 2A and Figure 2B Generally, the larger the area of ​​the minimum rectangular area of ​​the netlist, the longer the netlist's wiring tends to be, and the greater the delay of the netlist. Therefore, the area of ​​the minimum rectangular area covering the signal driving end and the signal receiving end of each netlist is used as a constraint to identify netlists with larger delays in digital logic circuits. For example, if the first area is larger than the second area, the netlist corresponding to the first area can be screened out, thereby controlling the wiring of the netlist.

[0055] In the first digital logic circuit 200, there may be multiple minimum rectangular areas with the same area. However, the delays of the netlists in the multiple minimum rectangular areas with the same area may be quite different. In view of this, on the basis of taking the area of ​​the minimum rectangular area covering the signal driving end and the signal receiving end of each netlist as a constraint condition, in some embodiments, the target distance between the signal driving end and the signal receiving end may be further taken as a constraint condition. The target distance may be the maximum Manhattan distance between the signal driving end and the signal receiving end.

[0056] Figure 3A A schematic diagram showing an exemplary Manhattan distance according to an embodiment of the present application is shown.

[0057] The Manhattan distance is the sum of the absolute distances between two points in the standard coordinate system. Figure 3A Taking point A and point B in the figure as an example, the coordinates of point A are (x1, y1) and the coordinates of point B are (x2, y2). Then the Manhattan distance from point A to point B is |x2-x1|+|y2-y1|.

[0058] Figure 3B FIG. 4 is a schematic diagram of an exemplary second digital logic circuit 300 a according to an embodiment of the present application. Figure 3C FIG. 4 is a schematic diagram of an exemplary third digital logic circuit 300 b according to an embodiment of the present application.

[0059] like Figure 3BAs shown, the second digital logic circuit 300a may include a fifth unit 302a, a sixth unit 304a, a seventh unit 306a and an eighth unit 308a. Taking the fifth pin 312a, the sixth pin 316a and the seventh pin 314a as examples, the fifth pin 312a is the signal driving end of the netlist, and the seventh pin 314a and the sixth pin 316a are the signal receiving ends of the netlist. For the second digital logic circuit 300a, the minimum rectangular area covering the signal driving end and the signal receiving end may be the third rectangular area 310a. Since the greater the Manhattan distance between pins, the greater the netlist delay may be, therefore, in some embodiments, for a signal driving end of a netlist to multiple signal receiving ends of the netlist, the maximum Manhattan distance from the signal driving end to the signal receiving end is selected as a constraint condition. For example, as Figure 3B As shown, in the third rectangular area 310a, the Manhattan distance from the fifth pin 312a to the seventh pin 314a is greater than the Manhattan distance from the fifth pin 312a to the sixth pin 316a. If a path passes through the third connection 320a (fifth pin 312a to seventh pin 314a) of the netlist during placement and routing, rather than the fourth connection 318a (fifth pin 312a to sixth pin 316a) of the netlist, a larger netlist delay may be generated. Therefore, the maximum Manhattan distance (in this example, the Manhattan distance from the fifth pin 312a to the seventh pin 314a) can be used as a constraint to screen out netlists with potential larger delays.

[0060] like Figure 3C As shown, the third digital logic circuit 300b may include a ninth unit 302b, a tenth unit 304b, an eleventh unit 306b and a twelfth unit 308b. Taking the eighth pin 312b, the ninth pin 316b and the tenth pin 314b as examples, the eighth pin 312b is the signal driving end of the netlist, and the tenth pin 314b and the ninth pin 316b are the signal receiving ends of the netlist. For the third digital logic circuit 300b, the minimum rectangular area covering the signal driving end and the signal receiving end may be the fourth rectangular area 310b. Since the greater the Manhattan distance between pins, the greater the netlist delay may be, therefore, in some embodiments, for a signal driving end of a netlist to multiple signal receiving ends of the netlist, the maximum Manhattan distance from the signal driving end to the signal receiving end is selected as a constraint condition. For example, as Figure 3CAs shown, in the fourth rectangular area 310b, the Manhattan distance from the eighth pin 312b to the tenth pin 314b is greater than the Manhattan distance from the eighth pin 312b to the ninth pin 316b. If a path passes through the fifth connection 320b (the eighth pin 312b to the tenth pin 314b) of the netlist during placement and routing, rather than the sixth connection 318b (the eighth pin 312b to the ninth pin 316b) of the netlist, a larger netlist delay may be generated. Therefore, the maximum Manhattan distance (in this example, the Manhattan distance from the eighth pin 312b to the tenth pin 314b) can be used as a constraint to screen out netlists with potential larger delays.

[0061] As mentioned above, the delays of multiple netlists with the same BBOX area will vary greatly. Figure 3B and Figure 3C , taking the third rectangular area 310a and the fourth rectangular area 310b having the same area as an example, for example, the area of ​​the third rectangular area 310a may be 10×10, and the area of ​​the fourth rectangular area 310b may be 25×4. Thus, in the second digital logic circuit 300a, the coordinates of the fifth pin 312a may be (0,10), and the coordinates of the seventh pin 314a may be (10,0), and the maximum Manhattan distance may be the Manhattan distance from the fifth pin 312a to the seventh pin 314a (e.g., the first distance) may be 20; and in the third digital logic circuit 300b, the coordinates of the eighth pin 312b may be (0,4), and the coordinates of the tenth pin 314b may be (25,0), and the maximum Manhattan distance may be the Manhattan distance from the eighth pin 312b to the tenth pin 314b (e.g., the second distance) may be 29.

[0062] It can be seen that for the third rectangular area 310a and the fourth rectangular area 310b of the same area, the maximum Manhattan distance from the signal driver to the signal receiving end will be quite different. For the netlist with a larger maximum Manhattan distance from the signal driver to the signal receiving end, it is more likely to have a larger delay. Therefore, in some embodiments, on the basis of taking the minimum rectangular area covering the signal driver and the signal receiving end as a constraint condition, the maximum Manhattan distance from the signal driver to the signal receiving end can be further taken as a constraint condition, so as to screen out the netlist with a larger maximum Manhattan distance in the digital logic circuit. For example, assuming Figure 3B and Figure 3C The units shown in the figure are located in the same digital logic circuit, Figure 3B The Manhattan distance between the fifth pin 312a and the seventh pin 314a is less than Figure 3CIf the Manhattan distance from the eighth pin 312 b to the tenth pin 314 b is determined, the netlist having the Manhattan distance from the eighth pin 312 b to the tenth pin 314 b as the maximum Manhattan distance (eg, the target distance) can be screened out.

[0063] On the basis that the area of ​​the minimum rectangular region covering the signal driver and the signal receiving end is the same as the Manhattan distance, the more signal driver and signal receiving ends there are, the more paths are affected, and the greater the probability of paths generating large delays. Therefore, in some embodiments, the first number of signal driver and the second number of signal receiving can be further used as constraints to screen out netlists with more signal driver and signal receiving ends.

[0064] In some embodiments, the area of ​​the minimum rectangular region covering the signal driving end of the netlist and the signal receiving end of the netlist, the maximum Manhattan distance from the signal driving end of the netlist to the signal receiving end of the netlist, and the number of the signal driving end of the netlist and the signal receiving end of the netlist are used as constraints, which can be expressed as the following formula:

[0065]

[0066]

[0067] in, Indicates the target value, which corresponds one-to-one with the netlist. Represents the area of ​​the smallest rectangular region covering the signal driver and signal receiver of the netlist. Indicates the maximum Manhattan distance from the signal driver to the signal receiver. represents the first value, represents the second value, represents the coefficient, Indicates the number of signal drivers and signal receivers in the current netlist. Represents the total number of signal drivers and signal receivers in the netlist with the largest number of signal drivers and signal receivers in the digital logic circuit.

[0068] It can be seen from the above formula that the larger the area of ​​the minimum rectangular area covering the signal driver and the signal receiving end of the netlist, the larger the target value; the larger the maximum Manhattan distance from the signal driver to the signal receiving end, the larger the target value. When the areas of the minimum rectangular areas covering the signal driver and the signal receiving end of the netlist are the same, the larger the maximum Manhattan distance from the signal driver to the signal receiving end, the larger the target value; when the maximum Manhattan distance from the signal driver to the signal receiving end is the same, the larger the area of ​​the minimum rectangular area covering the signal driver and the signal receiving end of the netlist, the larger the target value. Therefore, by using the area of ​​the minimum rectangular area covering the signal driver and the signal receiving end of the netlist and the maximum Manhattan distance from the signal driver to the signal receiving end as constraints, the netlist with a larger Manhattan distance in the same minimum rectangular area can be screened out, and the netlist with a larger area of ​​the minimum rectangular area in the same Manhattan distance can be screened out, thereby improving the accuracy of the screened netlist as a netlist with a larger path delay.

[0069] The coefficient is adjusted by the ratio of the number of pins in the current netlist to the number of pins in the maximum netlist in the digital logic circuit. The coefficient is a value normalized to the interval (0,1]. For example, the digital logic circuit may include a third netlist and a fourth netlist. The third netlist may include a third signal driver and a third signal receiver. The fourth netlist may include a fourth signal driver and a fourth signal receiver. If the sum of the number of the third signal driver and the third signal receiver is greater than the sum of the number of the fourth signal driver and the fourth signal receiver, the sum of the number of the third signal driver and the third signal receiver is used as the third number in the above formula ( ), the sum of the number of signal driving terminals (for example, the first number) and the number of signal receiving terminals (for example, the second number) of the current netlist is used as the fourth number ( ), so as to control and identify the netlist with a large number of pins according to the adjustment coefficient. It can be understood that the more pins a netlist has, the larger the coefficient is, and accordingly, the larger the calculated target value is.

[0070] The target value is calculated by the above formula. In some embodiments, the target values ​​can be sorted, for example, from large to small, and a certain proportion (for example, target proportion) of netlists with large target values ​​are selected from the sorting results as target netlists for layout and routing optimization, for example, controlling the winding method of the target netlist, etc., so as to give priority to optimizing netlists that may have larger delays during the layout and routing iteration process, so as to reduce the delay of the netlist and avoid timing violations, thereby optimizing the timing of the digital logic circuit.

[0071] Figure 4FIG. 4 is a flow chart of an exemplary method 400 for optimizing a digital logic circuit according to an embodiment of the present application. Figure 4 As shown, method 400 may include the following steps.

[0072] In step 402, a netlist of the digital logic circuit is obtained.

[0073] In step 404, the signal driver end (eg, Figure 2A The second pin 214 in the embodiment) and the signal receiving end (eg, Figure 2A The first pin 212 and the third pin 216 in FIG.

[0074] In step 406, a constraint condition is determined based on the signal driving end and the signal receiving end.

[0075] In some embodiments, the constraint condition includes an area covering the signal driving end and the signal receiving end (eg, Figure 2A The area of ​​the first rectangular area 210 in the figure, the target distance between the signal driver and the signal receiving end, the first number of the signal driver and the second number of the signal receiving end are used as constraints to identify netlists with large delays in digital logic circuits. The maximum Manhattan distance from the signal driver to the signal receiving end is used as a constraint to screen out netlists with potentially large delays. The number of signal drivers and signal receiving ends is used as a constraint to screen out netlists with more signal drivers and signal receiving ends.

[0076] In step 408, a target netlist of the digital logic circuit is determined according to the constraint conditions.

[0077] In some embodiments, the target distance includes a first distance and a second distance, and determining the target netlist of the digital logic circuit according to the constraint condition further includes: in response to the first distance being greater than the second distance, determining the target netlist according to the first distance. The maximum Manhattan distance from the signal driving end to the signal receiving end is used as a constraint condition, thereby further screening out the netlist with larger delay.

[0078] In some embodiments, the area includes a first area and a second area, and determining the target netlist of the digital logic circuit according to the constraint condition further includes: in response to the first area being larger than the second area, determining the target netlist according to the first area. The area of ​​the minimum rectangular area covering the signal driving end and the signal receiving end of each netlist is used as a constraint condition to identify a netlist with a larger delay in the digital logic circuit.

[0079] In some embodiments, the digital logic circuit includes a first netlist and a second netlist, the first netlist includes a first signal driver and a first signal receiver, the second netlist includes a second signal driver and a second signal receiver, and the determining the target netlist of the digital logic circuit according to the constraint condition further includes: in response to the sum of the number of the first signal driver and the first signal receiver being greater than the sum of the number of the second signal driver and the second signal receiver, determining the target netlist according to the first netlist. The number of signal drivers and signal receivers is used as a constraint condition to screen out netlists with more signal drivers and signal receivers.

[0080] In some embodiments, the determining the target netlist of the digital logic circuit according to the constraint condition further includes: calculating the square of the target distance to obtain a first value; calculating the sum of the first value and the area to obtain a second value; and determining the target netlist according to the second value, the first number, and the second number. By using the area of ​​the minimum rectangular area covering the signal driving end and the signal receiving end of the netlist and the maximum Manhattan distance from the signal driving end to the signal receiving end as constraint conditions, netlists with larger Manhattan distances in the same minimum rectangular area can be screened out, and netlists with larger areas of the minimum rectangular area in the same Manhattan distance can be screened out, thereby improving the accuracy of the screened netlists as netlists with larger path delays.

[0081] In some embodiments, the digital logic circuit includes a third netlist and a fourth netlist, the third netlist includes a third signal driver and a third signal receiving terminal, the fourth netlist includes a fourth signal driver and a fourth signal receiving terminal, and the determining the target netlist of the digital logic circuit according to the constraint condition further includes: in response to the sum of the number of the third signal driver and the third signal receiving terminal being greater than the sum of the number of the fourth signal driver and the fourth signal receiving terminal, obtaining a third number according to the sum of the number of the third signal driver and the third signal receiving terminal; calculating the sum of the first number and the second number to obtain a fourth number; calculating the ratio of the fourth number to the third number to obtain a third value; determining the target netlist according to the third value, the area and the target distance. By taking the ratio of the number of pins of the current netlist to the number of pins of the maximum netlist in the digital logic circuit as an adjustment coefficient, the influence of the number of pins of the netlist on the identification of the target netlist is controlled, and a netlist with a large number of pins is tended to be selected.

[0082] In some embodiments, the digital logic circuit includes multiple netlists, the multiple netlists correspond to multiple constraints, and the determining the target netlist of the digital logic circuit according to the constraints further includes: obtaining multiple target values ​​according to the constraints, the multiple target values ​​correspond to the multiple netlists one by one; sorting the multiple target values ​​to obtain a sorting result; and determining the target netlist according to the sorting result and the target ratio. By selecting a netlist with a target ratio having a large target value, the netlist with a potentially large delay is optimized first, so as to reduce the delay of the netlist and avoid timing violations, thereby optimizing the timing of the digital logic circuit.

[0083] In step 410, the digital logic circuit is optimized based on the target netlist.

[0084] In some embodiments, the optimizing the digital logic circuit based on the target netlist further includes: controlling the routing of the target netlist to optimize the digital logic circuit. By controlling the routing of the target netlist (for example, avoiding large detours), the delay of the netlist is reduced and timing violations are avoided, thereby optimizing the timing of the digital logic circuit.

[0085] The present application provides a method, computer device and storage medium for optimizing digital logic circuits. The method includes: obtaining a netlist of the digital logic circuit, determining a signal driver and a signal receiver of the netlist, determining constraints based on the signal driver and the signal receiver, determining a target netlist of the digital logic circuit according to the constraints, and optimizing the digital logic circuit based on the target netlist. The above method can identify the target netlist in the digital logic circuit without establishing a timing diagram, saving the time of establishing the timing diagram, thereby improving the optimization efficiency of the digital logic circuit.

[0086] It should be noted that the method of the embodiment of the present application can be performed by a single device, such as a computer or server. The method of this embodiment can also be applied to a distributed scenario and completed by multiple devices cooperating with each other. In the case of such a distributed scenario, one of the multiple devices can only perform one or more steps in the method of the embodiment of the present application, and the multiple devices will interact with each other to complete the described method.

[0087] It should be noted that the above describes some embodiments of the present application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the above embodiments and still achieve the desired results. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0088] Figure 5 The schematic diagram of the structure of an exemplary computer device 500 according to an embodiment of the present application is shown. The computer device 500 may include: a first processor 502, a memory 504, a network interface 506, a peripheral interface 508 and a bus 510. The first processor 502, the memory 504, the network interface 506 and the peripheral interface 508 are connected to each other in communication within the device through the bus 510.

[0089] The first processor 502 may be a central processing unit (CPU), an image processor, a neural network processor (NPU), a microcontroller (MCU), a programmable logic device, a digital signal processor (DSP), an application specific integrated circuit (ASIC), or one or more integrated circuits. The first processor 502 may be used to perform functions related to the technology described in this application. In some embodiments, the first processor 502 may also include multiple processors integrated into a single logical component. Figure 5 As shown, the first processor 502 may include multiple processors, for example, a second processor 502a, a third processor 502b, and a fourth processor 502c.

[0090] The memory 504 may be configured to store data (eg, instruction sets, computer codes, intermediate data, etc.). Figure 5 As shown, the stored data may include program instructions (e.g., program instructions for implementing the technical solution of the present application) and data to be processed. The first processor 502 may also access the stored program instructions and data, and execute the program instructions to operate on the data to be processed. The memory 504 may include a volatile storage device or a non-volatile storage device. In some embodiments, the memory 504 may include a random access memory (RAM), a read-only memory (ROM), an optical disk, a magnetic disk, a hard disk, a solid-state drive (SSD), a flash memory, a memory stick, etc.

[0091] The network interface 506 can be configured to provide the computer device 500 with communication with other external devices via a network. The network can be any wired or wireless network capable of transmitting and receiving data. For example, the network can be a wired network, a local wireless network (e.g., Bluetooth, WiFi, near field communication (NFC), etc.), a cellular network, the Internet, or a combination thereof. It is understood that the type of network is not limited to the above specific examples. In some embodiments, the network interface 506 can include any number of network interface controllers (NICs), radio frequency modules, transceivers, modems, routers, gateways, adapters, cellular network chips, etc., in any combination.

[0092] The peripheral interface 508 can be configured to connect the computer device 500 to one or more peripheral devices to achieve information input and output. For example, the peripheral devices can include input devices such as a keyboard, a mouse, a touch pad, a touch screen, a microphone, and various sensors, and output devices such as a display, a speaker, a vibrator, and an indicator light.

[0093] The bus 510 may be configured to transmit information between various components of the computer device 500 (e.g., the first processor 502, the memory 504, the network interface 506, and the peripheral interface 508), such as an internal bus (e.g., a processor-memory bus), an external bus (USB port, PCI-E bus), etc.

[0094] It should be noted that, although the above device only shows the first processor 502, the memory 504, the network interface 506, the peripheral interface 508 and the bus 510, in the specific implementation process, the device may also include other components necessary for normal operation. In addition, it can be understood by those skilled in the art that the above device may also only include the components necessary for implementing the embodiment of the present application, and does not necessarily include all the components shown in the figure.

[0095] The computer device of the above embodiment is used to implement the corresponding method 400 in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be described in detail here.

[0096] Based on the same technical concept, corresponding to any of the above-mentioned embodiments, the present application also provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute method 400 described in any of the above embodiments.

[0097] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, read-only compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, tape disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device.

[0098] The computer instructions stored in the storage medium of the above embodiment are used to enable the computer to execute the method 400 described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0099] A person skilled in the art should understand that the discussion of any of the above embodiments is merely illustrative and is not intended to imply that the scope of the present application (including the claims) is limited to these examples. In line with the concept of the present application, the technical features in the above embodiments or different embodiments may be combined, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present application as described above, which are not provided in detail for the sake of simplicity.

[0100] In addition, to simplify the description and discussion, and in order not to make the embodiments of the present application difficult to understand, the known power / ground connections to the integrated circuit (IC) chip and other components may or may not be shown in the provided drawings. In addition, the device may be shown in the form of a block diagram to avoid making the embodiments of the present application difficult to understand, and this also takes into account the fact that the details of the implementation of these block diagram devices are highly dependent on the platform on which the embodiments of the present application are to be implemented (that is, these details should be fully within the scope of understanding of those skilled in the art). Where specific details (e.g., circuits) are set forth to describe exemplary embodiments of the present application, it is obvious to those skilled in the art that the embodiments of the present application can be implemented without these specific details or with changes in these specific details. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0101] Although the present application has been described in conjunction with specific embodiments of the present application, many alternatives, modifications and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the discussed embodiments.

[0102] The embodiments of the present application are intended to cover all such substitutions, modifications and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present application should be included in the scope of protection of the present application.

Claims

1. A method for optimizing digital logic circuits, It is characterized in that include: Obtaining a netlist of the digital logic circuit; Determine a signal driving end and a signal receiving end of the netlist; Determine a constraint condition based on the signal driving end and the signal receiving end, the constraint condition is used to screen a netlist with a larger delay in the digital logic circuit, the constraint condition includes an area covering the signal driving end and the signal receiving end, a target distance between the signal driving end and the signal receiving end, a first number of the signal driving ends, and a second number of the signal receiving ends; Determine a target netlist of the digital logic circuit according to the constraint conditions; The digital logic circuit is optimized based on the target netlist.

2. The method according to claim 1, It is characterized in that The area includes a first area and a second area, and determining a target netlist of the digital logic circuit according to the constraint condition further includes: In response to the first area being greater than the second area, the target netlist is determined according to the first area.

3. The method according to claim 1, It is characterized in that The target distance includes a first distance and a second distance, and determining the target netlist of the digital logic circuit according to the constraint condition further includes: In response to the first distance being greater than the second distance, the target netlist is determined according to the first distance.

4. The method according to claim 1, It is characterized in that The digital logic circuit includes a first netlist and a second netlist, the first netlist includes a first signal driving end and a first signal receiving end, the second netlist includes a second signal driving end and a second signal receiving end, and the determining of the target netlist of the digital logic circuit according to the constraint condition further includes: In response to the sum of the number of the first signal driving terminals and the first signal receiving terminals being greater than the sum of the number of the second signal driving terminals and the second signal receiving terminals, the target netlist is determined according to the first netlist.

5. The method according to claim 1, It is characterized in that Determining the target netlist of the digital logic circuit according to the constraint conditions further comprises: Calculating the square of the target distance to obtain a first value; Calculating the sum of the first value and the area to obtain a second value; The target netlist is determined according to the second value, the first quantity and the second quantity.

6. The method according to claim 1, It is characterized in that The digital logic circuit includes a third netlist and a fourth netlist, the third netlist includes a third signal driving end and a third signal receiving end, the fourth netlist includes a fourth signal driving end and a fourth signal receiving end, and determining the target netlist of the digital logic circuit according to the constraint condition further includes: In response to the sum of the number of the third signal driving end and the third signal receiving end being greater than the sum of the number of the fourth signal driving end and the fourth signal receiving end, obtaining a third number according to the sum of the number of the third signal driving end and the third signal receiving end; calculating the sum of the first quantity and the second quantity to obtain a fourth quantity; calculating a ratio of the fourth quantity to the third quantity to obtain a third value; The target netlist is determined according to the third value, the area and the target distance.

7. The method according to claim 1, It is characterized in that The digital logic circuit includes a plurality of netlists, the plurality of netlists correspond to a plurality of the constraints, and determining a target netlist of the digital logic circuit according to the constraints further includes: According to the plurality of constraint conditions, a plurality of target values ​​are obtained, wherein the plurality of target values ​​correspond one-to-one to the plurality of netlists; Sorting the multiple target values ​​to obtain a sorting result; The target netlist is determined according to the sorting result and the target ratio.

8. The method according to claim 1, It is characterized in that The optimizing the digital logic circuit based on the target netlist further comprises: The routing of the target netlist is controlled to optimize the digital logic circuit.

9. A computer device, It is characterized in that include: One or more processors, memory; as well as one or more programs; The one or more programs are stored in the memory and executed by one or more processors, and the programs include instructions for executing the method according to any one of claims 1-8.

10. A non-volatile computer-readable storage medium containing a computer program, It is characterized in that When the computer program is executed by one or more processors, the processors are caused to perform the method according to any one of claims 1 to 8.