✦ LIBER ✦

A High-Speed Algorithm for the Computer Generation of Fourier Transforms

✍ Scribed by Andrews, H.

Book ID: 114605650
Publisher: IEEE
Year: 1968
Tongue: English
Weight: 802 KB
Volume: C-17
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.1968.229396

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on "A High-Speed Algorithm for

Comments on "A High-Speed Algorithm for the Computer Generation of Fourier Transforms"

✍ Macleod, I.D.G. 📂 Article 📅 1969 🏛 IEEE 🌐 English ⚖ 351 KB

A high-speed CMOS implementation of the

A high-speed CMOS implementation of the Winograd Fourier transform algorithm

✍ Lavoie, P. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 719 KB

Fully parallel, high-speed incoherent op

Fully parallel, high-speed incoherent optical method for performing discrete Fourier transforms

✍ Goodman, J. W.; Dias, A. R.; Woody, L. M. 📂 Article 📅 1978 🏛 Optical Society of America 🌐 English ⚖ 257 KB

A high-performance fast Fourier transfor

A high-performance fast Fourier transform algorithm for the Cray-2

✍ David H. Bailey 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 660 KB

Most implementations of a radix-2 fast Fourier transform on large scientific computers use algorithms that involve memory accesses whose strides are powers of two. (The term stride means the memory increment between successive elements stored or fetched.) Such strides are unacceptable for recently d

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

Bidiagonal factorization of Fourier matr

Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms

✍ Gader, P.D. 📂 Article 📅 1989 🏛 IEEE ⚖ 403 KB