International audienceIn this paper we address the problem of delay constraint distribution on CMOS combinatorial paths. We first define a way to determine on any path the reasonable bounds of delay characterizing the structure. Then we define two constraint distribution methods that we compare to the equal delay distribution and to an industrial tool based on Newton-Raphson like algorithms. Validation is obtained on a 0.25µm process by comparing the different constraint distribution techniques on various benchmarks
This paper derives a methodology for developing accurate convex delay models to be used for transist...
Abstract—With delays due to the physical interconnect domi-nating the overall logic path delays, cir...
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gat...
International audienceIn this paper we address the problem of delay constraint distribution on a CMO...
Low power oriented circuit optimization consists in selecting the best alternative between gate sizi...
Logical Effort [1, 2] is a simple hand-calculated method that measures quick delay estimation. It ha...
Low power oriented circuit optimization consists in selecting the best alternative between gate sizi...
This paper presents a unified model for delay estimation in various CMOS logic styles. It also deriv...
This paper presents a new model for CMOS structures delays estimation based on a deep analysis of co...
Abstract—Gate sizing has a significant impact on the de-lay, power dissipation, and area of the fina...
In this paper, we present an algorithm for gate sizing with controlled displacement to improve the o...
Abstract- In this paper, we present an algorithm for gate sizing with controlled displacement to imp...
International audienceThe efficiency of cell-based design synthesis of high performance circuit is s...
Design closure in today\u27s advanced chip construction requires a delicate balance among various co...
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gat...
This paper derives a methodology for developing accurate convex delay models to be used for transist...
Abstract—With delays due to the physical interconnect domi-nating the overall logic path delays, cir...
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gat...
International audienceIn this paper we address the problem of delay constraint distribution on a CMO...
Low power oriented circuit optimization consists in selecting the best alternative between gate sizi...
Logical Effort [1, 2] is a simple hand-calculated method that measures quick delay estimation. It ha...
Low power oriented circuit optimization consists in selecting the best alternative between gate sizi...
This paper presents a unified model for delay estimation in various CMOS logic styles. It also deriv...
This paper presents a new model for CMOS structures delays estimation based on a deep analysis of co...
Abstract—Gate sizing has a significant impact on the de-lay, power dissipation, and area of the fina...
In this paper, we present an algorithm for gate sizing with controlled displacement to improve the o...
Abstract- In this paper, we present an algorithm for gate sizing with controlled displacement to imp...
International audienceThe efficiency of cell-based design synthesis of high performance circuit is s...
Design closure in today\u27s advanced chip construction requires a delicate balance among various co...
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gat...
This paper derives a methodology for developing accurate convex delay models to be used for transist...
Abstract—With delays due to the physical interconnect domi-nating the overall logic path delays, cir...
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gat...