In this paper a novel gate-level strategy for designing Carry Select adders is proposed. The strategy is more general than the previously proposed techniques, and accounts for the dependence of multiplexer delay on its fan-out. Moreover, the strategy is simple and systematic, and is helpful for designing Carry Select adders with a pencil-and-paper approach. An approximate expression of the minimum delay achievable is derived to estimate performance before carrying out the design. The proposed strategy is validated in more than 1,000 adders. Analysis confirms that the strategy leads to a delay which is minimal in most cases, and always within 5.7%
The gate sizing problem is the problem of finding load drive capabilities for all gates in a given B...
The growing impact of process variation on circuit performance requires statistical design approache...
The lithography used for 32 nanometers and smaller VLSI process technologies restricts the admissibl...
In this paper a novel gate-level strategy for designing Carry Select adders is proposed. The strateg...
In this paper a novel gate-level strategy for designing Carry Select adders is proposed. The strateg...
In this paper a novel strategy to design Carry Skip Adders is proposed. It allows to distribute bits...
Abstract—Gate sizing has a significant impact on the de-lay, power dissipation, and area of the fina...
We present ecient, optimal algorithms for tim-ing optimization by discrete wire sizing and buer in-s...
The design scale of Integrated Circuits (ICs) is increasing exponentially according to Moore's law, ...
Abstract — This article describes an algorithm for curvilinear detailed routing. We significantly im...
The problem of sizing gates for power-delay tradeos is of great interest to designers. In this work,...
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the tim...
Logical Effort [1, 2] is a simple hand-calculated method that measures quick delay estimation. It ha...
We develop a new fully-automated transistor sizing tool for FPGAs that features area, delay and wire...
Abstract—We present an early-stage global wire-design method-ology that simultaneously considers the...
The gate sizing problem is the problem of finding load drive capabilities for all gates in a given B...
The growing impact of process variation on circuit performance requires statistical design approache...
The lithography used for 32 nanometers and smaller VLSI process technologies restricts the admissibl...
In this paper a novel gate-level strategy for designing Carry Select adders is proposed. The strateg...
In this paper a novel gate-level strategy for designing Carry Select adders is proposed. The strateg...
In this paper a novel strategy to design Carry Skip Adders is proposed. It allows to distribute bits...
Abstract—Gate sizing has a significant impact on the de-lay, power dissipation, and area of the fina...
We present ecient, optimal algorithms for tim-ing optimization by discrete wire sizing and buer in-s...
The design scale of Integrated Circuits (ICs) is increasing exponentially according to Moore's law, ...
Abstract — This article describes an algorithm for curvilinear detailed routing. We significantly im...
The problem of sizing gates for power-delay tradeos is of great interest to designers. In this work,...
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the tim...
Logical Effort [1, 2] is a simple hand-calculated method that measures quick delay estimation. It ha...
We develop a new fully-automated transistor sizing tool for FPGAs that features area, delay and wire...
Abstract—We present an early-stage global wire-design method-ology that simultaneously considers the...
The gate sizing problem is the problem of finding load drive capabilities for all gates in a given B...
The growing impact of process variation on circuit performance requires statistical design approache...
The lithography used for 32 nanometers and smaller VLSI process technologies restricts the admissibl...