Name
Title | ||
|---|---|---|
A new approach to solve the sequence-length constraint problem in circular convolution using number theoretic transform |
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 |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/78.136538 | Signal Processing, IEEE Transactions |
Keywords | Field | DocType |
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 | Discrete mathematics,Combinatorics,Mersenne prime,Convolution,Round-off error,Modulo,Circular convolution,Fermat number,Number theory,Mathematics,Primitive root modulo n | Journal |
Volume | Issue | ISSN |
39 | 6 | 1053-587X |
Citations | PageRank | References |
8 | 1.08 | 3 |
Authors | ||
2 | ||