Generic Mixed-Radix FFT Pruning
Linkai Wang, Xiaofang Zhou, Gerald E. Sobelman, Ran Liu · IEEE Signal Processing Letters · 2012
Compared with traditional Fast Fourier Transform (FFT) algorithms, FFT pruning is more computationally efficient in those cases where some of the input values are zero and/or some of the output components are not needed. In this letter, a novel pruning scheme is developed for mixed-radix and high-radix FFT pruning. The proposed approach is applicable over a wide range of FFT lengths and input/output pruning patterns. In addition, it can effectively employ the benefits of high-radix FFT algorithms that have lower computational complexity.