A High Speed 16*16 Multiplier Based On Urdhva Tiryakbhyam Sutra

D.V. Satish, B Ratna Raju

Abstract


It is an ancient methodology of Indian mathematics as it contains a 16 SUTRAS (formulae). A high speed complex 16 *16  multiplier design by  using urdhva tiryakbhyam sutra  is presented in this paper. By using this sutra the partial products and sums are generated in one step which reduces the design of architecture in processor’s. By using this sutra we can reduce the time with high extent when compare to array and booth multiplier. It can be implemented in many Digital Signal Processing (DSP) applications such as convolution, Fast Fourier Transform(FFT) filtering and in microprocessors. By using this method we reduce the propagation delay in comparison with array based architecture and parallel adder based implementation which are most commonly used architectures .The main parameters  of this paper is   propagation delay and dynamic power consumption were calculated and found reduced.


Keywords


- booth multiplier, FFT, DSP, propagation delay.

References


Prakash Narchi, Siddalingesh S Kerur, Jayashree C Nidagundi, Harish M Kittur and Girish V A. Implementation of Vedic Multiplier for Digital Signal Processing. IJCA Proceedings on International Conference on VLSI, Communications and Instrumentation (ICVCI) (16):1–5, 2011. Published by Foundation of Computer Science

Sumit Vaidya and Deepak Dandekar. “Delay-power perfor-mance comparison of multipliers in VLSI circuit design”. International Journal of Computer Networks & Communications (IJCNC), Vol.2, No.4, July 2010.

H. Thapliyal and H.R Arbania. “A Time-Area-Power Efficient Multiplier and Square Architecture Based On Ancient Indian Vedic Mathematics”, Proceedings of the 2004 International Conference on VLSI (VLSI’04), Las Vegas, Nevada, June 2004, pp. 434-439.

P. D. Chidgupkar and M. T. Karad, “The Implementation of Vedic Algorithms in Digital Signal Processing”, Global J. of Engg. Edu, Vol.8, No.2, 2004, UICEE Published in Australia.

Thapliyal H. and Srinivas M.B, “High Speed Efficient NxN Parallel Hierarchical Overlay Multiplier Architecture Based on Ancient Indian Vedic Mathematics”, Transactions on Engineering, Computing and Technology, 2004, Vol.2.

Harpreet Singh Dhillon and Abhijit Mitra, “A Reduced– Bit Multipliction Algorithm for Digital Arithmetics”, International

Journal of Computational and Mathematical Sciences 2.2 @ www.waset.orgSpring2008.

Honey Durga Tiwari, Ganzorig Gankhuyag, Chan Mo Kim and Yong

Beom Cho, “Multiplier design based on ancient Indian Vedic Mathematician”, International SoC Design Conference, pp. 65- 68, 2008.

Parth Mehta and Dhanashri Gawali, “Conventional versus Vedic mathematics method for Hardware implementation of a multiplier”, International conference on Advances in Computing, Control, and Telecommunication Technologies, pp. 640

Ramalatha, M.Dayalan, K D Dharani, P Priya, and S Deoborah, “High Speed Energy Efficient ALU Design using Vedic Multiplication Techniques”, International Conference on Advances in Computational Tools for Engineering Applications (ACTEA) IEEE, pp. 600-603, July 15-17, 2009.

Sumita Vaidya and Deepak Dandekar, “Delay-Power Performance comparison of Multipliers in VLSI Circuit Design”, International Journal of Computer Networks & Communications (IJCNC), Vol.2, No.4, pp. 47-56, July 2010.

S.S.Kerur, Prakash Narchi, Jayashree C N, Harish M Kittur and Girish V A “Implementation of Vedic Multiplier For Digital Signal Processing” International conference on VLSI communication & instrumentation (ICVCI), 2011.


Full Text: PDF [FULL TEXT]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.