Title :
A new approach to solve the sequence-length constraint problem in circular convolution using number theoretic transform
Author :
Lu, Huizhu ; Lee, Samuel C.
Author_Institution :
Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA
fDate :
6/1/1991 12:00:00 AM
Abstract :
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
Keywords :
binary sequences; constraint theory; information theory; number theory; signal processing; transforms; Fermat numbers; Mersenne numbers; circular convolution; digital signal processing; generalized modulo numbers; number theoretic transform; sequence-length constraint problem; Computer science; Constraint theory; Convolution; Digital signal processing; Hardware; Logic; Radar; Roundoff errors;
Journal_Title :
Signal Processing, IEEE Transactions on
