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

An algorithm for the estimation of a fourier transform

โœ Scribed by Z. T. Volkova; S. I. Sirvidas

Publisher
Springer US
Year
1975
Tongue
English
Weight
862 KB
Volume
9
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Estimation of a Fourier transform
Estimation of a Fourier transform
โœ V. K. Zadiraka ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Springer US ๐ŸŒ English โš– 454 KB
The Extended Fourier Transform for 2D Sp
The Extended Fourier Transform for 2D Spectral Estimation
โœ Geoffrey S. Armstrong; Vladimir A. Mandelshtam ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

We present a linear algebraic method, named the eXtended Fourier Transform (XFT), for spectral estimation from truncated time signals. The method is a hybrid of the discrete Fourier transform (DFT) and the regularized resolvent transform (RRT) (J. Chen et al., J. Magn. Reson. 147, 129-137 (2000)). N

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