User Tools

    To create and edit articles, please register and log-in

Main Menu

Main menu
Click categories to expand


A-Z listingplugin-autotooltip__plain plugin-autotooltip_bigA-Z listing

This is an alphabetical index of all content pages.


Other categories

Utilities

Contact
Register

Also see

Importance Ratings
News
Legal
Donate/Sponsor
Curator's rationale


Wikenigma supports:


Feeds etc
rss / xml feed
sitemap file
A-Z listing (archived)


Auto-Translate Site
Indexed under : Mathematics

Wikenigma - an Encyclopedia of Unknowns Wikenigma - an Encyclopedia of the Unknown

FFT bounds

A Fast Fourier Transform (FFT) is well established computational / mathematical method for calculating the Discrete Fourier Transform (DFT) of a dataset. That's to say, which simple harmonic frequencies, in which ratios, can be combined to approximate a complex varying signal (i.e. waveform).

FFT is a widely used essential tool in signal analysis - in fields such as communications, audio processing, radar, orbital calculations etc. etc. .

The original DFT was discovered in the early 1800s, but the complexity of the calculations led to the development, mainly in the mid 1900s, of a special versions, called FFT, which greatly simplified the mathematical work involved - sometimes by a factor of more than 1,000.

The number of calculations required - known as the 'bounds' - is still substantial, and a goal is to define the minimum number necessary, and if possible improve the current methods.

The lower bounds are currently unknown. Formally stated : Can they be faster than $${\displaystyle O(N\log N)}$$

- where O is the computational load, and N is the size of the dataset.


    Share this page :

Dear reader : Do you have any suggestions for the site's content?

Ideas for new topics, and suggested additions / corrections for old ones, are always welcome.

If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !


Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.

( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)

Automatic Translation

You are currently viewing an auto-translated version of Wikenigma

Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.

Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.

Show another (random) article

DOKUWIKI IMPLEMENTATION DESIGN BY UNIV.ORG.UK JUNE 2022