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

On vectorizing the fast fourier transform

โœ Scribed by H. H. Wang

Publisher
Springer Netherlands
Year
1980
Tongue
English
Weight
586 KB
Volume
20
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

MFFT4: Four dimensional vectorized fast
MFFT4: Four dimensional vectorized fast Fourier transforms
โœ A. Nobile; V. Roberto; F. Saitta ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 361 KB

In this paper we present the long write-up of MFFT4, an extension of a previous package (MFFT) to include four dimensional fast Fourier transform (FFT) subprograms in vector form.

Fast-Fourier-Transform DePaking
Fast-Fourier-Transform DePaking
โœ M.A. Mccabe; S.R. Wassall ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 226 KB
Fast Fourier Transformation Based on Num
Fast Fourier Transformation Based on Number Theoretic Transforms
โœ Reza Adhami; Robert J. Polge ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 643 KB

Many fast algorithms have been proposed for computing the discrete Fourier transformation. Most of them are based on factorization with the goal of reducing the number of multiplications. They usejoating point arithmetic to avoid repetitious scaling and a sizeable wordlength to minimize quantization