Number theoretic transform modulo K.2N+1, a prime

@article{Bhattacharya2000NumberTT,
  title={Number theoretic transform modulo K.2N+1, a prime},
  author={Mrinmoy Bhattacharya and Jaakko Astola},
  journal={2000 10th European Signal Processing Conference},
  year={2000},
  pages={1-4}
}
Due to its simple and real arithmetic structure Number Theoretic Transform is attractive for computation of convolution. However, there exists a stringent relation between the choice of modulus M and convolution length. Choice of modulus as K.2N+1, a prime, leads to relaxation of this constraint and wide choices of wordlength, with each of these associated with many choices of convolution length are are obtained. Under these choice of modulus a computational structure when the convolution… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Recursive structure for linear filtering using number theoretic transform

  • ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483)
  • 2001
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Fast Digital Convolutions using Bit-Shifts

VIEW 2 EXCERPTS
CITES BACKGROUND

A Fast Number Theoretic Finite Radon Transform

  • 2009 Digital Image Computing: Techniques and Applications
  • 2009
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

On programs for prime length FFTs and circular convolution

  • 1995 International Conference on Acoustics, Speech, and Signal Processing
  • 1995

Extending Winograd's small convolution algorithm to longer lengths

  • Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94
  • 1994

Fast Algorithms for Digital Signal Processing

I. L.
  • 1987

Index Mapping for Multidimensional formulation of the DFT and the Convolution "

S. W. Golomb, I. S. Reed, T. K. Truong
  • IEEE Trans . Acoust . , Speech , and Signal Processing
  • 1977

Integer Convolution over Finite Field GF ( 3 . 2 n + 1 ) * "

T. W. Parks
  • SIAM . J . Appl . Math .
  • 1977

Winograd , " On Computing the Discrete Fourier Transform "

S.
  • IEEE Trans . Acoust . , Speech , and Signal Processing
  • 1977

Similar Papers

Loading similar papers…