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