International Business Machines Corporation

Karsten Muuss

Matthias Ringe

Niels Fricke

Zhuo Li

Gustavo Enrique Tellez

Juergen Koehl

Sven Peyer

Christoph W Wandel

Andrew D Huber

Christian Schulte

Peter Verwegen

Bernd Kemmler

Andre Hogan

A method includes receiving a routing grid that includes nets each net having a bounding box maximum dimension, a net length and a number of pins associated with each of the nets, generating a list of the nets, the list of the nets sorted in order by the bounding box maximum dimension, the net length, and the number of pins associated with each of the nets, calculating a sum of the number of pins, calculating a sum of the length of the nets, identifying a net for which a difference of the sum of the number of pins and the sum of the length of the nets is a maximum value, determining the bounding box maximum of the identified net, calculating a tile size as a function of the bounding box maximum, performing a global routing process using the calculated tile size to generate a global routing design.

Global routing in circuit design

According to one embodiment of the present invention, a method for optimizing an integrated circuit design is provided. The method may include identifying one or more nets crossing a boundary between a parent block, having parent logic, and a child block, having child logic. The method may include inserting interior buffers on the nets inside of the child block and exterior buffers on the nets outside of the child block and inside of the parent block, wherein the interior buffers and the exterior buffers define a buffer pair for each of the nets. The method may further include determining a first placement for the parent logic and a second placement for the child logic, such that the buffers of the buffer pair for each net are placed substantially near to one another. The method may further include determining pin locations for the child block based on the second placement.

Optimization of integrated circuit physical design

A mechanism is provided in a data processing system for timing-driven routing for noise reduction in integrated circuit design. Responsive to performing timing driving routing on an integrated circuit design, the mechanism identifies a set of noise-critical nets in the integrated circuit design. The mechanism performs timing driven routing on the integrated circuit design with noise constraints based on the set of noise-critical nets.

Timing driven routing for noise reduction in integrated circuit design

A method to optimize performance of an electric circuit design is disclosed. The method comprises providing for each circuit element of the electric circuit design available design parameter options; transforming the electric circuit design and the design parameter options into a linear programming model; determining a solution for the linear programming model; and based on the solution generating a list of circuit elements which design parameters need to be changed to a different option to achieve performance optimization.

Method and data processing system to optimize performance of an electric circuit design, data processing program and computer program product

A computerized method for automatically generating a grid-based derivative of a non-gridded cell library of an integrated circuit design comprises the step of determining at least one valid position of at least one wiring element of a circuit of the first cell library, wherein the at least one valid position fulfills all technological design rules and wherein the at least one valid position fits into the second grid format. The method can also be used for automatically transforming a first cell library of an integrated circuit design having a first grid format into a second cell library having a second grid format or for automatically analyzing a grid-based cell library of an integrated circuit design in view of the circuit quality regarding technical design rules.

Growing community of inventors

Niederkassel, Germany

Karsten Muuss