Re: octave -fourier series coefficients question

[James Sherman Jr.]

On Wed, Mar 27, 2013 at 4:46 PM, semih soykan
<address@hidden> wrote:
> hi all.
> I am a total newbie in octave,
> I ve looked for a default method which will take a signal in N-by-1 vector
> and return fourier series coefficients in same format. but i couldn't found
> . is there any default method for this? if not what should be a valid
> algorithm for this? any help is appreciated.
>
> and as i said i am a newbie about all octave technology but it seem i ll
> need to dig octave and signal processing for a while, as a mentor what do
> you suggest me? which tutorial should i follow and what should be my way to
> handle all?
>
>
>
> --
> View this message in context: 
> http://octave.1599824.n4.nabble.com/octave-fourier-series-coefficients-question-tp4651247.html
> Sent from the Octave - General mailing list archive at Nabble.com.
> _______________________________________________
> Help-octave mailing list
> address@hidden
> https://mailman.cae.wisc.edu/listinfo/help-octave

The standard method for finding the discrete fourier transform is
Cooley–Tukey algorithm
(http://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm).
I'm not a hundred percent sure this is how octave does it, and I don't
have Octave available right now (but if you type "edit fft.m" you
could get it, but I'm pretty sure its a precompiled function), but if
you're interested, its a start.

Or, are you asking what function in Octave does this?  Thats an easy
answer: fft.  Type "help fft" for useage.

James Sherman