discrete time Fourier transform in relation with continuous time Fourier transform
Fourier Transforms of Sampled SignalsFernando Diego Sanz Gamiz
Introduction
Computers are able to handle only finite number of data. Hence, ifwe are to study and treat real world signals (i.e. functions ) in a computer, a way to characterize signals by a finite numberof data has to be found.
If we sample the values of the signal at periodictimes we form the sequence . Does thissequence contain all the information relative to ?
We know from the sampling theorem that if the signal is bandlimited, the sampled sequence allows us to recover theoriginal continuous
time signal provided the sampling frequency is at least twice the maximum frequency of the signal. However,real signals are not of finite bandwidth as this would imply thesignal to be of infinite
time duration. Therefore, a problem ariseof how well can we approximate the original signal by thesampled sequence . In fact, we are interested in studyingthe spectrum of the original signal based upon the samples .
While the relation between and the spectrum of is widely used in communication and electronic engineering books, itis difficult to find a rigorous proof. We cover here the gap betweenengineering daily knowledge and rigorous mathematical proof of thenamed relations establishing under what assumptions
those relationsare valid.
Relation between Discrete Time Fourier Transform and Continuous time Fourier transform
Theorem 1.
Let be a bounded variation (it can be, in particular,piecewise smooth) function and let be its Fouriertransform 11in the present entry we will take the Fouriertransform of to be . Let . If converges
a.e as and is thereis such that a.e. then
(1) |
If additionally is continuous, theright hand side of (1) converges uniformly to the left handside in any closed interval .
Proof.
By hypothesis we can form the function
This function is obviously periodic of period and bounded,hence it can be expanded in its Fourier series which converge in; the Fourier theory shows that the convergence isuniformly in if iscontinuous.
where the coefficients are given by
As we can appeal the dominated convergencetheorem to write
Now, as is of bounded variation, the Jordan theorem onFourier transform inversion says that
and the result follows.
∎
There are, however, very which do notsatisfy the conditions required in the theorem above. Such is thecase of the pulse function
whose Fourier transform is -with the definition made infootnote 1-. behaves as , so will not converge in general 22for monotonedecreasing functions ”series behaves as integrals
”, that is, if converges or diverges so does; it will converge for those that makethe series an alternating (http://planetmath.org/AlternatingSeries) one, but not for the rest values of .Therefore we need another result which somehow relates both sides ofeq 1.
As we have pointed out, the problem with the pulsefunction is that its Fourier transform does not decay rapid enoughfor the series to converge. So we will try smoothing the signal outso that its Fourier transform will decay faster and, hopefully, theseries converges. We wish the smoothed version of to resemblethe original signal, so uniform approximation seems reasonable. But,as we will see, for an infinite number of samples each of these might require a different degree of approximation andit could be impossible to find an uniform approximation for all thesamples. So, we will focus on time limited signal, for which we havethe following result.
Notation.
will denote the set of test functions on and the set of rapidly decreasing functions on -the Schwartzspace-. The symbol above a function will denote its Fouriertransform. We know that and that the Fouriertransform is an isomorphism of onto itself. The product
oftwo functions and at will be denoted by. Convolution
will be denoted by .
Theorem 2.
Let be a test function and be an approximate identity.Let be a time limited bounded variation signal. If converges for all to a continuous function, then
(2) |
Proof.
Take the signal whose Fourier transform is. This signal satisfies, by hypothesis, theconditions of Theorem 1, so we can write
The right hand side is actually a sum of a finite number of termssince the signal is time limited -being theconvolution of two compact supported functions-. This makes theFourier series a continuous function, which, together with thehypothesis that is continuous, shows thatequality in the above equation is pointwise.
Now let and use the fact that is an approximate identity to obtain equation(2).∎
The rationale behind choosing test functions in the lasttheorem is that, in mostcases, will converge eventhough do not. This is becauserapidly decreasing functions decay faster than for any . So, for example, the Fourier transform of thepulse function has been tamed enough to make the series converge.
Remark 1.
When the signal is continuous, the right hand side of eqs.(1) or (2) reads
where . This is defined as the(Discrete Time) Fourier Transform, DTFT of the sequence