A table of analytical discrete Fourier transforms

DOI10.1016/0168-9274(96)00018-9MaRDI QIDQ2564292zbMATH OpenOpenAlexFDO

Authors William L. Briggs, Van Emden Henson

Publication date 10 July 1997

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-9274(96)00018-9

zbMATH Keywords

discrete Fourier transformtable

Mathematics Subject Classification ID

Tables in numerical analysis (65A05) Numerical methods for discrete and fast Fourier transforms (65T50)

Review text

Assume that a function \(f\) is sampled on the interval \([-A/2,A/2]\) at \(N\) equally spaced points to produce the sequence \(f_n\), where \(n=-N/2+1,\dots,N/2\). The forward discrete Fourier transform (DFT) is given by \[ F_k:= {1\over N}\sum^{N/2}_{n=-N/2+1} f_n\omega^{-nk}_N,\quad k=-N/2+1,\dots,N/2, \] where \(\omega_N:=e^{i2\pi/N}\). In this paper a table of analytical DFTs is provided, along with comments and observations. The table contains 45 items and it will certainly serve as a useful resource or teaching aid for Fourier practitioners.

Recommendations

• scientific article; zbMATH DE number 3918252
• Discrete and integral fourier transforms: analytical examples.
• scientific article; zbMATH DE number 3881847
• An extension of the discrete Fourier transform
• scientific article; zbMATH DE number 771803

Cited in

(2)

• Discrete and integral fourier transforms: analytical examples.
• Table of Fourier Coefficients

This page was built for publication: A table of analytical discrete Fourier transforms

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