scientific article; zbMATH DE number 123802

MaRDI QIDQ4025490zbMATH OpenFDO

Authors Pinneng Yu, Zeng-rong Jiang

Publication date 18 February 1993

zbMATH Keywords

computational complexitydiscrete Fourier transformfast algorithmsimage and digital signal processingnumber theoretic transformsparallel computationpolynomial transformsprime factor FFT algorithmsradix fast Fourier transform algorithmssurvey article

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• scientific article; zbMATH DE number 3928865
• scientific article; zbMATH DE number 3926790
• Very fast computation of the radix-2 discrete Fourier transform
• Fast Fourier transform algorithms for parallel computers
• scientific article; zbMATH DE number 3956396

Cited in

(3)

• scientific article; zbMATH DE number 1876979 (Why is no real title available?)
• Calculation scheme based on a weighted primitive: application to image processing transforms
• Fast Fourier transforms: A tutorial review and a state of the art

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 Q4025490)