scientific article; zbMATH DE number 11434
From MaRDI portal
Publication:3974366
zbMATH Open0753.65102MaRDI QIDQ3974366FDOQ3974366
Authors: Yuan Li 
Publication date: 25 June 1992
Title of this publication is not available (Why is that?)
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
algorithmcomputational efficiencymultidimensional discrete Fourier transformnumber of multiplicationsmultidimensional fast Fourier transform
Complexity and performance of numerical algorithms (65Y20) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (19)
- Title not available (Why is that?)
- A new multidimensional FFT based on one-dimensional decompositions
- The six-step algorithm for two-dimensional FFTs
- A version of the discrete Fourier transform with nodes on parallelepipedal lattices
- Title not available (Why is that?)
- On the odd-DFT and its applications to DCT/IDCT computation
- Title not available (Why is that?)
- Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- New algorithms for the multidimensional discrete Fourier transform
- Title not available (Why is that?)
- Vector coding algorithms for multidimensional discrete Fourier transform
- On computing the discrete Fourier and cosine transforms
- Fast computation of multidimensional DFT
- Vector computation of the discrete Fourier transform
- Quasi-affine transformation in higher dimension
- Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
- The weighted redundancy transform
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)
