scispace - formally typeset
Book ChapterDOI: 10.1007/978-81-322-2671-0_30

Design of Basic Building Blocks of ALU

01 Jan 2016-pp 315-327
Abstract: There were no limits for speed of operation of arithmetic/logical circuits. One can always try to increase their speed. There were many proposed algorithms, which would work fast to specified arithmetic operations. So, there is the need for the implementation of a faster design by putting these fastest algorithms in a single ALU. The carry-select adder with K–S algorithm is found to be one of the fastest algorithms for addition and Urdhva-Tiryagbhyam Karastuba algorithm for multiplication, which are the most important operations in any central processing unit. We have used QUARTUS-II software. This design can be used where high speed computation is needed. This design would work for unsigned, fixed point, 8-bit operations. We have taken the different adder circuits and compared their performance. These circuits are the basic elements or building blocks of an ALU. The circuits have been simulated using 90 nm technology of Cadence and Quartus II EP2C20F484C7. Adders can be implemented using EX-OR/EX-XNOR gates, transmission gates, HSD (High Speed Domino) technique, domino logic. Parallel feedback carry adder, ripple carry adder, carry look ahead adder, carry-select adder are some of the adders that been implemented using Cadence and Quartus-II. We found that 10T PFCA is efficient compared to 11 T PFCA to some extent. Adders based on XOR and XNOR gates have the least delay compared to the other adders that we have used. more

Topics: Adder (73%), Domino logic (54%), Carry (arithmetic) (54%) more

Journal ArticleDOI: 10.1109/TC.1973.5009159
Peter M. Kogge1, Harold S. Stone1Institutions (1)
Abstract: An mth-order recurrence problem is defined as the computation of the series x 1 , x 2 , ..., X N , where x i = f i (x i-1 , ..., x i-m ) for some function f i . This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Iliac IV. Recursive doubling involves the splitting of the computation of a function into two equally complex subfunctions whose evaluation can be performed simultaneously in two separate processors. Successive splitting of each of these subfunctions spreads the computation over more processors. This algorithm can be applied to any recurrence equation of the form x i = f(b i , g(a i , x i-1 )) where f and g are functions that satisfy certain distributive and associative-like properties. Although this recurrence is first order, all linear mth-order recurrence equations can be cast into this form. Suitable applications include linear recurrence equations, polynomial evaluation, several nonlinear problems, the determination of the maximum or minimum of N numbers, and the solution of tridiagonal linear equations. The resulting algorithm computes the entire series x 1 , ..., x N in time proportional to [log 2 N] on a computer with N-fold parallelism. On a serial computer, computation time is proportional to N. more

Topics: Function (mathematics) (54%), Polynomial (53%), Linear equation (53%) more

1,195 Citations

Journal ArticleDOI: 10.1109/TVLSI.2010.2101621
B. Ramkumar1, Harish M. Kittur1Institutions (1)
Abstract: Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. From the structure of the CSLA, it is clear that there is scope for reducing the area and power consumption in the CSLA. This work uses a simple and efficient gate-level modification to significantly reduce the area and power of the CSLA. Based on this modification 8-, 16-, 32-, and 64-b square-root CSLA (SQRT CSLA) architecture have been developed and compared with the regular SQRT CSLA architecture. The proposed design has reduced area and power as compared with the regular SQRT CSLA with only a slight increase in the delay. This work evaluates the performance of the proposed designs in terms of delay, area, power, and their products by hand with logical effort and through custom design and layout in 0.18-μm CMOS process technology. The results analysis shows that the proposed CSLA structure is better than the regular SQRT CSLA. more

Topics: Carry-select adder (54%), Adder (53%)

338 Citations

Open accessJournal ArticleDOI: 10.5121/VLSIC.2012.3113
29 Feb 2012-
Abstract: Adders form an almost obligatory component of every contemporary integrated circuit. The prerequisite of the adder is that it is primarily fast and secondarily efficient in terms of power consumption and chip area. This paper presents the pertinent choice for selecting the adder topology with the tradeoff between delay, power consumption and area. The adder topology used in this work are ripple carry adder, carry lookahead adder, carry skip adder, carry select adder, carry increment adder, carry save adder and carry bypass adder. The module functionality and performance issues like area, power dissipation and propagation delay are analyzed at 0.12 µm 6metal layer CMOS technology using microwind tool. more

Topics: Carry-lookahead adder (90%), Carry-skip adder (88%), Carry-select adder (86%) more

115 Citations

Open accessBook ChapterDOI: 10.1007/11693383_25
11 Aug 2005-
Abstract: We study different possibilities of implementing the Karatsuba multiplier for polynomials over ${\mathbb F}_{2}$ on FPGAs. This is a core task for implementing finite fields of characteristic 2. Algorithmic and platform dependent optimizations yield efficient hardware designs. The resulting structure is hybrid in two different aspects. On the one hand, a combination of the classical and the Karatsuba methods decreases the number of bit operations. On the other hand, a mixture of sequential and combinational circuit design techniques includes pipelining and can be adapted flexibly to time-area constraints. The approach—both theory and implementation—can be viewed as a further step towards taming the machinery of fast algorithmics for hardware applications. more

51 Citations

Open access
26 Mar 2017-
Abstract: Today's technology has raised demand for Fast and real time signal processing operation. Multiplication is one of the most important arithmetic operations. In this paper, we have proposed design of vedic multiplier using Urdhva Tiryagbhyam sutra in Xilinx ISE. This design takes lesser time for operation than currently available multipliers .It encompasses wide era of image processing and digital signal processing in much efficient way with increase in speed and thus leading to higher performance rating more

24 Citations

Network Information
Related Papers (5)
01 Dec 2013

M. O. V. Pavan Kumar, Kiran M

06 Apr 2016

M. Akila, C. Gowribala +1 more

30 May 2016

Rajeswar Reddy B, Lakshmi Prasad E +1 more

20 Apr 2018

K. C. Shilpa, M. Shwetha +4 more