Fast Fourier transform and convolution algorithms
Bruun algorithmcomputational complexity theoryconvolutiondigital signal processingdiscrete Fourier transformfast Fourier transformsnumber-theoretic transformspolynomial transformsRader-Brenner algorithmWinograd Fourier transform algorithm
Software, source code, etc. for problems pertaining to number theory (11-04) Software, source code, etc. for problems pertaining to field theory (12-04) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04) Trigonometric interpolation (42A15) Signal detection and filtering (aspects of stochastic processes) (60G35) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
- Combining computation and data transmission in the systems with switches
- Fourier reconstruction in tomography
- Nonlinear spectral characteristics of large deformation elasticity theory
- Index transforms for multidimensional DFT's and convolutions
- Assessing fast Fourier transform algorithms.
- Zur Algebraischen Diskreten Fourier-Transformation
- Algorithms for numerical evaluation of the compound Poisson distribution
- A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data
- A fast numerical method for two-dimensional Riesz space fractional diffusion equations on a convex bounded region
- The partial fast Fourier transform
- Generalizing the discrete Fourier transform
- Computer implementation of efficient discrete-convolution algorithms
- A fast algorithm for expansion over spherical harmonics
- Self-correcting polynomial programs
- Generating the Laguerre expansion coefficients by solving a one-dimensional transport equation
- Comparing methods and defining practical requirements for extracting harmonic tidal components from groundwater level measurements
- A low-rank approach to the computation of path integrals
- On one problem of calculating a two-dimensional convolution with an exponential kernel
- Rapid ``algebraic Fourier transforms on uniformly distributed meshes
- A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
- Two new algorithms for matrix multiplication and vector convolution
- Precise deconvolution using the Fermat number transform
- scientific article; zbMATH DE number 4009769 (Why is no real title available?)
- Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials
- Precise multidimensional deconvolution using the polynomial algebra concept
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Discretization and FIR filtering of continuous linear systems with internal and external point delays
- New frameworks for Montgomery’s modular multiplication method
- The twenty-fourth Fermat number is composite
- Computing invariant sets of random differential equations using polynomial chaos
- Derivation and analysis of fast bilinear algorithms for convolution
- Multiplication
- Towards an Implementation of a Computer Algebra System in a Functional Language
- ON INVERSES AND EIGENPAIRS OF PERIODIC TRIDIAGONAL TOEPLITZ MATRICES WITH PERTURBED CORNERS
- Features of the computational implementation of the algorithm for estimating the Lyapunov exponents of systems with delay
- The explicit solutions for a class of fractional Fourier–Laplace convolution equations
- Generalized convolution as a tool for the multi-dimensional filtering tasks
- A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
- Improved upper complexity bounds for the discrete Fourier transform
- An algebra of arrays and almost perfect watermarks
- On the solvability of certain discrete equations and related estimates of discrete operators
- Block decomposition structures for the fast modular implementation of two-dimensional digital filters
This page was built for publication: Fast Fourier transform and convolution algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159974)
