The following pages link to (Q3703780):
Displaying 50 items.
- Complexity of computation in finite fields (Q378003) (← links)
- An integer approximation method for discrete sinusoidal transforms (Q411197) (← links)
- Finite field trigonometric transforms (Q429771) (← links)
- Systolic arrays for multidimensional discrete transforms (Q547476) (← links)
- The eigenstructure of finite field trigonometric transforms (Q551319) (← links)
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
- Representation of the Fourier transform by Fourier series (Q851816) (← links)
- Displacement operator based decompositions of matrices using circulants or other group matrices (Q918633) (← links)
- Invited paper: Automatic speech recognition: History, methods and challenges (Q936405) (← links)
- Error-free algorithms to solve special and general discrete systems of linear equations (Q941471) (← links)
- Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms (Q1103363) (← links)
- Classical foundations of algorithms for solving positive definite Toeplitz equations (Q1127938) (← links)
- Complexity of preprocessing of recursive filters for running in parallel (Q1187929) (← links)
- Iterative Toeplitz solvers with local quadratic convergence (Q1207049) (← links)
- Factoring wavelet transforms into lifting steps (Q1271489) (← links)
- High speed implementation of certain adaptive filters: A novel Toeplitz matrix decomposition approach (Q1312198) (← links)
- Parallel integration of ODEs based on convolution algorithms (Q1313246) (← links)
- An error-free Levison algorithm to solve integer Toeplitz system (Q1322894) (← links)
- One-modulus residue arithmetic algorithm to solve linear equations exactly (Q1334720) (← links)
- On convergence and limit cycles in digital filters in integer number systems (Q1338662) (← links)
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system (Q1382940) (← links)
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system (Q1382941) (← links)
- Solving systems of linear algebraic equations of a special kind with sparse polynomial and numerical coefficients (Q1385781) (← links)
- High-accuracy formula for discrete calculation of Fourier transforms (Q1569115) (← links)
- Finite field towers: Iterated presentation and complexity of arithmetic. (Q1609402) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Adaptive wavelet decomposition of matrix flows (Q1662021) (← links)
- On the real complexity of a complex DFT (Q1752320) (← links)
- Recursive Bayesian estimation using piecewise constant approximations (Q1824597) (← links)
- Computer implementation of efficient discrete-convolution algorithms (Q1842459) (← links)
- Improved fast polynomial transform algorithm for cyclic convolutions (Q1902509) (← links)
- An algorithm to solve Hilbert systems of linear equations precisely (Q1908247) (← links)
- Two classes of elliptic discrete Fourier transforms: properties and examples (Q1932833) (← links)
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
- Algorithms for solving scattering problems for the Manakov model of nonlinear Schrödinger equations (Q2042416) (← links)
- Soliton orthogonal frequency division multiplexing with phase-frequency coding on the base of inverse scattering transform (Q2048234) (← links)
- Generalized discrete Fourier transform on the base of Lagrange and Hermite interpolation formulas (Q2095827) (← links)
- Correlation attacks on combination generators (Q2376654) (← links)
- Fast algorithm for ``error-free'' convolution computation using Mersenne--Lucas codes (Q2497694) (← links)
- Systems of random equations over finite algebraic structures (Q2583613) (← links)
- Rapid ``algebraic'' Fourier transforms on uniformly distributed meshes (Q2629436) (← links)
- Guaranteed parameter set estimation for exponential sums: the three-terms case (Q2641462) (← links)
- Unitarily inequivalent local and global Fourier transforms in multipartite quantum systems (Q2686240) (← links)
- Modified FFTs for Fused Multiply-Add Architectures (Q4293974) (← links)
- Discretization and FIR filtering of continuous linear systems with internal and external point delays (Q4326836) (← links)
- Computing the reciprocal of units in Galois rings (Q4549929) (← links)
- Fast infinite response filtering for speech processing (Q4637813) (← links)
- Attacks Against Filter Generators Exploiting Monomial Mappings (Q4639472) (← links)
- Automatic generation of fast algorithms for matrix–vector multiplication (Q4641573) (← links)
- Wavelet transforms versus Fourier transforms (Q4695330) (← links)
