Discrete Convolutions via Mersenne Transforms

DOI10.1109/T-C.1972.223497MaRDI QIDQ5664781zbMATH OpenWikidataFDO

Authors Charles M. Rader

Publication date 1972

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

Full work available at URL https://doi.org/10.1109/T-C.1972.223497

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5664781)