US5521836A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for determining instance placements in circuit layouts
Assignee: NXP BV
•
Filing: 1994-12-12
•
Granted: 1996-05-28
•
Expires: 2014-12-12
Abstract
Abstract A process for producing placement information for layouts of circuit elements of networks that are initially represented by netlists such that datapaths can be advantageously placed into a regular array. In one preferred embodiment, the method includes steps of encoding datapath information in instance names of a netlist generated by a datapath compiler; using the encoded datapath information for defining partitioned areas that preserve datapaths; and generating circuit layouts from the netlist, which layouts contain floor plans of the datapaths.
Inventors
- 👤 Mark R. Hartoog
- 👤 James A. Rowson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 13:17
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/392
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
76 words
A method for determining placement of instances in a layout of electrical or electronic circuits initially represented by a netlist, comprising the steps of: attaching position information to netlist instances in a netlist for identifying their approximate position in a regular structure; using the attached information for defining partitioned areas of said regular structure; generating a circuit layout from the netlist, which layout contains the partitioned areas; and optimizing the circuit layout containing the partitioned areas.
Claim 2
Independent Claim
76 words
A method for determining placement of instances in a layout of electrical or electronic circuits initially represented by a netlist, comprising the steps of: attaching position information to netlist instances in a netlist for identifying their approximate position in a regular structure; using the attached information for defining partitioned areas of said regular structure; generating a circuit layout from the netlist, which layout contains the partitioned areas; and optimizing the circuit layout containing the partitioned areas.
Claim 3
Dependent Claim
44 words
A method according to claim 1, further comprising a step of: providing a hierarchical netlist wherein a top level of the netlist identifies instances which belong to the same functional unit with a common functional unit name, each instance having a unique instance name.
Claim 4
Dependent Claim
15 words
A method according to claim 2 further including a step of concatenating each instance name.
Claim 5
Dependent Claim
39 words
A method according to claim 1 wherein said step of optimizing further includes a step of separately applying a place-and-route technique to each partitioned area of the circuit layout to optimize instance placement within each of the partitioned areas.
Claim 6
Dependent Claim
42 words
A method according to claim 1 wherein said step of attaching further includes a step of pre-cutting the layout into the partitioned areas which form said regular structure, the partitioned areas being used to control placement of instances in the circuit layout.
Claim 7
Dependent Claim
16 words
A method according to claim 5 wherein the partitioned areas are arranged in a rectangular grid.
Claim 8
Dependent Claim
23 words
A method according to claim 1 wherein each partitioned area contains all netlist instances corresponding to a common functional unit and bit location.
Claim 9
Dependent Claim
39 words
A method according to claim 1 wherein said step of optimizing further includes steps of: placing each instance in a partitioned area; and sub-partitioning each partitioned area vertically, then horizontally, then vertically and so forth in a recursive manner.
Claim 10
Dependent Claim
18 words
A method according to claim 8, wherein a cost function technique is employed to sub-partition the circuit layout.
Claim 11
Dependent Claim
31 words
A method according to claim 9 wherein the cost function technique is employed to optimize sub-partitioned areas of the circuit layout subject to a constraint that instance interconnection distances are minimized.
Claim 12
Dependent Claim
29 words
A method according to claim 1, further comprising a step of providing information that identifies datapath functions and their interconnections from a datapath compiler which produces a hierarchical netlist.
Claim 13
Dependent Claim
32 words
The method of claim 11, wherein said step of optimizing further comprises the step of hierarchically decomposing the layout by placing and routing circuit elements which are included in each partitioned area.
Claim 14
Dependent Claim
23 words
The method of claim 1 wherein individual instances of the netlist combine to form bit locations of functional units in the circuit layout.
Claim 15
Dependent Claim
92 words
The method of claim 1, wherein said step of optimizing includes the steps of: sub-partitioning each partitioned area recursively; evaluating a cost value associated with a sub-partitioned area, said cost value being a function of the number of nets crossing the sub-partition; adjusting the cost value of a sub-partitioned area by placing and routing circuit elements included in the sub-partitioned area to produce an adjusted cost value; comparing the cost value with the adjusted cost value; and selecting the placement of circuit elements with the sub-partitioned areas having a lower cost value.
Claim 16
Independent Claim
65 words
A method for operating upon netlists so that datapaths can be placed into a regular array of a physical circuit layout, comprising the steps of: encoding datapath information as instance names in a netlist generated by a datapath compiler; using the encoded datapath information for defining partitioned areas that preserve datapaths; generating circuit layouts from the netlist, which layouts contain floor plans of the datapaths.
Claim 17
Independent Claim
65 words
A method for operating upon netlists so that datapaths can be placed into a regular array of a physical circuit layout, comprising the steps of: encoding datapath information as instance names in a netlist generated by a datapath compiler; using the encoded datapath information for defining partitioned areas that preserve datapaths; generating circuit layouts from the netlist, which layouts contain floor plans of the datapaths.
Claim 18
Dependent Claim
24 words
The method of claim 15 further including the step of separately optimizing, for each partitioned area, placement of circuit elements in each partitioned area.
Claim 19
Dependent Claim
45 words
The method of claim 16 wherein said step of encoding further includes the step of: providing a top level of said netlist that identifies instances which belong to the same functional unit with a common functional unit name, each instance having a unique instance name.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-28 | 1999-11-27 | 2000-05-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-28 | 2003-11-27 | 2004-05-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-28 | 2007-11-27 | 2008-05-28 | $7700.00 | Window Closed / Lapsed |