Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 19314

The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.

3
votes
I think our friends on Stackoverflow have a solution for you that would be helpful. Despite this being MATLAB code, I believe the solution extends to a general answer to your question.
answered Jun 16 '16 by Brady Sheehan