An algorithm for computing the Nth roots of unity in bit-reversed order

DOI10.1109/TASSP.1980.1163476zbMATH Open0524.65090MaRDI QIDQ3036657FDOQ3036657

Authors: Robert G. Keys 

Publication date: 1980

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformbit-reversed ordercumulative roundoff errordiscrete Fourier transform of a time seriesNth roots of unity

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Probabilistic methods, stochastic differential equations (65C99) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

This page was built for publication: An algorithm for computing the Nth roots of unity in bit-reversed order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036657)