# 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} }

- Published in 10th European Signal Processing Conference 2000

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

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

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 19 REFERENCES

## Fast Algorithms for Digital Signal Processing

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

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

## Winograd , " On Computing the Discrete Fourier Transform "

#### Similar Papers

Loading similar papers…