Name
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/outp... |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/LSP.2012.2184283 | IEEE Signal Processing Letters |
Keywords | Field | DocType |
Signal processing algorithms,Nickel,Vectors,Discrete Fourier transforms,Computational complexity,Fast Fourier transforms | Mathematical optimization,Split-radix FFT algorithm,Prime-factor FFT algorithm,Arithmetic,Fast Fourier transform,Mathematics,Mixed radix,Signal processing algorithms,Pruning,Computational complexity theory | Journal |
Volume | Issue | ISSN |
19 | 3 | 1070-9908 |
Citations | PageRank | References |
4 | 0.41 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Linkai Wang | 1 | 4 | 0.75 |
| Xiaofang Zhou | 2 | 4 | 0.41 |
| Gerald E. Sobelman | 3 | 225 | 44.78 |
| Ran Liu | 4 | 5 | 1.19 |