๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient parallel algorithm for FFT

โœ Scribed by Xiangzhen Qiao

Book ID
112959773
Publisher
Springer
Year
1987
Tongue
English
Weight
828 KB
Volume
2
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient parallel algorithm for mult
An efficient parallel algorithm for multiselection
โœ S. Olariu; Z. Wen ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

Olariu, S. and Z. Wen, An efficient parallel algorithm for multiselection, Parallel Computing 17 (1991) 689-693. The problem of multiselection arises frequently in databases. Here, given an unordered set S of n records and a sequence of m integers 1 ~< ql < q2 < .--< qm ~< n we are interested in an

A parallel FFT algorithm for transputer
A parallel FFT algorithm for transputer networks
โœ Yonggen Huang; Yakup Paker ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 468 KB

Huang, Y. and Y Paker, A parallel FFT algorithm for transputer networks, Parallel Computing 17 (1991) 895-906 This paper presents a parallel FFT algorithm suitable for MIMD machines\_ It has the properties of uniform granularity, the dominance of computation, and suitability to large data matrices T

An Efficient FFT Algorithm for Superscal
An Efficient FFT Algorithm for Superscalar and VLIW Processor Architectures
โœ Chris Basoglu; Woobin Lee; Yongmin Kim ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 480 KB

Real-Time Imaging 3, 441-453 (1997) applications, including digital video, images, graphics and audio. These new processors employ instruction-level parallelism, which includes the superscalar and very long instruction word (VLIW) computer architectures. Intel Pentium Pro, Hewlett-Packard PA-RISC 80