US5187784A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Integrated circuit placement method using netlist and predetermined ordering constraints to produce a human readable integrated circuit schematic diagram
Assignee: Philips Semiconductors Inc
•
Filing: 1989-01-13
•
Granted: 1993-02-16
•
Expires: 2009-01-13
Abstract
Abstract A method is disclosed for determining the placement of circuit elements in an integrated circuit where the circuit elements are initially represented by a netlist. The method preferably includes the steps of providing predetermined ordering constraints that indicate the preferred relative locations of the circuit elements that are represented in the netlist, partitioning the circuit elements from the netlist in accordance with a predetermined balancing criterion; determining the value of a cost function associated with the partitioning steps, and selecting a particular partition based upon the value of the cost function.
Inventors
- 👤 James A. Rowson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 08:11
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/10; G06F30/18; G06F30/30; G06F30/39; G06F30/392; G06F2111/00; G06F2111/04
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
204 words
A computer-implemented method for placing circuit elements in an inegraded circuit schematic where the circuit elements are initially represented by a netlist to produce a human-readable schematic circuit layout from the netlist, comprising computer-implemented steps of: (a) receiving predetermined ordering constraints indicating preferred relative vertical locations in a schematic diagram of circuit elements that are represented in the netlist; (b) partitioning the circuit elements represented in the netlist in accordance with a predetermined balancing criterion; (c) determining a first value of a cost function associated with the partitioning produced by the partitioning step, the determined value of he cost function being dependent upon he circuit elements crossing the partitioning and the predetermined ordering constraints in the cost function; (d) repeating step (c) to obtain a second value of the cost function associated with a different partition; (e) comparing the first and second values; (f) selecting the partition having the lower cost value; (g) assigning the circuit elements to two groups such that the one group is physically above the other group in the circuit schematic; and (h) repeating steps (b) through (f) recursively to automatically produce horizontal subpartitions of the circuit elements represented by the netlist to produce a human readable schematic circuit layout.
Claim 2
Dependent Claim
204 words
A computer-implemented method for placing circuit elements in an inegraded circuit schematic where the circuit elements are initially represented by a netlist to produce a human-readable schematic circuit layout from the netlist, comprising computer-implemented steps of: (a) receiving predetermined ordering constraints indicating preferred relative vertical locations in a schematic diagram of circuit elements that are represented in the netlist; (b) partitioning the circuit elements represented in the netlist in accordance with a predetermined balancing criterion; (c) determining a first value of a cost function associated with the partitioning produced by the partitioning step, the determined value of he cost function being dependent upon he circuit elements crossing the partitioning and the predetermined ordering constraints in the cost function; (d) repeating step (c) to obtain a second value of the cost function associated with a different partition; (e) comparing the first and second values; (f) selecting the partition having the lower cost value; (g) assigning the circuit elements to two groups such that the one group is physically above the other group in the circuit schematic; and (h) repeating steps (b) through (f) recursively to automatically produce horizontal subpartitions of the circuit elements represented by the netlist to produce a human readable schematic circuit layout.
Claim 3
Dependent Claim
33 words
The method of claim 1, wherein each ordering constraint has an associated cost penalty, said determining step assessing said cost penalty when a partition of said partitioning step leaves the ordering constraint unsatisfied.
Claim 4
Dependent Claim
21 words
The method of claim 1, wherein each ordering constraint provides an associated cost penalty to the value of he cost function.
Claim 5
Dependent Claim
29 words
The method of claim 3, wherein said ordering constraints relate to the horizontal locations of the circuit elements relative to one another, and said partitioning step produces vertical partitions.
Claim 6
Dependent Claim
37 words
The method of claim 4, further including a step of generating the predetermined ordering constraints to produce placement information for the circuit elements representing a predetermined directing of signal flow in the human readable schematic circuit layout.
References Cited (Backward Citations)
US3617714A
Cited
US4484292A
Cited
US4495559A
Cited
US4593363A
Cited
US4577276A
Cited
US4638442A
Cited
US4630219A
Cited
US4700317A
Cited
US4686629A
Cited
US4635208A
Cited
US4791578A
Cited
US4908772A
Cited
US4896272A
Cited
US4768154A
Cited
US4815003A
Cited
US4852015A
Cited
US4852016A
Cited
US4922432A
Cited
US4967367A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-02-16 | 1996-08-17 | 1997-02-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-02-16 | 2000-08-17 | 2001-02-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-02-16 | 2004-08-17 | 2005-02-16 | $7700.00 | Window Closed / Lapsed |