Fast discrete Fourier transform with exponentially spaced points
1995
The use of fast algorithms for evaluation of discrete Fourier transform-inverse transform pairs with uniformly spaced input data but with output data required only at exponentially spaced intervals is investigated. The algorithms require order (N) arithmetic operations, rather than the order (N log(N)) required for the full FFT algorithm.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
2
References
2
Citations
NaN
KQI