✦ LIBER ✦

Efficient algorithms for computing the new Mersenne number transform

✍ Scribed by Hamood, Mounir T.; Boussakta, Said

Book ID: 122144913
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 788 KB
Volume: 25
Category: Article
ISSN: 1051-2004
DOI: 10.1016/j.dsp.2013.10.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New transform using the Mersenne numbers

✍ Boussakta, S.; Holt, A.G.J. 📂 Article 📅 1995 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 698 KB

Fast mersenne number transforms for the

Fast mersenne number transforms for the computation of discrete fourier transforms

✍ Wan-Chi Siu; A.G. Constantinides 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Efficient parallel algorithms for optica

Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive

✍ Reif, John H. ;Tyagi, Akhilesh 📂 Article 📅 1997 🏛 The Optical Society 🌐 English ⚖ 379 KB

Efficient Algorithms for Computing the J

Efficient Algorithms for Computing the Jacobi Symbol

✍ S.M. Eikenberry; J.P. Sorenson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 464 KB

We present two new algorithms for computing the Jacobi Symbol: the right-shift and left-shift k-ary algorithms. For inputs of at most n bits in length, both algorithms take O(n 2 / log n) time and O(n) space. This is asymptotically faster than the traditional algorithm, which is based in Euclid's al

Efficient approximation algorithms for t

Efficient approximation algorithms for the achromatic number

✍ Piotr Krysta; Krzysztof Loryś 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Efficient algorithms for computing the 2

Efficient algorithms for computing the 2-D hexagonal Fourier transforms

✍ Grigoryan, A.M. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 491 KB