Fast number-theoretic transforms for digital filtering

Abstract
A special number-theoretic transform that can be computed, using a high-radix fast Fourier transform, is defined on primes of the form (2n − 1) 2n +1. Methods for finding these primes and the primitive dth roots of unity in a field modulo such primes are also included.

This publication has 0 references indexed in Scilit: