scientific article
From MaRDI portal
Publication:3735040
zbMath0599.65098MaRDI QIDQ3735040
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convolutionfast Fourier transformsdiscrete Fourier transformdigital signal processingpolynomial transformscomputational complexity theorynumber-theoretic transformsWinograd Fourier transform algorithmBruun algorithmRader-Brenner algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (40)
An integral equation technique for the exterior and interior Neumann problem in toroidal regions ⋮ Approximate factorizations of Fourier matrices with nonequispaced knots ⋮ An error-free algorithm to solve a linear system of polynomial equations ⋮ Implementation of a self-sorting in-place prime factor FFT algorithm ⋮ On the computational complexity of the general discrete Fourier transform ⋮ Stochastic minimization with adaptive memory ⋮ Banyan models for the parallel implementation of the fast Fourier transform algorithm ⋮ An algorithm to solve Hilbert systems of linear equations precisely ⋮ The discrete \(\text{SU}(3)\) transform and its continuous extension for triangular lattices ⋮ Automatic derivation and implementation of fast convolution algorithms ⋮ Queue length distributions from probability generating functions via discrete Fourier transforms ⋮ Fast generalized Fourier transforms ⋮ Exact deconvolution using number-theoretic transforms ⋮ A real-time parallel application: The detection of gravitational waves by a network of heterogeneous workstations ⋮ Matrices of small Toeplitz rank, certain representations of the solution to an unstable system of linear equations with Toeplitz coefficient matrices, and related fast algorithms for solving such systems ⋮ Fast error-free algorithm for the determination of kernels of the periodic Volterra representation ⋮ Spectral methods in computational quantum mechanics ⋮ Error-free algorithms to solve special and general discrete systems of linear equations ⋮ Fast polynomial multiplication and convolutions related to the discrete cosine transform ⋮ Vector coding algorithms for multidimensional discrete Fourier transform ⋮ Communication efficient multi-processor FFT ⋮ Exact algorithm of multidimensional circulant deconvolution ⋮ A fast algorithm for convolution integrals with space and time variant kernels ⋮ Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes ⋮ Determination of inverse volterra kernels in nonlinear discrete systems ⋮ Generalization of the algebraic discrete Fourier transform with application to fast convolutions ⋮ On-line computation of convolutions ⋮ Nesting strategies for prime factor FFT algorithms ⋮ In-place self-sorting fast Fourier transform algorithm with local memory references ⋮ General operational calculus ⋮ Abelian semi-simple algebras and algorithms for the discrete Fourier transform ⋮ Fast unified computation of the multi-dimensional discrete sinusoidal transforms ⋮ Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation ⋮ Fast discrete transforms by means of eigenpolynomials ⋮ Transform decomposition in two-dimensional digital filter realization ⋮ The fast Hankel transform as a tool in the solution of the time dependent Schrödinger equation ⋮ The differential Fourier transform method ⋮ Relax, but don't be too lazy ⋮ Special algorithms for convolutions over Galois fields ⋮ An error-free Levison algorithm to solve integer Toeplitz system
This page was built for publication:
