scientific article; zbMATH DE number 11434

MaRDI QIDQ3974366zbMATHFDO

Authors Yuan Li

Publication date 25 June 1992

zbMATH Keywords

algorithmcomputational efficiencymultidimensional discrete Fourier transformnumber of multiplicationsmultidimensional fast Fourier transform

Mathematics Subject Classification ID

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

Recommendations

• An efficient algorithm for the computation of the multidimensional discrete Fourier transform
• scientific article; zbMATH DE number 749495
• New algorithms for the multidimensional discrete Fourier transform
• scientific article; zbMATH DE number 888821
• scientific article; zbMATH DE number 3864463
• Fast computation of multidimensional DFT
• On computing the discrete Fourier and cosine transforms
• A flexible framework for multidimensional DFTs
• On computational aspects of the Fourier-Mukai transform
• A new numerical fourier transform in d-dimensions

Cited in

(19)

• The weighted redundancy transform
• A new multidimensional FFT based on one-dimensional decompositions
• scientific article; zbMATH DE number 4164117 (Why is no real title available?)
• New algorithms for the multidimensional discrete Fourier transform
• scientific article; zbMATH DE number 1247162 (Why is no real title available?)
• scientific article; zbMATH DE number 3942981 (Why is no real title available?)
• scientific article; zbMATH DE number 4011888 (Why is no real title available?)
• A version of the discrete Fourier transform with nodes on parallelepipedal lattices
• On computing the discrete Fourier and cosine transforms
• Fast computation of multidimensional DFT
• scientific article; zbMATH DE number 3864463 (Why is no real title available?)
• scientific article; zbMATH DE number 3885286 (Why is no real title available?)
• Vector computation of the discrete Fourier transform
• Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems
• Vector coding algorithms for multidimensional discrete Fourier transform
• The six-step algorithm for two-dimensional FFTs
• Quasi-affine transformation in higher dimension
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
• On the odd-DFT and its applications to DCT/IDCT computation

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