✦ LIBER ✦

Parallel Computation of the Fast Fourier Transform on a Binary Tree Multiprocessor

✍ Scribed by Noboru Niki; Yoshizou Takahashi

Book ID: 112205958
Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 766 KB
Volume: 21
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.4690210407

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance evaluation of parallel fast

Performance evaluation of parallel fast fourier transform on a multiprocessor workstation

✍ Susumu Horiguchi; Takeo Nakada 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 634 KB

The fast Fourier transform (FFT) is very frequently used in various fields such as computer tomography, speech recognition, and image processing. As the area of computer applications has broadened, the quantity of data to be transformed has greatly increased. A parallel FFT is one way of achieving a

Ordered fast fourier transforms on a mas

Ordered fast fourier transforms on a massively parallel hypercube multiprocessor

✍ Charles Tong; Paul N. Swarztrauber 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

Comment on "Computation of the Fast Wals

Comment on "Computation of the Fast Walsh-Fourier Transform"

✍ Henderson, K.W. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 294 KB

A Parallel Implementation of the Fast Fo

A Parallel Implementation of the Fast Fourier Transform Algorithm

✍ Bergland, G. D. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 876 KB

Comment on "Computation of the Fast Wals

Comment on "Computation of the Fast Walsh-Fourier Transform"1

✍ Lechner, R.J. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 198 KB

Computation of the fast fourier transfor

Computation of the fast fourier transform on the star-connected cycle networks

✍ S. Shoari; N. Bagherzadeh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 761 KB