Abstract: A critical path minimization technique uses a novel reshaping layout reorganization mechanism. Circuit objects and/or object fragments which belong to a critical path in a reference direction are reshaped using resources of an orthogonal direction. A fragment may decrease its size in the layout in the reference direction and increase its size in the orthogonal direction. Types of reshaping include via, diode or tie reshaping, transistor chain reshaping by transistor finger resizing, and transistor chain reshaping by transistor finger removing. The removal technique can include removal of one (or 2N+1) transistor finger(s) from an edge (e.g., beginning or end) of a transistor chain, removal of two (or 2N) adjacent transistor fingers from any position of a transistor chain, removal of one (or 2N+1) transistor finger(s) from inside a transistor chain with diffusion gap insertion, and removal of a group or series of transistor fingers.

Abstract: The invention relates to a method for manufacturing of electronic devices, such as very large scale integrated devices, having a channel. The channel routing is done based on a compositional approach in which initially all individual terminals are represented by individual nodes in a terminal vertical constraint graph. Individual constraints between individual terminals are represented by separate edges. This approach allows the resolution of difficult classes of routing problems in an efficient way.

Abstract: The invention concerns a method for manufacturing an electronic device having a channel. The channel has a number of rows and columns for wiring of nets. Usually each wiring layer is dedicated to either the rows or the columns. According to this method certain row segments can be shifted from one wiring layer to another, so that the channel area is used more effectively.

Abstract: The present layout compaction technique compacts circuit elements in two dimensions of a circuit layout with reduced computational requirements. A circuit layout representation is converted to a constraint graph representation in a reference direction. An orthogonal constraint graph is also constructed. A critical path subgraph is constructed based upon the reference and orthogonal constraint graphs, where one or more critical paths are chosen as the longest paths between the source and sink vertices of the reference constraint graph. Further, each vertex in the constraint graph is converted to an input vertex for each incoming shear edge and an output vertex for each outgoing shear edge. Jogging edges are created between each input and output vertices in the critical path subgraph. Weight values are assigned to each shear and jogging edge.

Abstract: In an improved routing method vertical constraint graph is generated in which a critical node is selected. The critical node is expanded to contain corresponding terminals. The resulting subnodes within the critical node are interconnected by edges that are representative of vertical constraints. A graph coloring method is employed to split the critical node into a number of new nodes. Thereby it is possible to route channels having multi-dimensional vertical constrains.