Integrated circuit layout method and device, equipment and medium

By dividing the module into layout grids and wiring grids, cutting into module fragments and merging areas with lack of resources, optimizing the layout, the problems of overlap between modules and wiring congestion in integrated circuit layout are solved, and the quality and performance of layout solutions are improved.

CN119067050APending Publication Date: 2024-12-03FUZHOU LIXIN TECH CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

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

AI Technical Summary

Technical Problem

The existing integrated circuit layout and placement algorithms have shortcomings in dealing with overlapping between modules and wiring congestion, resulting in limited quality and performance of layout solutions.

Method used

By dividing the module to be laid out into multiple layout grids and wiring grids, and calculating the area of ​​each layout grid, cutting the module into module fragments, combining layout grids with lack of resources, introducing obstacle areas to optimize module fragmentation, and The layout of the final layout position is generated.

Benefits of technology

It effectively reduces overlap between modules, reduces wiring congestion, improves the quality of layout solutions and circuit signal transmission efficiency, and reduces manufacturing costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119067050A_ABST
    Figure CN119067050A_ABST
Patent Text Reader

Abstract

The invention provides an integrated circuit layout method and device, equipment and a medium, is applied to the technical field of integrated circuit design automation and chip layout planning, and forms a larger layout space by combining layout grids lacking layout and wiring resources with surrounding layout grids. Meanwhile, each module is divided into module fragments corresponding to the layout grids in size, so that the influence of resources in each layout grid on the module fragments is more obvious, consideration on an obstacle area is introduced, layout of the module fragments is performed in the combined layout grids, finally, the module fragments are combined into the modules, and a final layout position is generated. Therefore, the final layout effect is improved, overlapping among modules is effectively reduced, wiring congestion is reduced, the quality of a layout solution is improved, the circuit signal transmission efficiency and the overall performance are improved, and the manufacturing cost is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of integrated circuit design automation and chip layout planning, and specifically to an integrated circuit layout method and device, equipment, and medium. Background Art

[0002] The quality of the layout algorithm solution is crucial to integrated circuit design. The quality and rationality of the layout directly affect the subsequent wiring stage. A good solution can not only improve the performance of the chip, but also effectively reduce manufacturing costs.

[0003] At present, the mainstream layout placement algorithms mainly include analytical placement [1], simulated annealing [2] and partitioning / clustering [3]. Among them, analytical placement algorithms usually use quadratic objective functions, also known as quadratic programming (QP) models. Their application in layout problems mainly focuses on minimizing wire length, improving layout quality and reducing power consumption by optimizing objective functions. In traditional quadratic programming solvers, wire length minimization is usually expressed as a convex quadratic function, and the corresponding cell layout is obtained by solving this function. However, it has some disadvantages. For example, the generated module positions have a large degree of overlap between cells. For example, since the quadratic wire length target is only an indirect measure of the linear wire length, the generated wire length is very long.

[0004] The simulated annealing algorithm first uses a random initial layout as the current solution, and searches for the global optimal solution by randomly perturbing the current solution in each iteration. Although it can find a relatively ideal solution, it has high time complexity and is time-consuming, and cannot solve large-scale layout problems.

[0005] The partitioning algorithm divides the layout space into several sub-areas and places the units in each sub-area. Although this improves the solution efficiency, it is not conducive to optimizing the line length and there will be overlaps between modules.

[0006] Based on this, a new integrated circuit layout method is needed that can effectively improve the legalization rate.

[0007] References:

[0008] [1] N.Viswanathan and CC-N.Chu. "FastPlace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid netmodel". IEEE Transactions on Computer-Aided Design of Integrated Circuits andSystems, 24(5), 722-733.

[0009] [2] M. Bigonah, D. Abbasinezhad-Mood and M. Nikooghadam, "Dynamic prioritization and cell fixation placement algorithm based on simulatedannealing," 2017 19th International Symposium on Computer Architecture and Digital Systems (CADS), Kish Island, Iran, 2017.

[0010] [3] G. Kranas, G.-C. Tsalamagkakis, P. Oikonomou and ANDadaliaris, "PyPUT: Python-based Placement Utilities Toolset," 2018 South-Eastern European Design Automation, Computer Engineering, Computer Networks and Society Media Conference (SEEDA_CECNSM), Kastoria, Greece, 2018. Summary of the invention

[0011] In view of this, the embodiments of this specification provide an integrated circuit layout method, device, equipment, and medium, which take into account the overlap between units and the degree of wiring congestion during the layout process, effectively improve the legalization rate, reduce the overlap between modules, optimize layout congestion, and improve the circuit signal transmission efficiency and overall performance.

[0012] The embodiments of this specification provide the following technical solutions:

[0013] The embodiment of this specification provides an integrated circuit layout method, including:

[0014] Dividing the module to be laid out into a plurality of layout grids and a plurality of routing grids, wherein the size of the layout grid is larger than the size of the routing grid, and one layout grid corresponds to one or more routing grids;

[0015] Calculating a first area and a second area of ​​each layout grid, and cutting the module into a plurality of module fragments according to the size of the layout grid; wherein the first area is an area occupied by the module, the second area is an area not occupied by the module, and each layout grid has at least one module fragment;

[0016] Traversing the layout resources and routing resources in each layout grid, and determining whether the currently traversed layout grid belongs to a layout grid to be merged whose occupied resource quantity overflows;

[0017] If there is at least one layout grid to be merged, each layout grid to be merged is merged with a corresponding adjacent layout grid to obtain a target layout area, wherein the adjacent layout grid is a layout grid with no overflow in the number of resources;

[0018] The target layout area is divided into a plurality of sub-areas according to the shape of the module, and each of the module fragments is placed in a corresponding sub-area.

[0019] The embodiment of this specification also provides an integrated circuit layout device, including:

[0020] Initialization module: used for dividing the module to be laid out into a plurality of layout grids and a plurality of routing grids, wherein the size of the layout grid is larger than the size of the routing grid, and one layout grid corresponds to one or more routing grids;

[0021] Module fragmentation module: used to calculate the first area and the second area of ​​each layout grid, and cut the module into multiple module fragments according to the size of the layout grid; the first area is the area occupied by the module, the second area is the area not occupied by the module, and each layout grid has at least one module fragment;

[0022] Merging module: used to traverse the layout resources and routing resources in each layout grid, and determine whether the currently traversed layout grid belongs to the layout grid to be merged with overflowed occupied resources;

[0023] If there is at least one layout grid to be merged, each layout grid to be merged is merged with a corresponding adjacent layout grid to obtain a target layout area, wherein the adjacent layout grid is a layout grid with no overflow in the number of resources;

[0024] Module fragment placement module: divides the target layout area into multiple sub-areas according to the shape of the module, and places each of the module fragments in the corresponding sub-area.

[0025] The embodiment of the present specification also provides an electronic device, characterized in that it includes:

[0026] At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor so that the at least one processor can perform: any one of the integrated circuit layout methods described above.

[0027] The embodiments of the present specification also provide a computer storage medium, wherein the computer storage medium stores computer executable instructions, and when the computer executable instructions are executed by a processor, the integrated circuit layout method described in any one of the above is performed.

[0028] Compared with the prior art, the at least one technical solution adopted in the embodiments of this specification can achieve the following beneficial effects:

[0029] The present application forms a larger layout space by merging layout grids lacking layout and routing resources with surrounding layout grids, and at the same time divides each module into module fragments corresponding to the size of the layout grid, so that the impact of resources in each layout grid on the module fragments is more significant. At the same time, consideration of obstacle areas is introduced, and module fragments are laid out in the merged layout grids. Finally, the module fragments are merged into modules to generate the final layout position, thereby improving the final layout effect, effectively reducing overlap between modules, reducing routing congestion, and improving the quality of layout solutions. This not only improves the circuit signal transmission efficiency and overall performance, but also reduces manufacturing costs. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0031] Figure 1 is a flow chart of a layout grid for calculating layout grid resources and merging resource overflow in the present application;

[0032] Figure 2 is a flowchart of allocating module fragments to target layout areas in this application;

[0033] Figure 3 It is a flow chart of the integrated circuit layout method in this application. DETAILED DESCRIPTION

[0034] The embodiments of the present application are described in detail below with reference to the accompanying drawings.

[0035] The following describes the implementation methods of the present application through specific examples, and those skilled in the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. The present application can also be implemented or applied through other different specific implementation methods, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present application. It should be noted that, in the absence of conflict, the following embodiments and the features in the embodiments can be combined with each other. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work belong to the scope of protection of the present application.

[0036] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein can be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present application, it should be understood by those skilled in the art that an aspect described herein can be implemented independently of any other aspect, and two or more of these aspects can be combined in various ways. For example, any number and aspect described herein can be used to implement the device and / or practice the method. In addition, other structures and / or functionalities other than one or more of the aspects described herein can be used to implement this device and / or practice this method.

[0037] It should also be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present application. The drawings only show components related to the present application rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed arbitrarily, and the component layout may also be more complicated.

[0038] Additionally, in the following description, specific details are provided to facilitate a thorough understanding of the examples. However, it will be understood by those skilled in the art that the examples can be practiced without these specific details.

[0039] In the layout design stage, it is very important to adopt an effective layout method, which directly affects the subsequent wiring stage. The quality and rationality of the layout determine the performance, power consumption and final manufacturing cost of the chip.

[0040] Therefore, in the layout design stage, the mainstream layout placement methods are mainly the following three:

[0041] One is the analytical placement method, which usually uses a quadratic objective function, namely the quadratic programming (QP) model. In traditional quadratic programming solvers, the line length minimization is usually expressed as a convex quadratic function. The corresponding unit layout is obtained by solving the function. Although the objective function can be optimized to minimize the connection length, improve the layout quality and reduce power consumption, there are some shortcomings. The generated module positions have a large degree of overlap between cells, and since the quadratic line length target is only an indirect measure of the linear line length, it will lead to excessive line length.

[0042] The second is the simulated annealing algorithm, which uses a randomly generated initial layout as the starting point of the current solution and searches for the global optimal solution by randomly perturbing the current solution during the iteration process. Although a better solution can be found in theory, the algorithm has a high time complexity and is time-consuming, making it difficult to cope with large-scale layout problems.

[0043] Another is the partitioning / clustering algorithm, which divides the layout space into several sub-areas and places the units in each sub-area. Although this can improve the solution efficiency, it is not conducive to optimizing the line length and there will be overlaps between modules.

[0044] In view of this, the inventors discovered through research and improvement exploration that the existing layout placement method does not have an effective mechanism to deal with the overlap and wiring congestion problems between modules, resulting in limited signal transmission efficiency and overall performance of the final layout.

[0045] Based on this, an embodiment of the present specification proposes an integrated circuit layout method: the overall idea is: merge the layout grids that lack layout resources and wiring resources with the surrounding layout grids to form a larger layout space, and at the same time divide each module into module fragments corresponding to the size of the layout grid, so that the resources in each layout grid have a more significant impact on the module fragments, and at the same time introduce considerations for the obstacle area (blockage), layout the module fragments in the merged layout grid, and finally merge the module fragments into modules to generate the final layout position, thereby improving the final layout effect, effectively reducing the overlap between modules, reducing wiring congestion, and improving the quality of the layout solution, which not only improves the circuit signal transmission efficiency and overall performance, but also reduces manufacturing costs.

[0046] The technical solutions provided by various embodiments of the present application are described below in conjunction with the accompanying drawings.

[0047] like Figure 3 As shown, the embodiment of this specification provides an integrated circuit layout method, including the following steps:

[0048] Step S1, dividing the module to be laid out into a plurality of layout grids and a plurality of routing grids, wherein the size of the layout grid is larger than the size of the routing grid, and one layout grid corresponds to one or more routing grids.

[0049] Specifically, according to the position coordinates of the units (i.e., modules) on the chip, and taking into account the overlap and layout congestion between units, the modules to be laid out are divided into multiple layout grids and multiple routing grids. The layout grids are used for the preliminary placement of the modules, and the routing grids are used for subsequent detailed routing.

[0050] The size of the layout grid is larger than the size of the routing grid, and one layout grid can correspond to multiple routing grids, so that layout and routing issues can be considered at different scales.

[0051] The modules in this application include: macro cells and standard cells.

[0052] Step S2, calculating the first area and the second area of ​​each layout grid, and cutting the module into multiple module fragments according to the size of the layout grid; wherein the first area is the area occupied by the module, the second area is the area not occupied by the module, and each layout grid has at least one module fragment.

[0053] Specifically, the area occupied by the module in each layout grid is calculated, and the degree of module occupation of wiring space is evaluated, so as to determine the actual demand for wiring resources; the area not occupied by the module in each layout grid is calculated, and the amount of wiring resources that each layout grid can provide is evaluated.

[0054] Finally, according to the size of the layout grid, the module is cut into multiple module fragments (shatter modules), and the size of each module fragment is the same as the size of the layout grid, so as to ensure the reasonable placement of the module fragments in the layout grid.

[0055] Step S3: traverse the layout resources and routing resources in each layout grid, and determine whether the currently traversed layout grid is a layout grid to be merged with overflowed occupied resources.

[0056] Specifically, in combination with the above embodiment, the layout resources and wiring resources in each layout grid are traversed, and for each layout grid, it is determined whether the first area (the area occupied by the module) exceeds the total area of ​​the layout grid or exceeds the preset maximum area occupancy rate. If so, it indicates that there is a resource overflow. When a resource overflow is found, the currently traversed layout grid is identified as a layout grid to be merged.

[0057] Step S4: If there is at least one layout grid to be merged, each layout grid to be merged is merged with a corresponding adjacent layout grid to obtain a target layout area, wherein the adjacent layout grid is a layout grid with no overflow in the number of resources.

[0058] In combination with the above implementation, if there is at least one layout grid to be merged, for each layout grid to be merged, its adjacent layout grids are determined, and these adjacent layout grids are layout grids whose resource quantities do not overflow, and the layout grid to be merged is merged with the selected adjacent layout grids to form a larger target layout area, thereby ensuring that it does not overflow, that is, the layout resources and routing resources are sufficient to accommodate the existing module fragments.

[0059] Step S5: Divide the target layout area into multiple sub-areas according to the shape of the module, and place each of the module fragments in a corresponding sub-area.

[0060] Specifically, the target layout area is divided into multiple sub-areas by recursive cutting until the module fragments (shatter modules) contained therein meet the layout conditions, that is, when the layout area (placement box) is small enough, the number of internal module fragments (shatter modules) is small enough or the total area of ​​module fragments (shatter modules) is small enough, the module fragments are placed in the corresponding sub-areas in a predetermined order, thereby effectively handling complex layout problems, improving the final layout effect, better reducing layout overlap, and improving the quality of layout solution.

[0061] In implementation, such as Figure 1 As shown, the placement grid and routing grid are initialized according to the location and area of ​​the macro cell and the standard cell, and the routing resource demand and routing resource supply in each placement bin are calculated according to the data such as the netlist connection relationship. Finally, each module is cut into module fragments according to the size of the placement grid, and each module fragment has the same size as the layout grid.

[0062] The layout grids with overflowing resources are calculated based on the layout resources (area) and routing resources in each layout grid, and the layout grids with overflowing resources are merged with nearby layout grids to obtain a larger target layout area to ensure that they do not overflow.

[0063] These layout areas are cut recursively until the module fragments contained therein meet the conditions for layout, and the module fragments are placed in order, and the latest layout position of the module is set according to the position of the corresponding module fragment.

[0064] In some embodiments, before dividing the modules to be laid out into a plurality of layout grids and a plurality of routing grids, the size of the layout grid and the size of the routing grid are respectively determined based on a preset percentage of a chip core width.

[0065] The core width of a chip refers to the width of the core area of ​​the chip, the chip area used for actual circuit layout and wiring, excluding the peripheral area used for chip input and output (I / O).

[0066] Specifically, the size of the layout grid and routing grid is designed based on a percentage of the chip core width, which not only simplifies the application of design rules and ensures the consistency of the design across the entire chip, but also allows for adaptive adjustments based on different chip sizes and complexities, thereby adapting to the size requirements of different process nodes.

[0067] When the grid is too large, the routing path selection is limited, the risk of overlap between modules is increased, and the layout space of the chip cannot be fully utilized, resulting in a waste of resources. When the grid is too small, the number of grids that need to be processed increases significantly, resulting in excessive calculations, and the layout and routing become unnecessarily complex and difficult to manage. According to research, when the size of the layout grid is determined to be 1% of the chip core width and the size of the routing grid is determined to be 0.5% of the chip core width, it can not only improve the algorithm's computational efficiency, but also help reduce congestion and overlap problems during layout and routing, and improve the quality and efficiency of the design.

[0068] In some embodiments, dividing the modules to be laid out into a plurality of layout grids and a plurality of routing grids comprises:

[0069] The half-circle length modeling relationship is used for the connection relationship of the netlist to simplify the calculation of the wiring length and reduce the wiring congestion area;

[0070] For a net that only involves two pins connected, if the net is completely within a routing grid, the half-circle length of the net is stored as a temporary variable, and the formula is:

[0071] wl_storage=HPWL(nets), where HPWL(nets) represents the half perimeter of a specific net;

[0072] Then, according to the given number of metal layers, the metal layer where each pin is located, the number of tracks in each wiring grid and the line spacing, the temporary variable is converted into the wiring resource requirement, and the formula is:

[0073] R demand =ratio demand *wl_storage;

[0074] The conversion ratio formula is:

[0075]

[0076] Among them, track hori Indicates the number of tracks in each routing grid in the horizontal direction; track vert Indicates the number of tracks in each routing grid in the vertical direction; width grid Indicates the width of each routing grid; height grid Indicates the height of each wiring grid; pitch indicates the line spacing.

[0077] In some embodiments, dividing the modules to be laid out into a plurality of layout grids and a plurality of routing grids further comprises:

[0078] Taking the calculation of horizontal wiring resource provision as an example, the number of wirings that can be routed in each wiring grid is determined by the width and line spacing of the layout grid. The formula is:

[0079] Then, the number of routable routes of each routing grid is multiplied by a fixed ratio to obtain the routing resource provision of each routing grid, and the formula is:

[0080] Calculate the average value of the routing resource provided by each routing grid and its adjacent right routing grid;

[0081] The average value of the routing resource provision of all routing grids is summed to obtain the routing resource provision of the placement grid. The formula is:

[0082] in, Represents the available resources for routing of the placement grid at the (x, y) position; capacity i, is the available routing resource of the routing grid at the (i, j)th position in the layout grid; capacity i+1, is the available routing resource of the routing grid at the (i+1, j)th position of the layout grid; wherein m is the ratio of the layout grid length to the routing grid length, and n is the ratio of the layout grid width to the routing grid width.

[0083] In some embodiments, the area occupied by the module and the unoccupied area in each layout grid are calculated, the module is cut into multiple module fragments according to the size of the layout grid bin, and the position, area, wiring requirement and other information of each module fragment after cutting are recorded.

[0084] In some embodiments, when determining whether the currently traversed layout grid belongs to a layout grid to be merged with overflowed occupied resources, the overflow amount of resources of the currently traversed layout grid is calculated according to the following formula:

[0085] Overflow=(S demand -S supply *Utilization)+(R demand -R supply );

[0086] Among them, S demand Represents the area of ​​the layout grid occupied by module fragments; S supply Indicates the area of ​​the area not occupied by module fragments; Utilization indicates the specified maximum area occupancy, the default value is 1; R demand Indicates the demand for wiring resources; R supply Indicates the amount of wiring resources provided.

[0087] In combination with the above embodiment, when merging the layout grid to be merged with the corresponding adjacent layout grid, all layout networks are traversed, and each time the merging is performed, the nearest layout area is selected in four directions for unidirectional merging;

[0088] After the merging direction is determined, the layout area closest to the initial layout grid or with more free areas is selected as the candidate area each time the merging is performed, and the rectangular shape of the layout area is maintained;

[0089] When the resource overflow amount is not greater than 0, the merging is ended and the layout area sequence corresponding to the merged layout grid is marked.

[0090] Specifically, when the resource overflow (Overflow) is greater than 0, it is considered that the current bin lacks sufficient layout or routing resources, and it is necessary to select an adjacent layout grid bin for expansion. The concept of placement area placement box is introduced below: a placement box covers at least one layout grid bin. When merging, each layout grid bin is regarded as a placement area placement box, and its shape is represented as a rectangle.

[0091] During implementation, all bins are traversed; each merger (expansion) only considers the area of ​​the expanded layout area size in one direction (up, down, left, and right), and selects the layout areas around the corresponding layout area as candidate layout areas; each expansion will select the layout area that is closest to the initial layout grid bin or has more free areas, and each selected layout area will gradually expand as the layout area continues to expand, but still maintain a rectangular shape; when the resource overflow after expansion is no more than 0, the loop ends, and the layout area sequence corresponding to the expanded layout grid bin is marked.

[0092] In some embodiments, when merging, only a determination is made as to whether the length or width or the aspect ratio of the layout area exceeds a specified limit.

[0093] In some embodiments, when merging, the aspect ratio of the layout area is constrained.

[0094] In some embodiments, when merging, the aspect ratio of the layout area is restricted. If the length or width and the aspect ratio of the expanded layout area exceed the specified limits after the merger, the merger is considered to have failed, and a second merger is performed. When merging for the second time, there is no need to pay attention to the aspect ratio, only whether the length or width exceeds the specified limits. After the merger is completed, information on the maximum rectangular layout area formed after the expansion of each overflowing layout grid can be obtained.

[0095] In some embodiments, dividing the target layout area into a plurality of sub-areas according to the shape of the module, and placing each of the module fragments in a corresponding sub-area, includes:

[0096] S9001: Divide the current target layout area along the center line position to divide the current target layout area into a first sub-area and a second sub-area, wherein the division position is marked as the position of the initial cutting line;

[0097] Specifically, the layout area is cut according to the shape of the module. If the length of the module is greater than the width, it is cut vertically, otherwise it is cut horizontally. When the placement box is small enough, the number of shatter modules inside is small enough, or the total area of ​​the shatter module is small enough, it is considered that the shatter module can be laid out. Otherwise, the cutting direction is selected according to the aspect ratio of the current placement box.

[0098] The first cut of the layout area is located at the horizontal / vertical center line.

[0099] S9002: Sort the module fragments from small to large according to the coordinates, and distribute them to the first sub-region in sequence. When the total area of ​​the module fragments in the first sub-region is close to the area of ​​the first sub-region, continue to distribute the remaining module fragments to the second sub-region. After the distribution is completed, adjust the position of the cutting line according to the distribution of the module fragments. The formula is as follows:

[0100]

[0101] Among them, x placement Indicates the horizontal coordinate of the lower left corner of the layout area; width box Indicates the width of the layout area; S left S represents the total area of ​​module fragments in the first sub-area of ​​the layout area; totalrepresents the total area of ​​all module fragments;

[0102] Specifically, Figure 2 As shown, the module fragments are sorted from small to large according to the coordinates and are allocated to the left (lower) half of the placement box in sequence. When the total area of ​​the shatter modules in the left (lower) half is close to the area of ​​the left (lower) half of the placement box, they are allocated to another partition. When the shatter modules are allocated, the tangent position is adjusted according to the allocation of the module fragments (taking the vertical direction as an example).

[0103] S9003: recursively perform steps S9001-S9002 for each sub-area until the target layout area after cutting meets the layout conditions, and determine whether there is only one module fragment in the corresponding target layout area;

[0104] If there is only one module fragment, determine whether there is an empty position in the first sub-area and the second sub-area of ​​the target layout area to place the module fragment without causing overlap; if there is an empty position in the first sub-area, place the module fragment at the center of the first sub-area; if there is an empty position in the second sub-area, place the module fragment at the center of the second sub-area; if both sub-areas cannot meet the placement conditions, place the module fragment at the center of the target layout area;

[0105] If there are multiple module fragments, the placement of the module fragments is calculated according to the following formula:

[0106]

[0107] Among them, x placement box Indicates the horizontal coordinate of the lower left corner of the layout area; y placement box Indicates the vertical coordinate of the lower left corner of the layout area; Num shatter module represents the number of module fragments contained in the layout area; i represents the order value of the module fragment in the layout area;

[0108] The module fragments are arranged in increasing order of coordinates.

[0109] In implementation, such as Figure 2As shown, steps S9001-S9002 are recursively performed on the two sub-areas respectively until the placement box after cutting can be laid out, that is, the placement box is small enough, the number of shatter modules inside is small enough, or the total area of ​​the shatter modules is small enough, and then the module fragments are allocated. When there is only one module fragment, it is first determined whether there is free space in the first sub-area of ​​the corresponding target layout area to place the module fragment, and there will be no overlap after placement. If so, the module fragment is placed at the center of the half area; if not, it is determined whether there is free space in the second sub-area, and if so, the module fragment is placed at the center of the half area; if there is not enough space in both areas, the module fragment is placed at the center of the layout area, so as to optimize the compactness and symmetry of the layout.

[0110] When there are multiple module fragments, the position of each module fragment is determined according to the above formula, and the module fragments are sorted in order from small to large according to the x-coordinates of the module fragments.

[0111] In this application, by continuously optimizing the layout of module fragments, all module fragments are efficiently placed in a limited space, while taking into account the compactness of the layout and the feasibility of routing, thereby reducing the overlap and routing congestion between modules and improving the quality of the layout solution.

[0112] In some embodiments, the integrated circuit layout method further includes: traversing each of the modules, selecting the geometric center of all corresponding module fragments as the new coordinates of the module, and obtaining the layout position of each module, thereby ensuring that the module fragments are more evenly distributed in the layout area.

[0113] The present invention proposes a layout algorithm that takes overlap and congestion into consideration, minimizes the overlap between modules and the degree of wiring congestion, can reduce the calculation time of the legalization stage, further improve the operating efficiency of the overall algorithm, and optimize the quality of the layout solution.

[0114] Based on the same inventive concept, the present application also provides an integrated circuit layout device corresponding to the aforementioned method example, including:

[0115] Initialization module: used for dividing the module to be laid out into a plurality of layout grids and a plurality of routing grids, wherein the size of the layout grid is larger than the size of the routing grid, and one layout grid corresponds to one or more routing grids;

[0116] Module fragmentation module: used to calculate the first area and the second area of ​​each layout grid, and cut the module into multiple module fragments according to the size of the layout grid; the first area is the area occupied by the module, the second area is the area not occupied by the module, and each layout grid has at least one module fragment;

[0117] Merging module: used to traverse the layout resources and routing resources in each layout grid, and determine whether the currently traversed layout grid belongs to the layout grid to be merged with overflowed occupied resources;

[0118] If there is at least one layout grid to be merged, each layout grid to be merged is merged with a corresponding adjacent layout grid to obtain a target layout area, wherein the adjacent layout grid is a layout grid with no overflow in the number of resources;

[0119] Module fragment placement module: divides the target layout area into multiple sub-areas according to the shape of the module, and places each of the module fragments in the corresponding sub-area.

[0120] Based on the same inventive concept, the present application also provides an electronic device based on the integrated circuit layout method, the device comprising: a processor, a memory and a computer program; wherein

[0121] The memory is used to store the computer program, and the memory may also be a flash memory. The computer program is, for example, an application program, a functional module, etc. for implementing the above method.

[0122] The processor is used to execute the computer program stored in the memory to implement each step performed by the device in the above method. For details, please refer to the relevant description in the above method embodiment.

[0123] Optionally, the memory can be independent or integrated with the processor.

[0124] When the memory is a device independent of the processor, the device may further include:

[0125] A bus is used to connect the memory and the processor.

[0126] Based on the same inventive concept, the present application also provides a computer storage medium, wherein the computer storage medium stores computer executable instructions, and when the computer executable instructions are executed by a processor, the integrated circuit layout method as described in any embodiment of the present application is executed.

[0127] It should be noted that the computer storage medium may include but is not limited to: a portable disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, an optical storage device, a magnetic storage device or any suitable combination thereof.

[0128] In a possible implementation, the present invention may also provide a form of a program product that implements data processing, which includes program code. When the program product runs on a terminal device, the program code is used to enable the terminal device to execute several steps of the method described in any of the aforementioned embodiments.

[0129] The program code for executing the present invention may be written in any combination of one or more programming languages, and may be executed entirely on a user device, partially on a user device, as an independent software package, partially on a user device and partially on a remote device, or entirely on a remote device.

[0130] In this specification, the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the embodiments described later, the description is relatively simple, and the relevant parts can be referred to the partial description of the previous embodiments.

[0131] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. An integrated circuit layout method, characterized in that: include: Dividing the module to be laid out into a plurality of layout grids and a plurality of routing grids, wherein the size of the layout grid is larger than the size of the routing grid, and one layout grid corresponds to one or more routing grids; Calculating a first area and a second area of ​​each layout grid, and cutting the module into a plurality of module fragments according to the size of the layout grid; wherein the first area is an area occupied by the module, the second area is an area not occupied by the module, and each layout grid has at least one module fragment; Traversing the layout resources and routing resources in each layout grid, and determining whether the currently traversed layout grid belongs to a layout grid to be merged whose occupied resource quantity overflows; If there is at least one layout grid to be merged, each layout grid to be merged is merged with a corresponding adjacent layout grid to obtain a target layout area, wherein the adjacent layout grid is a layout grid with no overflow in the number of resources; The target layout area is divided into a plurality of sub-areas according to the shape of the module, and each of the module fragments is placed in a corresponding sub-area.

2. The integrated circuit layout method according to claim 1, characterized in that: Before dividing the modules to be laid out into a plurality of layout grids and a plurality of routing grids, the sizes of the layout grids and the sizes of the routing grids are respectively determined based on a preset percentage of the chip core width.

3. The integrated circuit layout method according to claim 1, characterized in that: The step of dividing the modules to be laid out into a plurality of layout grids and a plurality of routing grids comprises: The half-circle length modeling relationship is used for the netlist connection relationship; For a net that only involves two pins connected, if the net is completely within a routing grid, the half-circle length of the net is stored as a temporary variable, and the formula is: wl_storage=HPWL(nets), where HPWL(nets) represents the half perimeter of a specific net; According to the number of metal layers, the metal layer where each pin is located, the number of tracks in each routing grid and the line spacing, the temporary variables are converted into the routing resource requirements, and the formula is: R demand =ratio demand *wl_storage; The conversion ratio formula is: Among them, track hori Indicates the number of tracks in each routing grid in the horizontal direction; track vert Indicates the number of tracks in each routing grid in the vertical direction; width grid Indicates the width of each wiring grid; height grid Indicates the height of each wiring grid; pitch indicates the line spacing.

4. The integrated circuit layout method according to claim 3, characterized in that: The step of dividing the modules to be laid out into a plurality of layout grids and a plurality of routing grids further includes: The number of possible routes for each routing grid is determined by the width of the layout grid and the line spacing. The formula is: The number of routable routes of each routing grid is multiplied by a fixed ratio to obtain the routing resource provided by each routing grid, and the formula is: Calculate the average value of the routing resource provided by each routing grid and its adjacent right routing grid; The average value of the routing resource provision of all routing grids is summed to obtain the routing resource provision of the placement grid. The formula is: in, Represents the available resources for routing of the placement grid at the (x, y) position; capacity i , j is the available routing resource of the routing grid at the (i, j)th position in the layout grid; capacity i+1 , j is the available routing resource of the routing grid at the (i+1, j)th position of the layout grid; wherein m is the ratio of the layout grid length to the routing grid length, and n is the ratio of the layout grid width to the routing grid width.

5. The integrated circuit layout method according to claim 1, characterized in that: When determining whether the currently traversed layout grid belongs to a layout grid to be merged with overflowed occupied resources, the resource overflow amount of the currently traversed layout grid is calculated according to the following formula: Overflow=(S demand -S supply *Utilization)(R demand -R supply ); Among them, S demand Represents the area of ​​the layout grid occupied by module fragments; S supply Indicates the area of ​​the area not occupied by module fragments; Utilization indicates the specified maximum area occupancy, the default value is 1; R demand Indicates the demand for wiring resources; R supply Indicates the amount of wiring resources provided.

6. The integrated circuit layout method according to claim 5, characterized in that: When merging the layout grid to be merged with the corresponding adjacent layout grid, all layout networks are traversed, and each time the merge is performed, the nearest layout area is selected in four directions for unidirectional merging; After the merging direction is determined, the layout area closest to the initial layout grid or with more free areas is selected as the candidate area each time the merging is performed, and the rectangular shape of the layout area is maintained; When the resource overflow amount is not greater than 0, the merging is ended and the layout area sequence corresponding to the merged layout grid is marked.

7. The integrated circuit layout method according to claim 6, characterized in that: When merging, only check whether the length, width, or aspect ratio of the layout area exceeds the specified limit.

8. The integrated circuit layout method according to claim 7, characterized in that: When merging, constrain the aspect ratio of the layout area.

9. The integrated circuit layout method according to claim 1, characterized in that: Dividing the target layout area into a plurality of sub-areas according to the shape of the module, and placing each of the module fragments in a corresponding sub-area, including: S9001: Divide the current target layout area along the center line position to divide the current target layout area into a first sub-area and a second sub-area, wherein the division position is marked as the position of the initial cutting line; S9002: Sort the module fragments from small to large according to the coordinates, and distribute them to the first sub-region in sequence. When the total area of ​​the module fragments in the first sub-region is close to the area of ​​the first sub-region, continue to distribute the remaining module fragments to the second sub-region. After the distribution is completed, adjust the position of the cutting line according to the distribution of the module fragments. The formula is as follows: Among them, x placementbox Indicates the horizontal coordinate of the lower left corner of the layout area; width box Indicates the width of the layout area; S left S represents the total area of ​​module fragments in the first sub-area of ​​the layout area; total represents the total area of ​​all module fragments; S9003: recursively perform steps S9001-S9002 for each sub-area respectively until the target layout area after cutting meets the layout conditions, and determine whether there is only one module fragment in the target layout area; If there is only one module fragment, determine whether there is an empty position in the first sub-area and the second sub-area of ​​the target layout area to place the module fragment without causing overlap; if there is an empty position in the first sub-area, place the module fragment at the center of the first sub-area; if there is an empty position in the second sub-area, place the module fragment at the center of the second sub-area; if both sub-areas cannot meet the placement conditions, place the module fragment at the center of the target layout area; If there are multiple module fragments, the placement of the module fragments is calculated according to the following formula: Among them, x placement box Indicates the horizontal coordinate of the lower left corner of the layout area; y placement box Indicates the vertical coordinate of the lower left corner of the layout area; Num shatter module represents the number of module fragments contained in the layout area; i represents the order value of the module fragment in the layout area; The module fragments are arranged in increasing order of coordinates.

10. The integrated circuit layout method according to claim 1, characterized in that: The integrated circuit layout method further includes: traversing each of the modules, selecting the geometric center of all corresponding module fragments as the new coordinates of the module, and obtaining the layout position of each of the modules.

11. An integrated circuit layout device, characterized in that: include: Initialization module: used for dividing the module to be laid out into a plurality of layout grids and a plurality of routing grids, wherein the size of the layout grid is larger than the size of the routing grid, and one layout grid corresponds to one or more routing grids; Module fragmentation module: used for calculating the first area and the second area of ​​each layout grid, and cutting the module into a plurality of module fragments according to the size of the layout grid; The first area is the area occupied by the module, the second area is the area not occupied by the module, and each layout grid has at least one module fragment; Merging module: used to traverse the layout resources and routing resources in each layout grid, and determine whether the currently traversed layout grid belongs to the layout grid to be merged with overflowed occupied resources; If there is at least one layout grid to be merged, each layout grid to be merged is merged with a corresponding adjacent layout grid to obtain a target layout area, wherein the adjacent layout grid is a layout grid with no overflow in the number of resources; Module fragment placement module: divides the target layout area into multiple sub-areas according to the shape of the module, and places each of the module fragments in the corresponding sub-area.

12. An electronic device, characterized in that: include: at least one processor; And, a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute: the integrated circuit layout method according to any one of claims 1-11.

13. A computer storage medium, characterized in that: The computer storage medium stores computer executable instructions, and when the computer executable instructions are executed by a processor, the integrated circuit layout method according to any one of claims 1 to 11 is performed.

Citation Information

Cited By

  • Layout area division method, clock tree construction method, computer medium, equipment and program product

    CN120724956A