DocumentCode
1422691
Title
Generic Mixed-Radix FFT Pruning
Author
Wang, Linkai ; Zhou, Xiaofang ; Sobelman, Gerald E. ; Liu, Ran
Author_Institution
State Key Lab. of ASIC & Syst., Fudan Univ., Shanghai, China
Volume
19
Issue
3
fYear
2012
fDate
3/1/2012 12:00:00 AM
Firstpage
167
Lastpage
170
Abstract
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.
Keywords
computational complexity; fast Fourier transforms; FFT length; computational complexity; fast Fourier transform; generic mixed-radix FFT pruning; high-radix FFT pruning; input/output pruning patterns; Computational complexity; Discrete Fourier transforms; Fast Fourier transforms; Nickel; Signal processing algorithms; Vectors; Mixed-radix; fast fourier transform; pruning;
fLanguage
English
Journal_Title
Signal Processing Letters, IEEE
Publisher
ieee
ISSN
1070-9908
Type
jour
DOI
10.1109/LSP.2012.2184283
Filename
6130593
Link To Document