Also Available Domains DSP Core|Xilinx Vivado
The main objective of this project is to reduce the area by replacing the multipliers with the use of adders and shifters. This paper is to implement for reducing the number of computations by integrating the computation of the radix-2 Fast Fourier Transform (FFT) with the Distributed Arithmetic (DA) and Complex Binary Number System (CBNS)
Operations with complex numbers are widely used in DSP applications. In today’s technologies, the real and imaginary parts of complex numbers are processed separately, and then combined to form the final result. With CBNS, complex numbers can be represented as a single entity.
We propose a technique that combines the efficiency of the Distributed Arithmetic (DA) and the high performance of the Complex Binary Number System (CBNS) to transform the FFT algorithm into a multiplier-less structure and Further, the proposed architecture replaces multipliers with the use of adders and shifters, which considerably decrease the design area. The effectiveness of the proposed method is designed using Xilinx ISE 14.7
Keywords: Distributed arithmetic (DA), Fast Fourier Transform (FFT), Look-Up-Table (LUT), Complex Binary Number System (CBNS)
NOTE: Without the concern of our team, please don't submit to the college. This Abstract varies based on student requirements.

Software Requirements:
Hardware Requirements: