64 Point Radix-4 FFT Butterfly Realization using FPGA

The Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) play vital role in signal processing. It is often used in many communication systems. The proposed paper produces realization of N – bit FFT processor using Radix-4 algorithm. Radix-4 FFT processors have 3N/4 log4N complex multiplications and 3N log4N complex additions. N-bit processor contain N/4 butterfly for single stage. The single butterfly needs 12 complex adders and 3 complex multipliers. The proposed Radix-4 FFT processor is realized on VHDL platform using vertex FPGA.

Subscribe to the Innovation Insider Newsletter

Catch up on the latest tech innovations that are changing the world, including IoT, 5G, the latest about phones, security, smart cities, AI, robotics, and more. Delivered Tuesdays and Fridays

Subscribe to the Innovation Insider Newsletter

Catch up on the latest tech innovations that are changing the world, including IoT, 5G, the latest about phones, security, smart cities, AI, robotics, and more. Delivered Tuesdays and Fridays

Resource Details

Provided by:
International Journal of Engineering and Innovative Technology (IJEIT)
Topic:
Hardware
Format:
PDF