Discrete Convolutions via Mersenne Transforms

DOI10.1109/T-C.1972.223497zbMath0251.65083WikidataQ56041177 ScholiaQ56041177MaRDI QIDQ5664781

Charles M. Rader

Publication date: 1972

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (15)

Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ The AICE-CRT and digital signal processing algorithms: The complex case ⋮ Precise deconvolution using the Fermat number transform ⋮ Fast Fourier transformation based on number theoretic transforms ⋮ On the factorization of polynomials and direct sum properties in integer polynomial rings ⋮ Efficient number theoretic transforms for convolutions using ROM arrays ⋮ Enhancing Mersenne transforms by RNS with application to discrete convolution ⋮ Algebraic decomposition of discrete functions ⋮ Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings ⋮ An iterative error-free algorithm to solve Vandermonde systems ⋮ Exact algorithm of multidimensional circulant deconvolution ⋮ Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes ⋮ ON INVERSES AND EIGENPAIRS OF PERIODIC TRIDIAGONAL TOEPLITZ MATRICES WITH PERTURBED CORNERS ⋮ Finite field transforms and symmetry groups ⋮ Computational Complexity of Fourier Transforms Over Finite Fields

This page was built for publication: Discrete Convolutions via Mersenne Transforms