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"

From Prime-Wiki
Jump to: navigation, search
(shortcut)
(Moving to new subcategory)
Line 11: 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:Math]]
+
 
 +
[[Category:Algorithms]]

Revision as of 18:49, 28 September 2023

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.

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