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

Generating multipliers for a radix-4 parallel FFT algorithm

โœ Scribed by J.A Johnston

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A parallel 1-D FFT algorithm for the Hit
A parallel 1-D FFT algorithm for the Hitachi SR8000
โœ Daisuke Takahashi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 123 KB

In this paper, we propose a high-performance parallel one-dimensional fast Fourier transform (FFT) algorithm on clusters of vector symmetric multiprocessor (SMP) nodes. The fourstep FFT algorithm can be altered into a five-step FFT algorithm to expand the innermost loop length. We use the five-step

A Parallel Algorithm for 4ร—4 DCT
A Parallel Algorithm for 4ร—4 DCT
โœ J. Jiang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

By developing a generalized 1D approach and parallel computing algorithm, this paper presents a parallel algorithm design and hardware implementation for the computation of 4\_4 DCT. This algorithm sorts all the 2D input pixel data into four groups. Each group is then forwarded to a 1D DCT arithmeti