scientific article; zbMATH DE number 3896264
From MaRDI portal
Publication:3675490
signal processingspectral analysisdiscrete Fourier transformfast Fourier transformbibliographyWalsh functionsWalsh-Hadamard transformsnumber theoretic transformsHaar transformfast transformssignal filteringFermat number transformMersenne number transform
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) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Trigonometric interpolation (42A15) Algorithms in computer science (68W99)
Recommendations
Cited in
(58)- Transform decomposition in two-dimensional digital filter realization
- A generalized reverse jacket transform
- Generalised intermediate transforms: Methods of computation and potential applications
- scientific article; zbMATH DE number 790342 (Why is no real title available?)
- In-place self-sorting fast Fourier transform algorithm with local memory references
- Improved upper complexity bounds for the discrete Fourier transform
- Interactions and stability of solitary waves in shallow water.
- An analytic approach to practical state space reconstruction
- scientific article; zbMATH DE number 1134974 (Why is no real title available?)
- Transforms and fast algorithms for signal analysis and representations.
- A signal theory approach to support vector classification: the sinc kernel
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
- The efficient computation of Fourier transforms on the symmetric group
- Algorithms for fast convolutions on motion groups
- Index transforms for multidimensional DFT's and convolutions
- Advances on random sequence generation by uniform cellular automata
- Discrepancy-based error estimates for quasi-Monte Carlo. III: Error distributions and central limits
- Constructive universal algebra: An introduction
- Fast algorithm for transformation of lattices
- Number theoretic fast algorithms for bilinear and other generalized transformations
- Quantum mechanics on ${\mathbb Q}/{\mathbb Z}$Q/Z
- Non-Gaussian distributions
- Fast transforms of Toeplitz matrices
- Symmetry-based matrix factorization
- Efficient Computation of the Fourier Transform on Finite Groups
- Probabilistic analysis on the splitting-shooting method for image transformations
- Rapid solution of integral equations of scattering theory in two dimensions
- scientific article; zbMATH DE number 3932301 (Why is no real title available?)
- Exploiting compression in solving discretized linear systems
- Nonlinear \(q\)-ary codes with large code distance
- Fast progressive reconstruction of images using the DCT
- Numerical transforms
- The efficient computation of Fourier transforms on semisimple algebras
- Semi-analytic time-marching algorithms for semilinear parabolic equations
- Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems
- On some properties of Toeplitz matrices
- Iterative methods for ill-conditioned Toeplitz matrices
- Characteristic vector and weight distribution of a linear code
- Fundamental solutions for singularities within a layered solid
- A new class of quaternary codes
- scientific article; zbMATH DE number 3917667 (Why is no real title available?)
- scientific article; zbMATH DE number 3926790 (Why is no real title available?)
- Computation of approximate optimal policies in a partially observed inventory model with rain checks
- scientific article; zbMATH DE number 922651 (Why is no real title available?)
- scientific article; zbMATH DE number 7590336 (Why is no real title available?)
- Non-Gaussian distributions.
- Fast W transform. Algorithms and programs
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Orthogonal transforms in bases of slant step functions. II: Methods of generating orthogonal slant transforms with fast algorithms for image coding and compression
- Discrete Fourier transform computation using prime Ramanujan numbers
- scientific article; zbMATH DE number 4155738 (Why is no real title available?)
- A fast algorithm for expansion over spherical harmonics
- Evolving generation and fast algorithms of slantlet transform and slantlet-Walsh transform
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
- The smoothing properties of variational schemes for surface design
- Fast algorithms for Walsh transform in bit-reversed sequency order
- Double coset decompositions and computational harmonic analysis on groups
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 Q3675490)
