Elementary Number Theory and Rader's FFT

DOI10.1137/15M1044990MaRDI QIDQ5348333zbMATH OpenFDO

Authors Shlomo Engelberg

Publication date 15 August 2017

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/15M1044990

zbMATH Keywords

Cooley-Tukey FFTdiscrete Fourier transformRader's fast Fourier transformzero-padding

Mathematics Subject Classification ID

Trigonometric and exponential sums (general theory) (11L03) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 55185
• scientific article; zbMATH DE number 1247205
• Elements of applied number theory and approximations
• Number theory, Fourier analysis and geometric discrepancy
• Elementary Methods in Number Theory
• scientific article; zbMATH DE number 3304123
• scientific article; zbMATH DE number 1861860

Cites work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Digital signal processing. An experimental approach

Cited in

(1)

• Discrete Fourier transform computation using prime Ramanujan numbers

Describes a project that uses

Uses Software

• FFTW
• OpenCourseWare

This page was built for publication: Elementary Number Theory and Rader's FFT

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