# US 2015/0149977 A1 · Partitioning method and system for 3d ic

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0149977 A1
- Document ID: US20150149977A1
- Status: Published application
- Kind: A1
- Application number: 14/609,508
- Filed: 2015-01-30
- Published: 2015-05-28
- Earliest claimed: 2013-10-18
- Assignees: Taiwan Semiconductor Manufacturing Company, Ltd.
- Applicants: Taiwan Semiconductor Manufacturing Co., Ltd.
- Inventors: Heng Kai LIU; Hui Yu LEE; Ya Yun LIU; Yi-Ting LIN
- Web page: https://patentgrep.com/patent/US20150149977A1

## CPC

- G06F 30/392: Floor-planning or layout, e.g. partitioning or placement
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method comprises: receiving a circuit design comprising networks of first devices fabricated by a first fabrication process; selecting second devices to be fabricated by a second process; substituting the second devices for the first devices in the networks of the circuit design; sorting the second devices within a selected one of the networks by device area from largest device area to smallest device area; and assigning each second device in the selected network to be fabricated in a respective one of a plurality of tiers of a 3D IC for which a total area of second devices previously assigned to that tier is smallest, the second devices being assigned sequentially according to the sorting.

## Claims

### Claim 1

A computer-implemented system, comprising:
a non-transitory, machine readable storage medium storing data representing a circuit design comprising a plurality of circuits, each circuit comprising a plurality of devices to be fabricated in respective tiers of a three dimensional integrated circuit (3D IC) comprising a plurality of tiers;
a programmed processor configured to:
group the circuits into a plurality of groups by at least one of the group consisting of an electrical constraint, a symmetry in circuit patterns, and a network, each group having an area; and
assign the plurality of groups to be fabricated in respective tiers of the 3D IC so as to minimize differences between a respective total of the areas of the groups assigned to each respective tier.

### Claim 2 (depends on 1)

The system of claim 1, wherein the electrical constraint includes at least one of drain current, threshold voltage, drain-source transconductance, drain source resistance, gate current, gate capacitance, or off current.

### Claim 3 (depends on 1)

The system of claim 1, wherein one of the circuits includes a plurality of analog devices, and the processor is configured to group all of the active devices in a single one of the groups.

### Claim 4 (depends on 1)

The system of claim 1, wherein one of the circuits includes a memory having a plurality of devices, and the processor is configured to group all of the devices of the memory in a single one of the groups.

### Claim 5 (depends on 1)

The system of claim 1, wherein the processor is configured to group the circuits by symmetry in a circuit pattern by automatically recognizing a differential pair circuit.

### Claim 6 (depends on 5)

The system of claim 5, wherein the processor is configured to include all p-MOSFET devices in the differential pair circuit in a first one of the groups, and to include all n-MOSFET devices in the differential pair circuit in a second one of the groups.

### Claim 7 (depends on 1)

The system of claim 1, wherein the processor is programmed to assign one of the plurality of groups by performing:
sorting the groups by total area of devices in each group, from largest total area to smallest total area;
sorting the tiers by total area of groups assigned to each tier, from smallest to largest; and
assigning the one of the sorted groups having the largest total area to the one of the sorted tiers having the smallest total area of assigned groups.

### Claim 8 (depends on 7)

The system of claim 7, wherein the steps of sorting the groups, sorting the tiers, and assigning are repeated until each of the plurality of groups has been assigned to a respective tier.

### Claim 9 (depends on 1)

The system of claim 1, further comprising assigning devices within remaining circuits of the circuit design to respective ones of the plurality of tiers to further reduce differences between total areas of devices assigned to each of the plurality of tiers.

### Claim 10

A computer-implemented method comprising:
providing a circuit design comprising a plurality of circuits including first circuits and second circuits, each circuit comprising a plurality of devices to be fabricated in a three dimensional integrated circuit (3D IC) comprising a plurality of tiers, each second circuit having a plurality of p-MOSFET devices and a plurality of n-MOSFET devices;
assigning one or more first circuits to be fabricated in a respective one of the plurality of tiers based on a respective electrical constraint of each first circuit;
assigning each p-MOSFET device in one of the second circuits to be fabricated in a first single one of the plurality of tiers; and
assigning each n-MOSFET device in the one of the second circuits to be fabricated in a second single one of the plurality of tiers different from the first single one of the plurality of tiers.

### Claim 11 (depends on 10)

The method of claim 10, further comprising assigning a plurality of analog devices to be fabricated in a single one of the plurality of tiers.

### Claim 12 (depends on 10)

The method of claim 10, wherein the circuit design includes a memory comprising a plurality of devices, the method further comprising assigning the plurality of devices of the memory to be fabricated in a single one of the plurality of tiers.

### Claim 13 (depends on 10)

The method of claim 10, further comprising selecting the one of the second circuits by automatically recognizing a differential pair circuit within the circuit design.

### Claim 14 (depends on 10)

The method of claim 10, further comprising assigning additional groups of circuits within the circuit design to respective ones of the plurality of tiers by:
sorting the additional groups by total area of devices in each additional group, from largest total area to smallest total area;
sorting the tiers by total area of groups assigned to each tier, from smallest to largest; and
assigning the one of the sorted additional groups having the largest total area to the one of the sorted tiers having the smallest total area of assigned groups.

### Claim 15 (depends on 14)

The method of claim 14, wherein the steps of sorting the additional groups, sorting the tiers, and assigning are repeated until each of the plurality of additional groups has been assigned to a respective tier.

### Claim 16

A non-transitory machine readable storage medium encoded with computer program code, such that when the computer program code is executed by a processor, the processor performs the computer implemented method, comprising:
providing a circuit design comprising a plurality of circuits to be fabricated in a three dimensional integrated circuit (3D IC) comprising a plurality of tiers;
finding a node adjacent to and between a first p-MOSFET device P and a first n-MOSFET device N in one of the circuits,
searching for an additional p-MOSFET device P sequentially connected on a same side of the found node as the first p-MOSFET device, and searching for a corresponding additional n-MOSFET device N sequentially connected on a same side of the found node as the first n-MOSFET device;
repeating the searching until there is no further sequentially connected p-MOSFET device on the same side of the first p-MOSFET device as the first p-MOSFET device, or no corresponding sequentially connected n-MOSFET device on the same side of the first n-MOSFET device as the first n-MOSFET device; and
assigning the sequentially connected p-MOSFET devices to be formed on a first one of the plurality of tiers, and assigning the sequentially connected n-MOSFET devices to be formed on a second one of the plurality of tiers.

### Claim 17 (depends on 16)

The non-transitory machine readable storage medium of claim 16, wherein the method further comprises assigning additional groups of circuits within the circuit design to respective ones of the plurality of tiers by:
sorting the additional groups by total area of devices in each additional group, from largest total area to smallest total area;
sorting the tiers by total area of groups assigned to each tier, from smallest to largest; and
assigning the one of the sorted additional groups having the largest total area to the one of the sorted tiers having the smallest total area of assigned groups.

### Claim 18 (depends on 17)

The non-transitory machine readable storage medium of claim 17, wherein the steps of sorting the additional groups, sorting the tiers, and assigning are repeated until each of the plurality of additional groups has been assigned to a respective tier.

### Claim 19 (depends on 16)

non-transitory machine readable storage medium of claim 16, wherein one of the circuits includes a plurality of analog devices having active devices, further comprising grouping all active devices within the analog devices in a single one of the groups.

### Claim 20 (depends on 16)

The non-transitory machine readable storage medium of claim 16, wherein one of the circuits includes a memory having a plurality of devices, further comprising grouping all of the devices of the memory in a single one of the groups.
