Designing 64-Bit LUT based FFT Structure for High-Speed DSP Applications
M. Bharathi, G. Amrutha Sai, B. Divya Sree, K Bharadwaj Karthik, B. Uday Kiran Naik, Yasha Jyothi M Shirur · 2023
Digital signal Processing (DSP) utilizes The efficient Fast Fourier Transform (FFT) Methodology that is used to alter, filter, and decode digital audio, video, and image data. FFT is used to design Electrical Circuits, to solve differential equations, to analyze signals and to process images. Distributed Arithmetic (DA) is a multiplier-less implementation technique that computes the inner dot product between two signals-fixed and varying by using shifters and adders. It takes the values in a bit-serial fashion which suits for real-time processing. The Computation Logic Blocks (CLBs) of Field Programmable Gate Anays (FPGAs) Utilize Distributed Arithmetic. FFT can be calculated using the DA method. The existing method to calculate FFT is based on complex multiplications and additions which consume time as well as power. Hence DA based FFT has been proposed in which the delay is 29.3% less and the power is 21.8% less than that of the existing method.