IS J AA

Vedic Algorithms to develop green chips for future

Soma BhanuTej International Institute of Information Technology (MT-MVD,SOST dept) Pune,India email: somatej.vlsi@gmail.com

International Journal of Systems , Algorithms & Applications

Abstract The speed of ALU depends greatly on the multiplier, Vedic Mathematics is the ancient system of mathematics which has a unique technique of calculations based on 16 Sutras. Employing these techniques in the computation algorithms of the coprocessor will reduce the complexity, execution time, area, power. Keywords-Vedic Multiplier, Urdhva Tiryambakam, ALU

I. INTRODUCTION In any processor the major units are Control Unit, ALU and Memory read write. Among these units the performance of any processor majorly depends on the time taken by the ALU to perform the specified operation. Multiplication is an important fundamental function in arithmetic operations. Multiplication-based operations such as Multiply and Accumulate (MAC) and inner product are among some of the frequently used Computation Intensive Arithmetic Functions (CIAF) currently implemented in many Digital Signal Processing (DSP) applications such as convolution, Fast Fourier Transform (FFT), filtering and in microprocessors in its arithmetic and logic unit. Since multiplication dominates the execution time of most DSP algorithms, so there is a need of high speed multiplier. The demand for high speed processing has been increasing as a result of expanding computer and signal processing applications. Higher throughput arithmetic operations are important to achieve the desired performance in many real-time signal and image processing application. One of the key arithmetic operations in such applications is multiplication and the development of fast multiplier circuit has been a subject of interest over decades. Reducing the time delay and power consumption are very essential requirements for many applications. This work presents different multiplier architectures. Multiplier based on Vedic Mathematics is one of the fast and low power multiplier. Digital multipliers are the most commonly used components in any digital circuit design. They are fast, reliable and efficient components that are utilized to implement any operation. Depending upon the arrangement of the components, there are different types of multipliers available. Particular multiplier architecture is chosen based on the application.

In many DSP algorithms, the multiplier lies in the critical delay path and ultimately determines the performance of algorithm. The speed of multiplication operation is of great importance in DSP as well as in general processor. In the past multiplication was implemented generally with a sequence of addition, subtraction and shift operations. There have been many algorithms proposals in literature to perform multiplication, each offering different advantages and having tradeoff in terms of speed, circuit complexity, area and power consumption. The multiplier is a fairly large block of a computing system. The amount of circuitry involved is directly proportional to the square of its resolution i.e. A multiplier of size n bits has n2 gates. For multiplication algorithms performed in DSP applications latency and throughput are the two major concerns from delay perspective. Latency is the real delay of computing a function, a measure of how long the inputs to a device are stable is the final result available on outputs. Multiplier is not only a high delay block but also a major source of power dissipation. Thats why if one also aims to minimize power consumption, it is of great interest to reduce the delay by using various delay optimizations. In this thesis work, Urdhva tiryakbhyam Sutra is first applied to the binary number system and is used to develop digital multiplier architecture. This is shown to be very similar to the popular array multiplier architecture. This Sutra also shows the effectiveness of to reduce the NxN multiplier structure into an efficient 2x2 multiplier structures. Nikhilam Sutra is then discussed and is shown to be much more efficient in the multiplication of large numbers as it reduces the multiplication of two large numbers to that of two smaller ones. The proposed multiplication algorithm is then illustrated to show its computational efficiency by taking an example of reducing a 4x4-bit multiplication to a single 2x2-bit multiplication operation. This work presents a systematic design methodology for fast and area efficient digit multiplier based on Vedic mathematics. The Multiplier Architecture is based on the Vertical and Crosswise algorithm of ancient Indian Vedic Mathematics.

Volume 2, Issue ICAEM12, February 2012, ISSN Online: 2277-2677 ICAEM12|Jan20,2012|Hyderabad|India

VEDIC ALGORITHMS TO DEVELOP GREEN CHIPS FOR FUTURE

IS J AA

International Journal of Systems , Algorithms & Applications

II. OBJECTIVE The main objective of this thesis is to design and synthesis of a ALU, which can be used in any processor application. This thesis deals with the study, design and synthesis of ALU using Vedic multiplier. In this thesis work, study of Vedic multiplication algorithms has been explored. Synthesis and Static timing analysis (STA) of this ALU has been done on RC compiler. III.VEDIC MULTIPLICATION The proposed Vedic multiplier is based on the Vedic multiplication formulae (Sutras). These Sutras have been traditionally used for the multiplication of two numbers in the decimal number system. In this work, we apply the same ideas to the binary number system to make the proposed algorithm compatible with the digital hardware. Vedic multiplication based on some algorithms, is discussed below A. Urdhva Tiryakbhyam Sutra The multiplier is based on an algorithm Urdhva Tiryakbhyam (Vertical & Crosswise) of ancient Indian Vedic Mathematics. Urdhva Tiryakbhyam Sutra is a general multiplication formula applicable to all cases of multiplication. It literally means Vertically and crosswise. It is based on a novel concept through which the generation of all partial products can be done and then, concurrent addition of these partial products can be done. Thus parallelism in generation of partial products and their summation is obtained using Urdhava Tiryakbhyam. The algorithm can be generalized for n x n bit number. Since the partial products and their sums are calculated in parallel, the multiplier is independent of the clock frequency of the processor. Thus the multiplier will require the same amount of time to calculate the product and hence is independent of the clock frequency. The net advantage is that it reduces the need of microprocessors to operate at increasingly high clock frequencies. While a higher clock frequency generally results in increased processing power, its disadvantage is that it also increases power dissipation which results in higher device operating temperatures. By adopting the Vedic multiplier, microprocessors designers can easily circumvent these problems to avoid catastrophic device failures. The processing power of multiplier can easily be increased by increasing the input and output data bus widths since it has a quite a regular structure. Due to its regular structure, it can be easily layout in a silicon chip. The Multiplier has the advantage that as the number of bits increases, gate delay and area increases very slowly as compared to other multipliers. Therefore it is time, space and power efficient. It will enhance the ALU unit also. As a result the mathematical operations which employs multiplication is demonstrated that this architecture is quite efficient in terms of silicon area/speed. IV. ALU The ALU is built with Vedic Multiplier Hence the adVolume 2, Issue ICAEM12, February 2012, ISSN Online: 2277-2677 ICAEM12|Jan20,2012|Hyderabad|India

vantages of Vedic multiplier like 1. Increase in speed 2. Decrease in delay 3. Decrease in area 4. Decrease in power consumption unit, will have efficient computing in terms of speed, delay and complexity.

A. Equations The equations for a 4x4 Vedic multiplier are

TABLE 1 VEDIC AND CONVECTIONAL MULTIPLIER

TABLE II CONVENTIONAL AND VEDIC ALU

VEDIC ALGORITHMS TO DEVELOP GREEN CHIPS FOR FUTURE

IS J AA

International Journal of Systems , Algorithms & Applications

VI. SIMULATION RESULTS

V. CONCLUSION Udrhva Tiryakbhayam Sutra is highly efficient algorithm for multiplication. ACKNOWLEDGEMENT
I thank my guide Prof. Bhushan Patil for his guidance throughout the project and Prof. Rabinder Henry Head of SOST, I2IT, Pune for encouragement and invaluable support throughout the work.

REFERENCES
[1] [2]

[3]

[4]

[5]

Fig 1. Simulation Result of 8-bit ALU using Vedic Multiplication

[6]

Jagadguru Swami Sri Bharati Krishna Tirthji Maharaja,Vedic Mathematics, Kumar, A.; Raman, A.; Low power ALU design by ancient mathematics, Computer and Automation Engineering (ICCAE),2010 The 2nd International Conference Publication Year: 2010 , Page(s): 862 865. Ramalatha, M.; Dayalan, K.D.; Dharani, P.; Priya, S.D.; High speed energy efficient ALU design using Vedic multiplication techniques, Advances in Computational Tools for Engineering Applications, 2009. ACTEA '09. International Conference on Digital Object Identifier: 10.1109/ ACTEA 2009.5227842 Publication Year: 2009, Page(s): 600 603 Shamim Akhter, VHDL Implementation of Fast X Multiplier Based on Vedic Mathematics, Jaypee Institute of Information Technology University, Noida, 201307 UP, INDIA, 2007 IEEE. E. Abu-Shama, M. B. Maaz, M. A. Bayoumi, A Fast and Low Power Multiplier Architecture, The Center for Advanced Computer Studies, The University of Southwestern Louisiana Lafayette, LA 70504. M.Kamaraju, K.Lal Kishore , A.V.N.Tilak Power Optimized ALU for Efficient Datapath International Journal of Computer Applications (0975 8887) Volume 11 No.11, December 2010.

Volume 2, Issue ICAEM12, February 2012, ISSN Online: 2277-2677 ICAEM12|Jan20,2012|Hyderabad|India