Discrete Convolutions via Mersenne Transrorms

@article{Rader1972DiscreteCV,
  title={Discrete Convolutions via Mersenne Transrorms},
  author={Charles M. Rader},
  journal={IEEE Transactions on Computers},
  year={1972},
  volume={C-21},
  pages={1269-1273}
}
  • C. Rader
  • Published 1 December 1972
  • Computer Science, Mathematics
  • IEEE Transactions on Computers
A transform analogous to the discrete Fourier transform is defined in the ring of integers with a multiplication and addition modulo a Mersenne number. The arithmetic necessary to perform the transform requires only additions and circular shifts of the bits in a word. The inverse transform is similar. It is shown that the product of the transforms of two sequences is congruent to the transform of their circular convolution. Therefore, a method of computing circular convolutions without… 
Digital filtering using complex Mersenne transforms
TLDR
It is shown that under certain conditions, these transforms can be computed by means of fast transform algorithms and permit the evaluation of digital convolutions with better efficiency and accuracy than does the Fast Fourier Transform.
A hardware efficient realisation of number theoretic convolvers
  • W. Siu, A. Constantinides
  • Computer Science, Mathematics
    ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 1986
TLDR
Hardware realisations of Number Theoretic Transforms that are based on the transformation of their fundamental relationships into recursive filter forms with single integer poles are proposed, which can relax considerably the normal sequence length and wordlength constraints for the NTT.
Fast Convolution using fermat number transforms with applications to digital filtering
TLDR
The structure of transforms having the convolution property is developed and an implementation on the IBM 370/155 is presented and compared with the fast Fourier transform (FFT) showing a substantial improvement in efficiency and accuracy.
Image Processing by Transforms Over a Finite Field
TLDR
The fast Fourier transform (FFT) algorithm of this transform is faster than the conventional radix-2 FFT and is used to filter a two-dimensional picture, and the results are presented with a comparison to the standard FFT.
Generalized Fermat-Mersenne number theoretic transform
A generalization of the Fermat and Mersenne number transform is suggested. The transforms are defined over finite fields and rings. This paper establishes the conditions necessary for these numbers
Generalized Fermat-Mersenne
A generalization of the Fermat and Mersenne num- ber transform is suggested. The transforms are defined over finite fields and rings. This paper establishes the conditions necessary for these numbers
Fast convolution using generalized Fermat/Mersenne number transforms
  • S. Lee, H. Lu
  • Computer Science
    ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing
  • 1988
TLDR
By using the generalized modulus numbers in computing fast convolution, the transform sequence lengths can be much greater than those obtained by either Fermat numbers or Mersenne numbers.
Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
TLDR
Efficient algorithms for computing one-dimensional convolutions and Discrete Fourier Transforms are derived from polynomial transforms, which are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications.
Enhancing Mersenne Transforms by Rns with Application to Discrete Convolution
TLDR
An enhanced algorithm for the exact computation of discrete convolution based on Mersenne transforms and multi-moduli residue number systems (RNSs) is developed and verifies the ability of this algorithm to solve many convolution problems.
Efficient number theoretic transforms for convolutions using ROM arrays
TLDR
Hardware realisations are proposed of number theoretic transforms that are based on the transformation of their fundamental relationships into recursive filter forms with single integer poles, which can relax considerably the normal sequence length and wordlength constraints for the NTT.
...
...

References

SHOWING 1-3 OF 3 REFERENCES
High-speed convolution and correlation
TLDR
A procedure for synthesizing and analyzing Fourier series for discrete periodic complex functions and computation times are proportional to log 2sub 2 as expressed in Eq.
The fast Fourier transform in a finite field
A transform analogous to the discrete Fourier transform may be defined in a finite field, and may be calculated efficiently by the 'fast Fourier transform' algorithm. The transform may be applied to
Fast Fourier transform method of computing difference equations and simulating filters
  • H. Helms
  • Computer Science
    IEEE Transactions on Audio and Electroacoustics
  • 1967
TLDR
A theorem is proved that two methods for using the fast Fourier transform to reduce the number of arithmetic operations and, therefore the time required for computing discrete, preformulated, and finite convolutions can be modified to compute such difference equations.