fast Fourier transform, FFT
fast Fourier transform
A computing method to decrease the calculation time of a Fourier transform. Since "fast Fourier transform (FFT)" is executed using a computer, calculations are performed by a discrete finite sum, instead by an integration. It greatly decreases the computation time by dividing the calculation into certain sub-groups and by changing the order of the calculation. In a discrete Fourier transform with a period of N, the number of operation is normally proportional to N2 but it is decreased to N log N in FFT. This method is used for analysis of high-resolution images.
Related Term(s)
Term(s) with "fast Fourier transform" in the description
Are you a medical professional or personnel engaged in medical care?
No
Please be reminded that these pages are not intended to provide the general public with information about the products.
