Area-time optimal adder with relative placement generator

نویسندگان

  • Aamir A. Farooqui
  • Vojin G. Oklobdzija
  • Sadiq M. Sait
چکیده

Aamir A. Farooqui , Vojin G. Oklobdzija , Sadiq M. Sait Synopsys Inc. Synopsys Module Compiler 700 Middlefield Road, Mountain View CA 94043 USA [email protected] ACSEL Laboratory Electrical Engineering Dept. University of California Davis, CA 95616 USA [email protected] 3 Department of Computer Engineering KFUPM Box 673 King Fahd University of Petroleum & Minerals Dhahran-31261, Saudi Arabia [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TO APPEAR IN : IEEE TRANSACTIONS ON CAD / ICAS 1 On the Generation of Area - Time OptimalTestable

| We present a performance driven generator for integer adders which has the following interesting feature: The generator is parametrized in the operands' bitlength n, the delay of the addition tn and the fault model FM. FM may in particular be chosen as the classical stuck-at fault model, the cellular fault model or the robust path delay fault model. The output of the generator is a performanc...

متن کامل

An Asynchronous Early Output Full Adder and a Relative-Timed Ripple Carry Adder

This article presents the design of a new asynchronous early output full adder which when cascaded leads to a relative-timed ripple carry adder (RCA). The relative-timed RCA requires imposing a very small relative-timing assumption to overcome the problem of gate orphans associated with internal carry propagation. The relative-timing assumption is however independent of the RCA size. The primar...

متن کامل

A Time Driven Adder Generator Architecture

This paper presents the design and implementation of a time driven adder generator architecture. There exists a large variety of adders designed to satisfy different computation requirements, in particular we list the Carry Look Ahead (CLA) adder, the skip adder, the ripple adder, the carry select adder (CSA), etc. These different architectures will offer different delays and it is up to the us...

متن کامل

Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders

This article presents two area/latency optimized gate level asynchronous full adder designs which correspond to early output logic. The proposed full adders are constructed using the delay-insensitive dual-rail code and adhere to the four-phase return-to-zero handshaking. For an asynchronous ripple carry adder (RCA) constructed using the proposed early output full adders, the relative-timing as...

متن کامل

Power efficient Simulation of Diminished-One Modulo 2n+1 Adder Using Circular Carry Selection

In this paper we have find great applicability in RNS implementation for the Diminished-one modulo 2n+1 Adder using Circular Carry Selection (CCS) circuit. This adder presents a modulo addition of different bit values for n = 8, 12, 16, 24, 32, 48, 64. We are using the Diminished-one criteria using Circular Carry Selection (CCS) technique for the proposed modulo adder. The circuit design of pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003