Pages that link to "Item:Q5664781"
From MaRDI portal
The following pages link to Discrete Convolutions via Mersenne Transforms (Q5664781):
Displaying 15 items.
- Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings (Q677546) (← links)
- Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM (Q832329) (← links)
- Finite field transforms and symmetry groups (Q1073775) (← links)
- Fast Fourier transformation based on number theoretic transforms (Q1123580) (← links)
- The AICE-CRT and digital signal processing algorithms: The complex case (Q1345182) (← links)
- Exact algorithm of multidimensional circulant deconvolution (Q1774849) (← links)
- On the factorization of polynomials and direct sum properties in integer polynomial rings (Q1922613) (← links)
- Algebraic decomposition of discrete functions (Q2457515) (← links)
- Fast algorithm for ``error-free'' convolution computation using Mersenne--Lucas codes (Q2497694) (← links)
- Efficient number theoretic transforms for convolutions using ROM arrays (Q3486848) (← links)
- Precise deconvolution using the Fermat number transform (Q3750038) (← links)
- Computational Complexity of Fourier Transforms Over Finite Fields (Q4140387) (← links)
- Enhancing Mersenne transforms by RNS with application to discrete convolution (Q4352603) (← links)
- ON INVERSES AND EIGENPAIRS OF PERIODIC TRIDIAGONAL TOEPLITZ MATRICES WITH PERTURBED CORNERS (Q5857999) (← links)
- An iterative error-free algorithm to solve Vandermonde systems (Q5931675) (← links)
