<< Chapter < Page  Chapter >> Page > 
This module will look at some of the basic properties of the DiscreteTime Fourier Transform (DTFT).
The combined addition and scalar multiplication properties in the table above demonstrate the basic property oflinearity. What you should see is that if one takes the Fourier transform of a linear combination of signals then itwill be the same as the linear combination of the Fourier transforms of each of the individual signals. This is crucialwhen using a table of transforms to find the transform of a more complicated signal.
We will begin with the following signal:
Symmetry is a property that can make life quite easy when solving problems involving Fourier transforms. Basicallywhat this property says is that since a rectangular function in time is a sinc function in frequency, then a sincfunction in time will be a rectangular function in frequency. This is a direct result of the similaritybetween the forward DTFT and the inverse DTFT. The only difference is the scaling by $2\pi $ and a frequency reversal.
This property deals with the effect on the frequencydomain
representation of a signal if the time variable isaltered. The most important concept to understand for the
time scaling property is that signals that are narrow intime will be broad in frequency and
The table above shows this idea for the general transformation from the timedomain to the frequencydomainof a signal. You should be able to easily notice that these equations show the relationship mentioned previously: if thetime variable is increased then the frequency range will be decreased.
Time shifting shows that a shift in time is equivalent to a linear phase shift in frequency. Since the frequencycontent depends only on the shape of a signal, which is unchanged in a time shift, then only the phase spectrum will be altered. This property is proven below:
We will begin by letting $z(n)=f(n\eta )$ . Now let us take the Fourier transform with the previousexpression substituted in for $z(n)$ .
Convolution is one of the big reasons for converting signals to the frequency domain, since convolution in time becomesmultiplication in frequency. This property is also another excellent example of symmetry between time and frequency.It also shows that there may be little to gain by changing to the frequency domain when multiplication in time isinvolved.
We will introduce the convolution integral here, but if you have not seen this before or need to refresh your memory,then look at the discretetime convolution module for a more in depth explanation and derivation.
Since LTI systems can be represented in terms of differential equations, it is apparent with this property that convertingto the frequency domain may allow us to convert these complicated differential equations to simpler equationsinvolving multiplication and addition. This is often looked at in more detail during the study of the Z Transform .
Modulation is absolutely imperative to communications applications. Being able to shift a signal to a differentfrequency, allows us to take advantage of different parts of the electromagnetic spectrum is what allows us to transmittelevision, radio and other applications through the same space without significant interference.
The proof of the frequency shift property is very similar to that of the time shift ; however, here we would use the inverse Fourier transform in place of the Fourier transform. Since we wentthrough the steps in the previous, timeshift proof, below we will just show the initial and final step to this proof:
An interactive example demonstration of the properties is included below:
Sequence Domain  Frequency Domain  

Linearity  ${\mathrm{a}}_{1}{s}_{1}(n)+{a}_{2}{s}_{2}(n)$  ${\mathrm{a}}_{1}{S}_{1}(e^{i\times 2\pi f})+{\mathrm{a}}_{2}{S}_{2}(e^{i\times 2\pi f})$ 
Conjugate Symmetry  $s(n)$ real  $S(e^{i\times 2\pi f})=\overline{S(e^{(i\times 2\pi f)})}$ 
Even Symmetry  $s(n)=s(n)$  $S(e^{i\times 2\pi f})=S(e^{(i\times 2\pi f)})$ 
Odd Symmetry  $s(n)=s(n)$  $S(e^{i\times 2\pi f})=S(e^{(i\times 2\pi f)})$ 
Time Delay  $s(n{n}_{0})$  $e^{(i\times 2\pi f{n}_{0})}S(e^{i\times 2\pi f})$ 
Multiplication by n  $ns(n)$  $\frac{1}{(2i\pi )}\frac{d S(e^{i\times 2\pi f})}{d f}$ 
Sum 
$\sum_{n=()} $∞

$S(e^{i\times 2\pi \times 0})$ 
Value at Origin  $s(0)$  $\int_{\left(\frac{1}{2}\right)}^{\frac{1}{2}} S(e^{i\times 2\pi f})\,d f$ 
Parseval's Theorem 
$\sum_{n=()} $∞

$\int_{\left(\frac{1}{2}\right)}^{\frac{1}{2}} \leftS(e^{i\times 2\pi f})\right^{2}\,d f$ 
Complex Modulation  $e^{i\times 2\pi {f}_{0}n}s(n)$  $S(e^{i\times 2\pi (f{f}_{0})})$ 
Amplitude Modulation  $s(n)\cos (2\pi {f}_{0}n)$  $\frac{S(e^{i\times 2\pi (f{f}_{0})})+S(e^{i\times 2\pi (f+{f}_{0})})}{2}$ 
$s(n)\sin (2\pi {f}_{0}n)$  $\frac{S(e^{i\times 2\pi (f{f}_{0})})S(e^{i\times 2\pi (f+{f}_{0})})}{2i}$ 
Notification Switch
Would you like to follow the 'Signals and systems' conversation and receive update notifications?