𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast-Fourier-Transform DePaking

✍ Scribed by M.A. Mccabe; S.R. Wassall

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
226 KB
Volume
106
Category
Article
ISSN
1064-1866

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast Fourier Transform for Fitness Lands
Fast Fourier Transform for Fitness Landscapes
✍ Dan Rockmore; Peter Kostelec; Wim Hordijk; Peter F. Stadler πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 307 KB

We cast some classes of fitness landscapes as problems of spectral analysis on various Cayley graphs. In particular, landscapes derived from RNA folding are realized on Hamming graphs and analyzed in terms of Walsh transforms; assignment problems are interpreted as functions on the symmetric group a

Four67, a fast fourier transform package
Four67, a fast fourier transform package
✍ J.P. Christiansen; R.W. Hockney πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 855 KB

Title of program (32 characters maximum): FOUR67 Catalogue number: ABUA Computer for which the program is designed and others upon which it is operable Computer: ICL KDF9. Installation: UKAEA Cuiham Laboratory Operating system or monitor under which the program is executed: EGDON 3 Programming langu

Phase error in fast Fourier transform an
Phase error in fast Fourier transform analysis
✍ Huang Dishan πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 391 KB

In this paper, by analysing a windowing signal with Fourier transform, the leakage-induced phase error is investigated, and the phase error distribution is indicated. Furthermore, a practical approach to correct leakage in a discrete frequency signal to obtain accurate phase information is presented

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