Abstract

This paper presents both worst case and average case analysis of roundoff errors occuring in the floating point computation of the recursive moving window discrete Fourier transform (DFT) with precomputed twiddle factors. We show the strong influence of precomputation errors – both within the initial fast Fourier transform (FFT) and the recursion – on the numerical stability. Numerical simulations confirm the theoretical results.

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 call

Disclaimer: 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.