Abstract
The Fast Fourier Transform (FFT) is the basic building block for DSP applications where high processing speed is the critical requirement. Resource utilization and the number of computational stages in Radix-2 FFT structure implementation can be minimized by improving the performance of utilized multiplier and adder blocks. This work proposes a hardware design of an efficient Radix-2 FFT architecture using optimized multiplier and novel Parallel prefix (PP) adder. The designed FFT architecture results in low power and area with an increase in operation speed in comparison to the existing architectures. Our proposed Radix 2 FFT implementation results in 18.218 ns (6.030 ns logic delay and 12.118 ns router delay) in comparison with 24.003 ns delay for Wallace multiplier using Kogge Stone PP adder (M1P1), 24.162 ns delay for Wallace multiplier using Brent Kung PP adder (M2P2), 24.889 ns delay for Wallace multiplier using Landner Fischer PP adder (M3P3) and 22.827 ns delay for Wallace multiplier using Han Carlson PP adder (M4P4) algorithm. The proposed adder and hence the FFT processor can be used in different applications where high speed, low power, and less area is required. The novel PP architecture results in a 20.19% improvement in comparison with other state-of-art techniques.
Similar content being viewed by others
References
Akbar, E. P. A., & Mosleh, M. (2019). An efficient design for reversible wallace unsigned multiplier. Theoretical Computer Science, 773, 43–52.
Akhil, R., Koleti, J. R., Vijaya Bhaskar, A., Sathish, V., & Goud, B. A. (2020). Delay and area analysis of hardware implementation of FFT using FPGA. In: IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT): 1–6.
Brent, R. P., & Kung, H. T. (1982). A regular layout for parallel adders. IEEE Transactions on Computers, 31(3), 260–264.
Chen, J., Hu, J., Lee, S., & Sobelman, G. E. (2015). Hardware Efficient Mixed Radix-25/16/9 FFT for LTE Systems. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 23(2), 221–229.
Dimitrakopoulos, G., & Nikolos, D. (2005). high-speed parallel-prefix VLSI ling adders. IEEE Transactions on Computers, 54(2), 225–231.
Hans, T., & Carlson, D. A. (1987). Fast area-Eeficient VLSI adders. In: Proc. 8th IEEE Symposius on Computer Arithmetic, pp 49–56.
Hussain, I., Pandey, C. K., & Chaudhury, S. (2019). Design and analysis of high performance multiplier circuit. Devices for Integrated Circuit (DevIC): 23–24.
Jayakumar, D., & Logashanmugam, E. (2016). Design of combined Radix-2, Radix-4 and Radix-8 based single path delay feedback (SDF) FFT. Indian journal of science and technology, 9, 45.
Kavya, T., Deepa, K., & Jayamangala, S. (2017). Design and implementation of high performance Radix-2 and Radix-4 butterflies from FFT. International Journal of Electronics, Electrical and Computational System, 6(12), 363–367.
Kogge, P. M., & Stone, H. S. (1973). A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Transactions on Computers, 22(8), 786–793.
Ladner, R. E., & Fisher, M. J. (1980). Parallel Prefix Computation. Journal of the AssoclaUon for Computing Machinery, 27(4), 831–838.
Liu, S., & Liu, D. (2019). A High-Flexible Low-Latency Memory-Based FFT Processor for 4G, WLAN, and Future 5G. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 27(3), 511–523.
Narvekar, N. Raikar, S., Salkar, P., & Shirodkar, A. (2019). Implementation of FFT processor on FPGA using Vedic multiplier. International journal of research and analytical reviews, 6(2), 211–215.
Santhosh, L., & Thomas A. (2013). Implementation of Radix 2 and Radix 22 FFT algorithms on Spartan 6 FPGA. In: International Conference on Computer Communication and Networking.
Shih, X., Chou, H., & Liu, Y. (2018). VLSI Design and Implementation of Reconfigurable 46-Mode Combined-Radix-Based FFT Hardware Architecture for 3GPP-LTE Applications. IEEE Transactions on Circuits and Systems I: Regular Papers, 65(1), 118–129.
Singh, A. K., & Nandi, A. (2017). Design of Radix 2 butterfly structure using Vedic multiplier and CLA on Xilinx. In: Proc. IEEE Conference on Emerging Devices and Smart Systems.
Tang, S., Jan, F., Cheng, H., Lin, C., & Wu, G. (2014). Multimode memory-based FFT processor for wireless display FD-OCT medical systems. IEEE Transactions on Circuits and Systems I: Regular Papers, 61(12), 3394–3406.
Thakur, G., Sohal, H., & Jain, S. (2018a). Design and comparative performance analysis of various multiplier circuit. Journal of Scientific and Engineering Research, 5(7), 340–434.
Thakur, G., Sohal, H., & Jain, S. (2018b). An efficient design of 8-bit high speed parallel prefix adder. Research Journal of Science and Technology, 5(7), 340–349.
Thakur, G., Sohal, H., & Jain, S. (2018c). High speed RADIX-2 butterfly structure using novel Wallace multiplier. International Journal of Engineering & Technology, 7(3.4), 213–217.
Thakur, G., Sohal, H., & Jain, S. (2020a). Design and analysis of high-speed parallel prefix adder for digital circuit design applications. In: International Conference on Computational Performance Evaluation (ComPE), pp 095–100.
Thakur, G., Sohal, H., & Jain, S. (2020b). FPGA-based parallel prefix speculative adder for fast computation application. In: 2020 Sixth International Conference on Parallel, Distributed and Grid Computing (PDGC), pp. 206–210.
Wallace, C. S. (1964). A Suggestion for a Fast Multiplier. IEEE Transactions on Electronic Computers, 13(1), 14–17.
Water, R. S., & Swartzlander, E. E. (2010). A Reduced complexity wallace multiplier reduction. IEEE Transactions on Computers, 59(8), 1134–1137.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Thakur, G., Sohal, H. & Jain, S. A novel parallel prefix adder for optimized Radix-2 FFT processor. Multidim Syst Sign Process 32, 1041–1063 (2021). https://doi.org/10.1007/s11045-021-00772-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11045-021-00772-1