Unique Skill ID: KS1250Z6RJKJSH7TP46V

Fast Fourier TransForms (FFT Algorithms)

A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. An FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse factors. As a result, it manages to reduce the complexity of computing the DFT from , which arises if one simply applies the definition of DFT, to , where is the data size. The difference in speed can be enormous, especially for long data sets where N may be in the thousands or millions. In the presence of round-off error, many FFT algorithms are much more accurate than evaluating the DFT definition directly or indirectly. There are many different FFT algorithms based on a wide range of published theories, from simple complex-number arithmetic to group theory and number theory.

Read Full Description
This Skill is part of Lightcast Open Skills, a library of over 32,000 skills used by schools, communities, and businesses that has become the standard language.
Search for other skills

Fast Fourier TransForms (FFT Algorithms) Job Postings Data

Top Companies Posting

Job Postings Analytics Loading Spinner

Top Job Titles

Job Postings Analytics Loading Spinner

Job Postings Trend

Job Postings Analytics Loading Spinner

Live Job Postings

Job Postings Analytics Loading Spinner

Looking for more data on job postings?