# US 2005/0138588 A1 · Current scheduling system and method for optimizing multi-threshold CMOS designs

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

- Number: US 2005/0138588 A1
- Document ID: US20050138588A1
- Status: Published application
- Kind: A1
- Application number: 10/739,659
- Filed: 2003-12-17
- Published: 2005-06-23
- Earliest claimed: 2003-12-17
- Assignees: Sequence Design, Inc.
- Inventors: Gerald Frenkil
- Web page: https://patentgrep.com/patent/US20050138588A1

## CPC

- H10D 84/907: {CMOS gate arrays}
- G06F 30/3312: Timing analysis
- G06F 30/3315: using static timing analysis [STA]
- G06F 30/394: Routing (G06F30/396 takes precedence)
- H10D 89/10: Integrated device layouts
- H10D: INORGANIC ELECTRIC SEMICONDUCTOR DEVICES
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

This invention provides a mechanism for minimizing the switching time degradation of MTCMOS circuits while at the same time minimizing the area overhead due to the MTCMOS switch circuitry. This optimization is achieved by scheduling the current flow, due to the switching events of the MTCMOS logic cells, such that only temporally mutually exclusive currents, or currents whose cumulative sum is less than a predetermined value, can flow in any given switch cell. Techniques for current event merging and current event culling, and techniques for handling timing and current variances may be used.

## Claims

### Claim 1

A method for optimizing a power-gated design, comprising:
dividing a time period into a plurality of timing windows;
mapping current events in each element of the power-gated design to one or more of the timing windows according to whether or not a current event of the element occurs within each timing window;
providing a plurality of switch devices, each switch device having one terminal coupled to a physical power supply, a second terminal coupled to provide a virtual power supply, and a third terminal receiving a control signal that enables a low impedance path between the first terminal and the second terminal; and
assigning each element of the power-gated design to a switch device according to the mapping of current events in each element to the timing windows.

### Claim 2 (depends on 1)

A method as in claim 1, further comprising logically connecting the elements of the power-gated design to the switch devices according to the assignment of the assigning step.

### Claim 3 (depends on 1)

A method as in claim 1, further comprising routing the elements of the power-gated design to the switch devices according to the assignment of the assigning step

### Claim 4 (depends on 1)

A method as in claim 1, wherein the number of current events associated with elements assigned to the switch device within each timing window is less than a predetermined number.

### Claim 5 (depends on 4)

A method as in claim 4, wherein the predetermined number is one.

### Claim 6 (depends on 1)

A method as in claim 1, wherein the assigning assigns elements to each switch device such that the switch device has a current less than a predetermined maximum in each timing window.

### Claim 7 (depends on 1)

A method as in claim 1, wherein the mapping takes into account process variations.

### Claim 8 (depends on 7)

A method as in claim 7, wherein the current events are derived from a weighted sum of estimated currents under different process conditions.

### Claim 9 (depends on 7)

A method as in claim 7, further comprising checking for a violation of a current limit in each timing window under different process conditions.

### Claim 10 (depends on 1)

A method as in claim 1, wherein the method is repeated for multiple asynchronous clock domains.

### Claim 11 (depends on 1)

A method as in claim 1, wherein the assigning assigns elements to the switch device such that a voltage drop across the low impedance path is less than a predetermined value.

### Claim 12 (depends on 1)

A method as in claim 1, wherein the assigning assigns elements to the switch device such that a voltage drop across a branch in a network of logic cells connected to a switch device is less than a predetermined value.

### Claim 13 (depends on 1)

A method as in claim 1, wherein the assigning takes into consideration the routing lengths between the switch devices and the elements of the power-gated design.

### Claim 14 (depends on 1)

A method as in claim 1, further comprising selecting the switch devices from a collection of switch devices each capable of handling a different maximum current.

### Claim 15 (depends on 14)

A method as in claim 14, further comprising:
resizing selected ones of the switch devices;
modifying the assignments of elements to the switch devices such that the number of elements assigned to each switch device is increased.

### Claim 16 (depends on 1)

A method as in claim 1, wherein the elements of the logic circuit and the switch devices comprise standard cells.

### Claim 17 (depends on 16)

A method as in claim 16, wherein each standard cell includes a conductor at a predetermined location for routing the virtual power supply by abutment.

### Claim 18 (depends on 1)

A method as in claim 1, wherein the elements of the logic circuit and the switch devices comprise transistors of different threshold voltages.

### Claim 19 (depends on 1)

A method as in claim 1, further comprising estimating timing of the power-gated design, taking into consideration the switch devices.

### Claim 20 (depends on 19)

A method as in claim 19, wherein the timing is estimated based on estimated wire impedances.

### Claim 21 (depends on 19)

A method as in claim 19, wherein the timing is estimated using parasitic impedances extracted after the routing.

### Claim 22 (depends on 1)

A method as in claim 1, wherein the current events are obtained using an event culling technique.

### Claim 23 (depends on 1)

A method as in claim 1, wherein the current events are obtained using an event merging technique.

### Claim 24 (depends on 1)

A method as in claim 1, wherein mapping the current events take into consideration timing variances.

### Claim 25 (depends on 24)

A method as in claim 24, wherein each current event is mapped into a number of non-overlapping timing bins.

### Claim 26 (depends on 25)

A method as in claim 25, wherein the number of non-overlapping timing bins mapped for each current event depends on the width of each timing bin and an uncertainty associated with each current event.

### Claim 27 (depends on 24)

A method as in claim 24, wherein each current event is mapped into a central portion of one of a plurality of overlapping timing bins.

### Claim 28

A system for optimizing a power-gated design within an integrated circuit design automation system, comprising:
a mapping module that analyzes current events in each element of the power-gated design and maps each current event to one or more timing windows according to whether or not the current event of the element occurs within each timing window, the timing windows being non-overlapping intervals of time within a predetermined time period in the power-gated design;
a switch device provisioning module that provides a plurality of switch devices in the power-gated device, each switch device having one terminal coupled to a physically power supply, a second terminal coupled to provide a virtual power supply, and a third terminal receiving a control signal that enables a low impedance path between the first terminal and the second terminal; and
a switch device assignment module that associates each element of the power-gated design to a switch device according to the mapping of current events in each element to the timing windows.

### Claim 29 (depends on 28)

A system as in claim 28, further comprising a routing module that interconnects the elements of the power-gated design to the switch devices according to the element assignment of the switch devices.

### Claim 30 (depends on 28)

A system as in claim 28, wherein the number of current events associated with elements assigned to the switch device within each timing window is less than a predetermined number.

### Claim 31 (depends on 30)

A system as in claim 30, wherein the predetermined number is one.

### Claim 32 (depends on 28)

A system as in claim 28, wherein the switch device assignment module assigns elements to each switch device such that the switch device has a current less than a predetermined maximum in each timing window.

### Claim 33 (depends on 28)

A system as in claim 28, wherein the mapping module takes into account process variations.

### Claim 34 (depends on 28)

A system as in claim 28, wherein the mapping module takes into account on-chip process variations.

### Claim 35 (depends on 34)

A system as in claim 34, wherein the current events are derived from a weighted sum of estimated currents under different process conditions.

### Claim 36 (depends on 28)

A system as in claim 28, wherein the mapping module checks for a violation of a current limit in each timing window under different process conditions.

### Claim 37 (depends on 28)

A system as in claim 28, wherein the system is repeated for multiple asynchronous clock domains.

### Claim 38 (depends on 28)

A system as in claim 28, wherein the switch device assignment module assigns elements to the switch device such that a voltage drop across the low impedance path is less than a predetermined value.

### Claim 39 (depends on 28)

A system as in claim 28, wherein the switch device assignment module takes into consideration the routing lengths between the switch devices and the elements of the power-gated design.

### Claim 40 (depends on 28)

A system as in claim 28, wherein the switch device assignment module assigns elements to the switch device such that a voltage drop across the low impedance path is less than a predetermined value.

### Claim 41 (depends on 28)

A system as in claim 28, wherein the switch device provision module that selects from a collection of switch devices each capable of handling a different maximum current.

### Claim 42 (depends on 41)

A system as in claim 41, wherein the switch device provisioning module resizes selected ones of the switch devices, and modifies the assignments of elements to the switch devices such that the number of elements assigned to each switch device is increased.

### Claim 43 (depends on 28)

A system as in claim 28, wherein the elements of the logic circuit and the switch devices comprise standard cells.

### Claim 44 (depends on 43)

A system as in claim 43, wherein each standard cell includes a conductor at a predetermined location for routing the virtual power supply by abutment.

### Claim 45 (depends on 28)

A system as in claim 28, wherein the elements of the logic circuit and the switch devices comprise transistors of different threshold voltages.

### Claim 46 (depends on 28)

A system as in claim 28, further comprising a timing module for estimating timing of the power-gated design, taking into consideration of the switch devices.

### Claim 47 (depends on 46)

A system as in claim 46, wherein the timing is estimated based on estimated of wire impedances.

### Claim 48 (depends on 46)

A system as in claim 46, wherein the timing is estimated using parasitic impedances extracted after the routing.

### Claim 49 (depends on 22)

A system as in claim 22, wherein the current events are obtained using an event culling technique.

### Claim 50 (depends on 22)

A system as in claim 22, wherein the current events are obtained using an event merging technique.

### Claim 51 (depends on 22)

A system as in claim 22, wherein mapping the current events take into consideration timing variances.

### Claim 52 (depends on 51)

A method as in claim 51, wherein each current event is mapped into a number of non-overlapping timing bins.

### Claim 53 (depends on 52)

A method as in claim 52, wherein the number of non-overlapping timing bins mapped for each current event depends on the width of each timing bin and an uncertainty associated with each current event.

### Claim 54 (depends on 51)

A method as in claim 51, wherein each current event is mapped into a central portion of one of a plurality of overlapping timing bins.
