✦ LIBER ✦

Fast mersenne number transforms for the computation of discrete fourier transforms

✍ Scribed by Wan-Chi Siu; A.G. Constantinides

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 422 KB
Volume: 9
Category: Article
ISSN: 0165-1684
DOI: 10.1016/0165-1684(85)90035-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On discrete Fourier transforms (number-t

On discrete Fourier transforms (number-theoretic transforms) with minimum number of rotations (shifts)

✍ P. Duhamel; H. Hollmann 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Fast computation of Voigt functions via

Fast computation of Voigt functions via Fourier transforms

✍ Marcus H. Mendenhall 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Fast and stable algorithms for discrete

Fast and stable algorithms for discrete spherical Fourier transforms

✍ Daniel Potts; Gabriele Steidl; Manfred Tasche 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 829 KB

On computation of certain discrete Fouri

On computation of certain discrete Fourier transforms using binary calculus

✍ Nirdosh Bhatnagar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 741 KB

Methods for Fast Computation of Integral

Methods for Fast Computation of Integral Transforms

✍ Shay Gueron 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 394 KB

This paper is concerned with two aspects of the numerical calculation of integral transforms. The first is finding a necessary and sufficient condition that enables converting an integral transform into a correlation (convolution) form. The condition and the transformation that implements it are gen

Fast computation algorithm for the discr

Fast computation algorithm for the discrete Fourier transform of a real-valued sequence

✍ Mamoru Tsuchiya 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 986 KB