| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Irrational base discrete weighted transform"
(restored) |
(Crandall) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | The '''irrational base discrete weighted transform''' ('''IBDWT''') is a variant of the [[Fast Fourier transform]] using an irrational base. It was proposed by [[Richard Crandall]] and [[Barry Fagin]] in 1994. | + | {{Shortcut|IBDWT|Irrational base discrete weighted transform: a variant of the [[Fast Fourier transform]] using an irrational base.}} |
| + | The '''irrational base discrete weighted transform''' ('''IBDWT''') is a variant of the [[Fast Fourier transform]] using an [[Irrational number|irrational]] base. It was proposed by [[Richard E. Crandall]] and [[Barry Fagin]] in 1994. | ||
The IBDWT is used to perform FFT multiplication modulo [[Mersenne number]] in such programs as [[Prime95]], [[CUDALucas]], [[Glucas]], [[gpuLucas]]. | The IBDWT is used to perform FFT multiplication modulo [[Mersenne number]] in such programs as [[Prime95]], [[CUDALucas]], [[Glucas]], [[gpuLucas]]. | ||
| Line 10: | Line 11: | ||
*Percival, C. [http://www.ams.org/journals/mcom/2003-72-241/S0025-5718-02-01419-9/S0025-5718-02-01419-9.pdf ''Rapid multiplication modulo the sum and difference of highly composite numbers.''] Math. Comp. 72:387-395, 2003. | *Percival, C. [http://www.ams.org/journals/mcom/2003-72-241/S0025-5718-02-01419-9/S0025-5718-02-01419-9.pdf ''Rapid multiplication modulo the sum and difference of highly composite numbers.''] Math. Comp. 72:387-395, 2003. | ||
*Crandall, R., Pomerance, C. [http://thales.doa.fmph.uniba.sk/macaj/skola/teoriapoli/primes.pdf ''Prime numbers: A Computational Perspective: 2nd edition'']. Springer, 2005. | *Crandall, R., Pomerance, C. [http://thales.doa.fmph.uniba.sk/macaj/skola/teoriapoli/primes.pdf ''Prime numbers: A Computational Perspective: 2nd edition'']. Springer, 2005. | ||
| − | [[Category: | + | |
| + | [[Category:Algorithms]] | ||
Latest revision as of 07:12, 17 October 2024
The irrational base discrete weighted transform (IBDWT) is a variant of the Fast Fourier transform using an irrational base. It was proposed by Richard E. Crandall and Barry Fagin in 1994.
The IBDWT is used to perform FFT multiplication modulo Mersenne number in such programs as Prime95, CUDALucas, Glucas, gpuLucas.
In 2003, C. Percival proposed generalized IBDWT.
Literature
- Crandall, R., Fagin, B. Discrete weighted transforms and large-integer arithmetic. Mathematics of Computation 62, 205, 305-324, January 1994.
- Crandall, R. Topics in Advanced Scientific Computation. TELOS/Springer-Verlag, 1996.
- Percival, C. Rapid multiplication modulo the sum and difference of highly composite numbers. Math. Comp. 72:387-395, 2003.
- Crandall, R., Pomerance, C. Prime numbers: A Computational Perspective: 2nd edition. Springer, 2005.
