scientific article; zbMATH DE number 3928865
From MaRDI portal
Publication:3703780
cyclic convolution algorithmsfast signal processing algorithmsFourier transform algorithmsmultidimensional extensions
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) 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) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
Cited in
(77)- Algorithms for fast multidimensional signal extraction
- Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
- Classical foundations of algorithms for solving positive definite Toeplitz equations
- Complexity of preprocessing of recursive filters for running in parallel
- Iterative Toeplitz solvers with local quadratic convergence
- Factoring wavelet transforms into lifting steps
- High speed implementation of certain adaptive filters: A novel Toeplitz matrix decomposition approach
- Parallel integration of ODEs based on convolution algorithms
- An error-free Levison algorithm to solve integer Toeplitz system
- One-modulus residue arithmetic algorithm to solve linear equations exactly
- On convergence and limit cycles in digital filters in integer number systems
- 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
- Solving systems of linear algebraic equations of a special kind with sparse polynomial and numerical coefficients
- High-accuracy formula for discrete calculation of Fourier transforms
- Finite field towers: Iterated presentation and complexity of arithmetic.
- Fast operations on linearized polynomials and their applications in coding theory
- Adaptive wavelet decomposition of matrix flows
- On the real complexity of a complex DFT
- Recursive Bayesian estimation using piecewise constant approximations
- Computer implementation of efficient discrete-convolution algorithms
- Improved fast polynomial transform algorithm for cyclic convolutions
- An algorithm to solve Hilbert systems of linear equations precisely
- On algorithms for digital signal processing of sequences
- Two classes of elliptic discrete Fourier transforms: properties and examples
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
- 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
- Generalized discrete Fourier transform on the base of Lagrange and Hermite interpolation formulas
- Correlation attacks on combination generators
- Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes
- Systems of random equations over finite algebraic structures
- Rapid ``algebraic Fourier transforms on uniformly distributed meshes
- Guaranteed parameter set estimation for exponential sums: the three-terms case
- Unitarily inequivalent local and global Fourier transforms in multipartite quantum systems
- On computational aspects of certain optimal digital signal processing algorithms
- scientific article; zbMATH DE number 3880785 (Why is no real title available?)
- Fast algorithms for signal processing.
- scientific article; zbMATH DE number 3974248 (Why is no real title available?)
- Complexity of computation in finite fields
- scientific article; zbMATH DE number 17431 (Why is no real title available?)
- scientific article; zbMATH DE number 44159 (Why is no real title available?)
- scientific article; zbMATH DE number 123802 (Why is no real title available?)
- An integer approximation method for discrete sinusoidal transforms
- scientific article; zbMATH DE number 1217618 (Why is no real title available?)
- Modified FFTs for Fused Multiply-Add Architectures
- Finite field trigonometric transforms
- Discretization and FIR filtering of continuous linear systems with internal and external point delays
- scientific article; zbMATH DE number 1118826 (Why is no real title available?)
- scientific article; zbMATH DE number 1167953 (Why is no real title available?)
- Computing the reciprocal of units in Galois rings
- Fast infinite response filtering for speech processing
- Attacks against filter generators exploiting monomial mappings
- Automatic generation of fast algorithms for matrix–vector multiplication
- scientific article; zbMATH DE number 195038 (Why is no real title available?)
- Wavelet transforms versus Fourier transforms
- Fast orthogonal identification of nonlinear stochastic models and radial basis function neural networks
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Multiplication
- The differential Fourier transform method
- Fast convolutions meet Montgomery
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- Systolic arrays for multidimensional discrete transforms
- Cryptanalysis of Achterbahn-128/80 with a New Keystream Limitation
- The eigenstructure of finite field trigonometric transforms
- A convergent composite mapping Fourier domain iterative algorithms for 3-D discrete tomography
- Invertibility of a special class of mean filter operators
- Algorithms for solving the inverse scattering problem for the Manakov model
- Right and left inverse scattering problems formulations for the Zakharov-Shabat system
- Indexing in the Good-Thomas fast Fourier transform algorithm
- Transforms and fast algorithms for signal analysis and representations.
- On the synthesis of fast algorithms for signal processing
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
- Representation of the Fourier transform by Fourier series
- Displacement operator based decompositions of matrices using circulants or other group matrices
- Invited paper: Automatic speech recognition: History, methods and challenges
- Error-free algorithms to solve special and general discrete systems of linear equations
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 Q3703780)
