Efficient VLSI Design of Fast Fourier Transform using Reversible Gate
Keywords:
R₂B, R₄B, R₈B, SDF, FFTAbstract
The FFT is enumerate is DFT and DFT is enumerate is consecutive way, it accomplishes continuous application with constant preparing when the information is persistently taken care of through the processor. Included paper, joined is radix-2 butterfly (R₂B), R₄B & R₈B components based single path delay feedback (SDF) technique and reversible gate, for diminishing the computational stages and for decreasing the equipment use than the R₂B and R₄B FFT. The implemented SDF technique has single delay commutators at one stage without exception. N/2 point is consecutive controlled in consequence of delay component. The proposed technique has less number of multipliers and the more modest number of computational stages and butterfly components than the Radix-2 & 4 FFT.
References
S. F. Sultana and B. Patil, “Area efficient VLSI architecture for reversible radix-2 FFT algorithm,” in Proc. Int. Conf. Emerging Smart Computing and Informatics (ESCI), IEEE, 2021.
N. Nadar, M. Mehta, K. Bhat, J. Mendes, and R. Chaudhari, “Hardware implementation of pipelined FFT using polyphase decomposition,” in Proc. Int. Conf. Recent Trends in Electronics, Information, Communication & Technology (RTEICT), IEEE, 2021.
S. K. S. Shashidhara and H. C. Srinivasaiah, “Low power and area efficient FFT architecture through decomposition technique,” in Proc. Int. Conf. Computer Communication and Informatics (ICCCI), Coimbatore, India, Jan. 5–7, 2019.
F. Qureshi, J. Takala, A. Volkova, and T. Hilaire, “Multiplier-less unified architecture for mixed radix-2/3/4 FFTs,” in Proc. 25th Eur. Signal Process. Conf. (EUSIPCO), IEEE, 2017.
G. Ferreira, L. M. G. Rocha, E. Costa, and S. Bampi, “Combining m=2 multipliers and adder compressors for power efficient radix-4 butterfly,” in Proc. 63rd Int. Midwest Symp. Circuits and Systems (MWSCAS), IEEE, 2019.
S. Aseeri, “State-of-the-art FFT: Algorithms, implementations and applications—Reflections on the 2018 SIAM Conference on Parallel Processing for Scientific Computing,” pp. 1–3, Jun. 2018.
E. Konguvel and M. Kannan, “A survey on FFT/IFFT processors for next generation telecommunication systems,” Journal of Circuits, Systems and Computers, vol. 27, no. 3, p. 1830001, 2018.
W. C. Kang and J. Park, “Embedded DRAM-based memory customization for low-cost FFT processor design,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2017.
F. Qureshi, M. Ali, and J. Takala, “Multiplierless reconfigurable processing element for mixed radix-2/3/4/5 FFTs,” in Proc. IEEE, 2017.
R. H. Neuenfeld, M. B. Fonseca, E. A. C. da Costa, and J. P. Oses, “Exploiting addition schemes for the improvement of optimized radix-2 and radix-4 FFT butterflies,” in Proc. IEEE 8th Latin Amer. Symp. Circuits and Systems (LASCAS), pp. 1–4, 2017.
B. Silveira, G. Paim, B. Abreu, M. Grellert, C. M. Diniz, E. A. C. da Costa, et al., “Power-efficient sum of absolute differences hardware architecture using adder compressors for integer motion estimation design,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. PP, no. 99, pp. 1–12, 2017.
M. Najem, T. Bollengier, J. C. Le Lann, and L. Lagadec, “A cost effective approach for efficient time sharing of reconfigurable architectures,” in Proc. Int. Conf. FPGA Reconfiguration for General-Purpose Computing (FPGA4GPC), May 2017.
M. Z. A. Khan and S. Qadeer, “A new variant of radix-4 FFT,” in Proc. 13th Int. Conf. Wireless and Optical Communications Networks (WOCN), pp. 1–4, 2016.
C. A. Arun and P. Prakasam, “A mathematical approach on various radix-2ᶦ FFT algorithms,” in Proc. Int. Conf. Electrical, Electronics and Optimization Techniques (ICEEOT), pp. 1040–1045, 2016.
A. Rauf, M. A. Pasha, and S. Masud, “A novel split radix fast Fourier transform design for an adaptive and scalable implementation,” in Proc. 3rd Int. Symp. Wireless Systems within the Conf. Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS), pp. 116–121, 2016.
Downloads
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.