I need to calculate the fourier transform of a f which belongs to a
l^`(Z) space.
l: low case letter of L and Z: set of integers
In my thought since f belongs to l^1(Z) (l: low caser letter of L) :
f(n) is discrete. Thefore its fourier transformm must be a discrete
fourier transform and be shown as follows:
Re: Zero Padding in radix 2 FFT ... Their resulting Fourier transform is continuous and consists of delta functions, but not at rationally related frequencies. ... continuous, infinite time continuous, infinite frequency ...DISCRETE, infinite time continuous, infinite frequency and PERIODIC ... When a function is PERIODIC, then sums can be taken over a single period. ... (comp.dsp)
Re: Zero Padding in radix 2 FFT ... continuous, infinite time continuous, infinite frequency ...DISCRETE, infinite time <Fourier Transform> continuous, infinite frequency ... When a function is PERIODIC, then sums can be taken over a single period. ... (comp.dsp)
Re: is FFT always approximate? ... spectrum, which should be discrete, will this FFT procedure be approximate? ... The Fast Fourier Transform, FFT, is an EXACT but efficient ...approximation to the true Fourier transform... ... (comp.dsp)
Re: CTFT of a discrete signal ...Fourier transform of a discrete 'signal/function'. ... I think that this should be equal to the DTFT of that signal, but I am not sure if that is 100% correct. ... When working in the discrete domain and using the DTFT my signal is just a bunch of numbers I think. ... However it 'feels' to me that to be able to take the CTFT of that discrete signal I should represent the numbers by scaled diracs. ... (comp.dsp)
