scientific article; zbMATH DE number 1927207

MaRDI QIDQ4708069zbMATH OpenFDO

Authors Zümray Dokur, Tamer Ölmez

Publication date 12 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2412/24120551.htm

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Computing methodologies and applications (68U99) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Recursive Fourier transform using convolutions
• Recursive Fourier transform algorithms with integrated windowing
• A recursive fast Fourier transformation algorithm
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
• Very fast computation of the radix-2 discrete Fourier transform

Cited in

(13)

• Algorithm to retrieve real coefficients of a two-dimensional Fourier series using complex one-dimensional FFTs
• Real-time implementation of the moving FFT algorithm
• Systems analysis of discrete two-dimensional signal processing in Fourier bases
• Matrix recursive expressions of the DFT of even and odd complex sequences
• On the processing of decimated signals
• On recursive discrete Fourier transformation
• Recursive discrete Fourier transformation with unevenly spaced data
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
• Efficient computation of two-dimensional Gaussian windows
• Spectral transformations for two-dimensional filters via FFT
• Recursive discrete Fourier transform with unified IIR filter structures
• Recursive Fourier transform using convolutions
• Recursive Fourier transform algorithms with integrated windowing

This page was built for publication:

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