Improved Radix-4 Fast Fourier Transform Algorithm Used for Wireless Communication

In this study, we proposed a superior Radix-4 Fast Fourier Transform technique. This may be accomplished using re-indexed samples generated by the Radix-4 Fast Fourier Transform algorithm's decomposition. When compared to the corresponding old Fast Fourier Transform techniques, these improved Radix-4 processes will minimise the number of twiddle factor evaluations or lookup tables while incurring no additional complexity. Because it considerably decreases the quantity of difficult computations and information transfers, the Radix-4 method is the most exciting and enigmatic Cooley-Tukey Fast Fourier Transform algorithm. However, it is less dependable than the Radix-2 Fast Fourier Transform approach. The emphasis has shifted in recent years to improving twiddle factor address and load generation since reducing the number of calculations in these ways afterwards becomes more difficult. For the creation of high-speed, low-power FFT computers for uses in wireless communication, radar, and portable computing, these advancements are crucial. The Radix-4 Decimation-in-Frequency (DIF) Fast Fourier Transform method is demonstrated in this research. It has been demonstrated that the number of twiddle factor assessments may be greatly decreased by making a few small adjustments to the conventional Radix-4 DIF Fast Fourier Transform techniques.