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

Programming an efficient radix-four FFT algorithm

โœ Scribed by Gregory H. Allen

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
260 KB
Volume
6
Category
Article
ISSN
0165-1684

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

An efficient clustering algorithm for pa
An efficient clustering algorithm for partitioning parallel programs
โœ Piyush Maheshwari; Hong Shen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled ลฝ . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm