CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
Reseach Article

Review of Parallel Polynomial Multiplier based on FFT using Indian Vedic Mathematics

by Shilpa Jumde, R. N. Mandavgane, D. M. Khatri
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 111 - Number 17
Year of Publication: 2015
Authors: Shilpa Jumde, R. N. Mandavgane, D. M. Khatri
10.5120/19756-1379

Shilpa Jumde, R. N. Mandavgane, D. M. Khatri . Review of Parallel Polynomial Multiplier based on FFT using Indian Vedic Mathematics. International Journal of Computer Applications. 111, 17 ( February 2015), 10-13. DOI=10.5120/19756-1379

@article{ 10.5120/19756-1379,
author = { Shilpa Jumde, R. N. Mandavgane, D. M. Khatri },
title = { Review of Parallel Polynomial Multiplier based on FFT using Indian Vedic Mathematics },
journal = { International Journal of Computer Applications },
issue_date = { February 2015 },
volume = { 111 },
number = { 17 },
month = { February },
year = { 2015 },
issn = { 0975-8887 },
pages = { 10-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume111/number17/19756-1379/ },
doi = { 10.5120/19756-1379 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:48:09.101694+05:30
%A Shilpa Jumde
%A R. N. Mandavgane
%A D. M. Khatri
%T Review of Parallel Polynomial Multiplier based on FFT using Indian Vedic Mathematics
%J International Journal of Computer Applications
%@ 0975-8887
%V 111
%N 17
%P 10-13
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In general, most of the operations performed by any complex system need a multiplier. Hence, multiplier based on FFT is the desired aim. In this paper, we have presented a review of parallel polynomial multiplier based on FFT using Indian Vedic mathematics. Parallel polynomial multipliers were optimized for throughput and area resources, respectively. These multipliers are used for multiplication of different polynomial numbers based on exponential type, power type, etc. FFT system is used for multiplication so complex multiplier is the main part of this design. The coding of the design can be done in VHDL. For synthesis and simulation of the design Xilinx ISE EDA tool can be used.

References
  1. C. P. Rentería-Mejía, A. López-Parrado, J. Velasco-Medina, "Hardware Design of FFT Polynomial Multipliers", 978-1-4799-2507-0/14/$31. 00 ©2014 IEEE.
  2. Lo Sing Cheng, Ali Miri, Tet Hin Yeap, "EFFICIENT FPGA IMPLEMENTATION OF FFT BASED MULTIPLIERS", 0-7803-8886-0/05/$20. 00 ©2005 IEEE.
  3. E. Theochari, K. Tatas, D. J. Soudris, K. Masselos, K. Potamianos, "A REUSABLE IP FFT CORE FOR DSP APPLICATIONS", 0-7803-8251-X/04/$17. 00 © 2004 IEEE.
  4. A. Ronisha Prakash, S. Kirubaveni, "Performance Evaluation of FFT Processor Using Conventional and Vedic Algorithm", 2013 IEEE International Conference on Emerging Trends in Computing, Communication and Nanotechnology (ICECCN 2013), 978-1-4673-5036-5/13/$31. 00 © 2013 IEEE 89.
  5. Ali Chamas Al Ghouwayel, Amin Haj-Ali and Zouhair El-Bazzal, "Towards a Triple Mode Common Operator FFT for SoftWare Radio Systems", 19th International Conference on Telecommunications (ICT 2012), 978-1-4673-0747-5/12/$31. 00 ©2012 IEEE.
  6. P. D. Chidgupkar and M. T. Karad, "The Implementation of Vedic Algorithms in Digital Signal Processing", Global J. of Engg. Edu. , volume 8, Issue no. 2, Year 2004.
  7. M. Moreno and Y. Xie, "FFT-based dense polynomial arithmetic on multicores", 23rd Int. conf. on high perf. Comp. systems and applic. , June Year 2009, p. p. 378-399.
  8. Sushma R. Huddar and Sudhir Rao, Kalpana M. , Surabhi Mohan, "Novel High Speed Vedic Mathematics Multiplier using Compressors", 978-1-4673-5090-7/13/$31. 00 ©2013 IEEE.
  9. Laxman P. Thakre, Suresh Balpande, Umesh Akare, Sudhir Lande, "Performance Evaluation and Synthesis of Multiplier used in FFT operation using Conventional and Vedic algorithms", 978-0-7695-4246-1/10 $26. 00 © 2010 IEEE.
  10. Parth Mehta, Dhanashri Gawali, "Conventional versus Vedic mathematical method for Hardware implementation of a multiplier", 978-0-7695-3915-7/09 $26. 00 © 2009 IEEE.
  11. M. Ramalatha, "High Speed Energy Efficient ALU Design using Vedic Multiplication Techniques", 978-1-4244-3834-1/09/$25. 00 © 2009 IEEE.
  12. Sumit Vaidya and Deepak Dandekar, "DELAY-POWER PERFORMANCE COMPARISON OF MULTIPLIERS IN VLSI CIRCUIT DESIGN", International Journal of Computer Networks & Communications (IJCNC), Volume 2, Issue no. 4, July Year 2010.
Index Terms

Computer Science
Information Sciences

Keywords

FFT Polynomial multiplier Vedic Mathematics VHDL XILINX.