Vector-radix FFT algorithm

The Vector-radix FFT algorithm is a specific type of Fast Fourier Transform (FFT) algorithm that is designed to efficiently compute the discrete Fourier transform (DFT) of a sequence of complex numbers. The primary goal of the FFT is to reduce the computational complexity of calculating the DFT, which has a direct computational cost of \( O(N^2) \), to \( O(N \log N) \), making it feasible for large datasets. ### Key Characteristics 1.