Affiliation:
1. Nagaji Institution of Technology and Management, Gwalior, India
Abstract
Many a times Mathematical computations are easier in frequency domain than time domain. Discrete Fourier transform (DFT) is a tool to convert signals from time domain to frequency domain which is widely used mainly in Digital Signal and Image Processing applications. Fast Fourier Transform (FFT) is a method to find DFT in time constraint applications which is affected by number of complex multiplier. In this paper 16-bit DFT using Vedic Multiplier, a high- speed multiplier is proposed with an objective to replace conventional complex multiplier and to decrease computation time. The proposed system is implemented in Virtex-4 FPGA and the results show that FFT using Urdhva Tiryakbhyam algorithm of Vedic multiplier is faster than other methods of DFT
Reference15 articles.
1. [1] Bhoite, P. V. S. Shastry and M. Rashinkar, "A systolic architecture based GF (2m) multiplier using modified LSD first multiplication algorithm," IEEE Region 10 Conference TENCON, Macao, 2015, pp.1-6.
2. [2] S. N. Gadakh and A. Khade, "Design and optimization of 16×16 Bit multiplier using Vedic mathematics," International Conference on Automatic Control and Dynamic Optimization Techniques, Pune, 2016, pp. 460-464.
3. [3] Vedic Mathematics by Jagadguru Swami Sri Bharati Krsna Tirthaji Maharaja (1965), Motilal Banarsidass Publication.
4. [4] A. R. Prakash and S. Kirubaveni, "Performance evaluation of FFT processor using conventional and Vedic algorithm," IEEE International Conference on Emerging Trends in Computing, Communication and Nanotechnology, Tirunelveli, 2013, pp. 89-94.
5. [5] Oppenheim, Alan V.; Schafer, R. W.; and Buck, J. R. (1999). Discrete-time signal processing. Upper Saddle River, N.J.: Prentice Hall.