Academic Journals Database
Disseminating quality controlled scientific knowledge

Hardware Implementation of FFT using Vertically and Crosswise Algorithm

ADD TO MY LIST
 
Author(s): Nidhi Mittal | Abhijeet Kumar

Journal: International Journal of Computer Applications
ISSN 0975-8887

Volume: 35;
Issue: 1;
Start page: 17;
Date: 2011;
Original page

Keywords: FFT | UrthvaTirvagbhyam | Vertically and Crosswise Algorithm | Vedic Mathematics

ABSTRACT
This paper is devoted for the implementation of FFT, which uses Vertical and Crosswise algorithms. Fast Fourier transform 'FFT' is an efficient algorithm to compute the N point DFT. But the Implementation of FFT requires large number of complex multiplications, so to make this process rapid and simple its necessary for a multiplier to be fast and power efficient. To tackle this problem UrdhvaTirvagbhyam in Vedic mathematics is an efficient method 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. It is one of the sutra of Vedic Mathematics equally applicable to all cases of multiplication. The conventional multiplication method requires more time and area on silicon than Vedic algorithms. In this paper the design for the architecture of FFT using Vertically and Crosswise is proposed and described using Verilog hardware description language. The code description is simulated using ModelSim SE 5.7f and synthesized using ISE Xilinx 9.2i for the FPGA device Spartan XC3S500efg320, Speed Grade4. The results show how by combining these two approaches proposed design methodology is time, area and power efficient.

Tango Rapperswil
Tango Rapperswil

     Affiliate Program