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
Published in:
Signal Processing, IEEE Transactions on
(Volume:39
,
Issue:
6
)
Date of Publication:
Jun 1991
- Page(s):
-
1314
-
1321
- ISSN :
-
1053-587X
- INSPEC Accession Number:
-
3983879
- Digital Object Identifier :
-
10.1109/78.136538
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Jun 1991
- Sponsored by :
-
IEEE Signal Processing Society