Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
