In this paper a novel strategy to design Carry Skip Adders is proposed. It allows to distribute bits into groups to achieve minimum delay, and consists of two steps. The first is a preliminary analytical sizing based on timing considerations, the second is a successive refinement to achieve the desired number of bits. The strategy is simple, systematic and general, thus it is helpful to design in a pencil-and-paper approach, as well as providing an in-depth understanding of the optimum group sizing. Moreover, it allows to analytically estimate the minimum delay achievable before carrying out the design. The strategy proposed has been validated by applying it to the design of more than 50 adders, varying delay of logic gates used and number of bits. Analysis confirms that the strategy provides minimum delay in practical cases.
Alioto, M.B.C., Palumbo, G. (2003). A Simple Strategy for Optimized Design of One-Level Carry-Skip Adders. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I. FUNDAMENTAL THEORY AND APPLICATIONS, 50(1), 141-148 [10.1109/TCSI.2002.807517].
A Simple Strategy for Optimized Design of One-Level Carry-Skip Adders
ALIOTO, MASSIMO BRUNO CRIS;
2003-01-01
Abstract
In this paper a novel strategy to design Carry Skip Adders is proposed. It allows to distribute bits into groups to achieve minimum delay, and consists of two steps. The first is a preliminary analytical sizing based on timing considerations, the second is a successive refinement to achieve the desired number of bits. The strategy is simple, systematic and general, thus it is helpful to design in a pencil-and-paper approach, as well as providing an in-depth understanding of the optimum group sizing. Moreover, it allows to analytically estimate the minimum delay achievable before carrying out the design. The strategy proposed has been validated by applying it to the design of more than 50 adders, varying delay of logic gates used and number of bits. Analysis confirms that the strategy provides minimum delay in practical cases.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/10956
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo