Recursive structure for linear filtering using number theoretic transform

@inproceedings{Bhattacharya2001RecursiveSF,
  title={Recursive structure for linear filtering using number theoretic transform},
  author={Mrinmoy Bhattacharya and Jaakko Astola},
  year={2001}
}
A recursive structure for linear filtering is feasible using number theoretic transform (NTT) for certain choices of modulus. The structure is completely different from the typical FFT structure, although the lengths considered are square numbers and quite composite. Advantages gained are manifold. To mention few, there are no data index management in intermediate stages or twiddle factor multiplications and complex multiplications unlike in typical FFT structure, low multiplication per point… CONTINUE READING

References

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

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

  • 2000 10th European Signal Processing Conference
  • 2000
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A novel combination of NTTs using the MRC

  • Signal Processing
  • 1996
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

New Number Theoretic Transform

”...................
  • Signal Processing, vol. 28, 1992, pp. 1683-1684.
  • 1992
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Integer Convolution over Finite Field GF(3.2+1)

S. W. Golomb, I. S. Reed, T.K.Truong
  • SIAM. J. Appl. Math., vol. 32, 1977, pp. 356-365.
  • 1977
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…