International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 111 - Issue 17 |
Published: February 2015 |
Authors: Shilpa Jumde, R. N. Mandavgane, D. M. Khatri |
![]() |
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 }, year = { 2015 }, volume = { 111 }, number = { 17 }, pages = { 10-13 }, doi = { 10.5120/19756-1379 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2015 %A Shilpa Jumde %A R. N. Mandavgane %A D. M. Khatri %T Review of Parallel Polynomial Multiplier based on FFT using Indian Vedic Mathematics%T %J International Journal of Computer Applications %V 111 %N 17 %P 10-13 %R 10.5120/19756-1379 %I Foundation of Computer Science (FCS), NY, USA
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.