hey guys! today i learnt about FAST FOURIER TRANSFORM but i have no idea of how to implement this nice algorithm in c++ code. When i tried to search for the code in google all i got was a set of codes implementing it not directly but in one form or the other. So i am totally messed up.....
Guys suppose we are given two polynomial coeffecients each of degree N in vector form P and Q. Please can anyone write a nice C++ code with comments for multiplying these polynomials and output a vector of size 2N denoting the coeffecients of the resulting polynomial (product of Polynomials P and Q). Thanks in advance.
I've wrote an article about it one day, you can try use Google Translate or just get some code examples from.
not good, google translate doesnot work good, the translated article is not clearly understandable , any resource you can give in english??
I've checked the article translation with Google Translate and I confirm that the translation is very decent and clear enough.
Which fragments you could not understand?
Or provide a link at any chosen source you've found with "fft implementation with comments" search query and point which statements or paragraphs look troublesome to you?
now got it, thanks a lot :)
hey i tried to use ur code but its giving runtime-error, can u figure out the problem, here is my CODE
Why it is necessary to use auxiliary array? We can do it inplace.
I forgot it when I write this article. Yes, we can and this is one more place to optimize.
I guess this will help: FFT(c++)MITnotebook