scientific article

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

cyclic convolution algorithms multidimensional extensions fast signal processing algorithms Fourier transform algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for trigonometric approximation and interpolation (65T40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)

Related Items

One-modulus residue arithmetic algorithm to solve linear equations exactly, On convergence and limit cycles in digital filters in integer number systems, Rapid ``algebraic Fourier transforms on uniformly distributed meshes, Fast operations on linearized polynomials and their applications in coding theory, Correlation attacks on combination generators, Computing the reciprocal of units in Galois rings, Scalable and systolic architecture for computing double exponentiation over $\text{GF}(2^m)$, Representation of the Fourier transform by Fourier series, Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms, Guaranteed parameter set estimation for exponential sums: the three-terms case, Improved fast polynomial transform algorithm for cyclic convolutions, An algorithm to solve Hilbert systems of linear equations precisely, Adaptive wavelet decomposition of matrix flows, Complexity of computation in finite fields, Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system, Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system, Classical foundations of algorithms for solving positive definite Toeplitz equations, Solving systems of linear algebraic equations of a special kind with sparse polynomial and numerical coefficients, Two classes of elliptic discrete Fourier transforms: properties and examples, Invertibility of a special class of mean filter operators, An integer approximation method for discrete sinusoidal transforms, Unitarily inequivalent local and global Fourier transforms in multipartite quantum systems, Discretization and FIR filtering of continuous linear systems with internal and external point delays, Multiplexer implementation of low-complexity polynomial basis multiplier in $\mathrm{GF}(2^m)$ using all one polynomial, Finite field trigonometric transforms, Displacement operator based decompositions of matrices using circulants or other group matrices, Fast orthogonal identification of nonlinear stochastic models and radial basis function neural networks, Invited paper: Automatic speech recognition: History, methods and challenges, Fast infinite response filtering for speech processing, Error-free algorithms to solve special and general discrete systems of linear equations, Attacks Against Filter Generators Exploiting Monomial Mappings, Complexity of preprocessing of recursive filters for running in parallel, Automatic generation of fast algorithms for matrix–vector multiplication, On the real complexity of a complex DFT, Iterative Toeplitz solvers with local quadratic convergence, Modified FFTs for Fused Multiply-Add Architectures, Systolic arrays for multidimensional discrete transforms, The eigenstructure of finite field trigonometric transforms, Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes, A convergent composite mapping Fourier domain iterative algorithms for 3-D discrete tomography, Fast convolutions meet Montgomery, Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$, Wavelet transforms versus Fourier transforms, Algorithms for solving scattering problems for the Manakov model of nonlinear Schrödinger equations, Soliton orthogonal frequency division multiplexing with phase-frequency coding on the base of inverse scattering transform, Faster Pseudopolynomial Time Algorithms for Subset Sum, Factoring wavelet transforms into lifting steps, Recursive Bayesian estimation using piecewise constant approximations, High-accuracy formula for discrete calculation of Fourier transforms, Unnamed Item, Computer implementation of efficient discrete-convolution algorithms, Cryptanalysis of Achterbahn-128/80 with a New Keystream Limitation, Generalized discrete Fourier transform on the base of Lagrange and Hermite interpolation formulas, Systems of random equations over finite algebraic structures, High speed implementation of certain adaptive filters: A novel Toeplitz matrix decomposition approach, Parallel integration of ODEs based on convolution algorithms, The differential Fourier transform method, Finite field towers: Iterated presentation and complexity of arithmetic., An error-free Levison algorithm to solve integer Toeplitz system