Journal
IEEE SIGNAL PROCESSING LETTERS
Volume 19, Issue 3, Pages 167-170Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LSP.2012.2184283
Keywords
Mixed-radix; fast fourier transform; pruning
Categories
Funding
- National Natural Science Foundation of China [60876016]
- National Science and Technology Major Project of China [2011ZX03003-003-03]
- State Key Laboratory of ASIC and System [11GF001, 11MS003]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available