ORTHOGONAL LAYOUT GENERATION

• US 20140164664A1
• Filed: 08/23/2011
• Published: 06/12/2014
• Est. Priority Date: 08/23/2011
• Status: Abandoned Application

• Current Assignee: General Electric Company
• Original Assignee: General Electric Company
• Inventors: Gong, Qiying, Qiu, Hongxiang, Su, Bo, Scovill, Bruce Alan
• Application Number:
  US13/320,210
• Publication Number:
  US 20140164664A1
• Time in Patent Office: Days
• US Class Current: 710/305
• CPC Class Codes: G06F 13/40 Bus structure for computer networks G06F15/163; for optical bus networks H04B10/25
• CPC Class Codes: G06F 2119/06 Power analysis or power optimisation
• CPC Class Codes: G06F 30/392 Floor-planning or layout, e.g. partitioning or placement

Abstract

An orthogonal layout generation method can include receiving, in a computer system, data related to a plurality of devices for a schematic layout, generating, in the computer system, a node for each of the plurality of devices, hereby generating a plurality of nodes, generating, in the computer system, a link for each of the plurality of nodes, thereby generating a plurality of links, orthogonalizing, in the computer system, the plurality of nodes, initializing, in the computer system, a route for each of the plurality of links, thereby generating a plurality of routes, orthogonalizing, in the computer system, the routes and selecting, in the computer system, a direction for each of the plurality of routes.

Claims

1. An orthogonal layout generation method, comprising:

receiving, in a computer system, data related to a plurality of devices for a schematic layout;

generating, in the computer system, a node for each of the plurality of devices, thereby generating a plurality of nodes;

generating, in the computer system, a link for each of the plurality of nodes, thereby generating a plurality of links;

orthogonalizing, in the computer system, the plurality of nodes;

initializing, in the computer system, a route for each of the plurality of links, thereby generating a plurality of routes;

orthogonalizing, in the computer system, the plurality of routes; and

selecting, in the computer system, a direction for each of the plurality of routes.

2. The method as claimed in claim 1 wherein each of the plurality of nodes can be at least one of a node for a point device, a node for an internal connectivity point and a node for an end point.

3. The method as claimed in claim 1 wherein orthogonalizing the plurality of nodes reduces offsets for the plurality of routes.

4. The method as claimed in claim 1 further comprising moving, in the computer system, nodes of the plurality of nodes that are unconnected by links to reduce at least one cross-overs and overlays between the plurality of nodes and the plurality of routes.

5. The method as claimed in claim 1 further comprising adjusting, in the computer system, spaces between each of the plurality of nodes and other nodes of the plurality of nodes to increase the spaces above a predetermined distance.

6. The method as claimed in claim 1 further comprising generating, in the computer system, a boundary for each of the plurality of nodes.

7. The method as claimed in claim 6 wherein the boundary is a bounding box representing physical area of a corresponding device of the plurality of devices from the device data.

8. The method as claimed in claim 7 further comprising generating, in the computer system, a boundary for the schematic layout.

9. The method as claimed in claim 1 further comprising selecting, in the computer system, a terminal direction for each of the plurality of routes.

10. The method as claimed in claim 1 wherein selecting a direction for each of the plurality of routes comprises:

checking for cross-overs, in the computer system, between each of the plurality of nodes and each of the plurality of routes; and

generating, in the computer system, at least one of a simple route, a one corner route and a two corners route.

11. A computer program product including a non-transitory computer readable medium storing instructions for causing a computer to implement an orthogonal layout generation method, the method comprising:

receiving data related to a plurality of devices for a schematic layout;

generating a node for each of the plurality of devices, hereby generating a plurality of nodes;

generating a link for each of the plurality of nodes, thereby generating a plurality of links;

orthogonalizing the plurality of nodes;

initializing a route for each of the plurality of the links, thereby generating a plurality of routes;

orthogonalizing the plurality of routes; and

selecting a direction for each of the plurality of routes.

12. The computer program product as claimed in claim 11 wherein each of the plurality of nodes can be at least one of a node for a point device, a node for an internal connectivity point and a node for an end point.

13. The computer program product as claimed in claim 11 wherein orthogonalizing the plurality of nodes reduces offsets for the plurality of routes.

14. The computer program product as claimed in claim 11 wherein the method further comprises moving nodes of the plurality of nodes that are unconnected by links to reduce at least one cross-overs and overlays between the plurality of nodes and the plurality of routes.

15. The computer program product as claimed in claim 11 wherein the method further comprises adjusting spaces between each of the plurality of nodes and other nodes of the plurality of nodes to increase the spaces above a predetermined distance.

16. The computer program product as claimed in claim 11 wherein the method further comprises generating a boundary for each of the plurality of nodes.

17. The computer program product as claimed in claim 16 wherein the boundary is a bounding box representing physical area of a corresponding device of the plurality of devices from the device data.

18. The computer program product as claimed in claim 17 wherein the method further comprises generating a boundary for the schematic layout.

19. The computer program product as claimed in claim 11 wherein the method further comprises selecting a terminal direction for each of the plurality of routes.

20. The computer program product as claimed in claim 11 wherein selecting a direction for each of the plurality of routes comprises:

checking for cross-overs between each of the plurality of nodes and each of the plurality of routes; and

generating at least one of a simple route, a one corner route and a two corners route.