(algorithm) | Fast Fourier Transform - (FFT) An algorithm for computing the Fourier transform of a set of discrete data values. Given a finite
set of data points, for example a periodic sampling taken from
a real-world signal, the FFT expresses the data in terms of
its component frequencies. It also solves the essentially
identical inverse problem of reconstructing a signal from the
frequency data.The FFT is a mainstay of numerical analysis. Gilbert Strang described it as "the most important algorithm of our generation". The FFT also provides the asymptotically fastest known algorithm for multiplying two polynomials. Versions of the algorithm (in C and Fortran) can be found on-line from the GAMS server here. ["Numerical Methods and Analysis", Buchanan and Turner]. |

Browse

fashions

FASMI

Fassaite

Fast

Fast and loose

Fast and loose pulleys

fast asleep

Fast ATA

Fast ATA-2

fast break

fast buck

Fast by

fast day

fast dye

Fast Ethernet

fast food

**-- Fast Fourier Transform --**

fast lane

Fast liver

Fast of Ab

Fast of Av

fast one

Fast Packet

Fast Page Mode Dynamic Random Access Memory

Fast pulley

fast reactor

Fast SCSI

fast time scale

fast track

fast-breaking

fast-flying

fast-growing

Fast-handed

FASMI

Fassaite

Fast

Fast and loose

Fast and loose pulleys

fast asleep

Fast ATA

Fast ATA-2

fast break

fast buck

Fast by

fast day

fast dye

Fast Ethernet

fast food

fast lane

Fast liver

Fast of Ab

Fast of Av

fast one

Fast Packet

Fast Page Mode Dynamic Random Access Memory

Fast pulley

fast reactor

Fast SCSI

fast time scale

fast track

fast-breaking

fast-flying

fast-growing

Fast-handed