A new approach to solve the sequence-length constraint problem in circular convolution using number theoretic transform
Haibing Lu, S.C. Lee · IEEE Transactions on Signal Processing · 1991
Offers a novel approach to solve the sequence-length constraint problem by proposing a formula to produce generalized modulo a numbers for number theoretic transforms. By selecting a prime M as the modulo number and choosing the least primitive root M as the a in the number theoretic transform, the sequence lengths become exponentially proportional to the word length. The set of generalized modulo numbers includes Mersenne and Fermat numbers. The circular convolution obtained by this method is accurate, i.e., without roundoff error.>