Unified reconfigurable commutation scheme of FFT
Pavel Poperechny, Irina Poperechnaya · Issues of radio electronics · 2019
In the traditional scheme for calculating the fast Fourier transform (FFT), the input arguments for the butterfly computation are switched in a different order depending on the computation stage, which leads to additional resource expenditures in hardware or software implementation. The article offers the method for FFT calculation by means of unified communication scheme stageby‑stage. There is an iterating equation for hardware and software implementation. The equation consists of two‑level loops rather than tree level loop for the traditional scheme. According to the iterating equation the unified communication scheme FFT is provided for both time scale and frequency scale. Also the reconfiguration of schemes by different samples number is provided too. The rotating multipliers are the same like in non‑reconfigurable (fixed) communication scheme. So the offered approach does not required additional hardware or software resources.