A recursive fast Fourier transformation algorithm

DOI10.1109/82.466641MaRDI QIDQ4338093zbMATH OpenOpenAlexFDO

Authors Annamária R. Várkonyi-Kóczy

Publication date 1 September 1997

Published in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityfast Fourier transformationfilter-bank structureparallel computationpolyphase filteringrecursive discrete transformation

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 3956396
• On a fast algorithm for computing the Fourier transform
• scientific article; zbMATH DE number 3982402
• scientific article; zbMATH DE number 3894433
• A fast recursive algorithm for the discrete sine transform
• scientific article; zbMATH DE number 610966
• scientific article; zbMATH DE number 3942981
• Rapid Computation of the Discrete Fourier Transform
• Fast and precise Fourier transforms
• scientific article; zbMATH DE number 698682

Cited in

(9)

• Implementation issues in the Fourier transform algorithm
• Real-time implementation of the moving FFT algorithm
• On recursive discrete Fourier transformation
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
• Efficient polyphase DFT filter banks with fading memory
• scientific article; zbMATH DE number 1927207 (Why is no real title available?)
• Order of N complexity transform domain adaptive filters
• Recursive discrete Fourier transform with unified IIR filter structures
• A recursive filter implementation of KL transform

This page was built for publication: A recursive fast Fourier transformation algorithm

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