Discrete Fourier transform algorithms for real valued sequences

DOI10.1109/TASSP.1984.1164310MaRDI QIDQ3698246zbMATH OpenFDO

Authors Jean-Bernard Martens

Publication date 1984

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

Full work available at URL https://doi.org/10.1109/TASSP.1984.1164310

zbMATH Keywords

discrete Fourier transformationlinear filtering of signalsmixed radix-(2,3) DFT algorithmssignal processingspectrum analysis

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Signal detection and filtering (aspects of stochastic processes) (60G35) Inference from stochastic processes and prediction (62M20) Probabilistic methods, stochastic differential equations (65C99) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Very fast computation of the radix-2 discrete Fourier transform
• Fast computation of real discrete Fourier transform for any number of data points
• In-place butterfly-style FFT of 2-D real sequences
• scientific article; zbMATH DE number 3915602
• An efficient FFT algorithm based on the discrete sine transform

Cited in

(4)

• Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT
• In-place butterfly-style FFT of 2-D real sequences
• Systolic implementation of real-valued discrete transforms via algebraic integer quantization
• Calculation of radix-2 discrete multiresolution Fourier transform

This page was built for publication: Discrete Fourier transform algorithms for real valued sequences

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