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

A multi-purpose set of routines for the Fast Fourier Transform

โœ Scribed by Paolo Santin

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
155 KB
Volume
4
Category
Article
ISSN
0165-1684

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A high-performance fast Fourier transfor
A high-performance fast Fourier transform algorithm for the Cray-2
โœ David H. Bailey ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Springer US ๐ŸŒ English โš– 660 KB

Most implementations of a radix-2 fast Fourier transform on large scientific computers use algorithms that involve memory accesses whose strides are powers of two. (The term stride means the memory increment between successive elements stored or fetched.) Such strides are unacceptable for recently d

The price tag for a fast Fourier transfo
The price tag for a fast Fourier transform on any sample size
โœ James B. Cheek ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 598 KB

A computer program that makes a time-to-frequency domain transformation on a signal sampled with any number of equally spaced points has been available for over 10 years. That program, Glassman's discrete Fourier transform (DFT), is not generally used. Perhaps this low use is due to the wide and unp