Fast Sparse DFT Computation for Arbitrary Length by Circular Convolution
Efficient computation of the Discrete Fourier Transform (DFT) for signals with structured frequency support remains a significant challenge in signal processing. The traditional Fast Fourier Transform (FFT) algorithm achieves O(NlogN) complexity, but substantial improvements are possible for signals…