[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Help-gsl] Re: DFT for CFT

From: Brian Hawkins
Subject: [Help-gsl] Re: DFT for CFT
Date: Fri, 15 Oct 2010 09:47:52 -0700

> Howto use DFT (dicrete fourier transform) to calculate CFT (continuous
> one) in finite number of points. The problem is that these poinrts
> could not even create arithmetic progression...
> So, we have point x1, .., xn.
> And want calculate transform in points q1, ..., qk.
> xi*qj<>C*i*j

Hi Sergey,

I'm not sure I follow your notation, but it sounds like you want the DTFT
(discrete time fourier transform).  Note that for a finite-length time
series input, you will have a finite set of linearly independent DTFT
outputs.  Instead of computing the DTFT, I recommend computing an FFT and
interpolating the output, e.g. with a windowed sinc filter.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]