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