Connexions

Site Feedback

Properties of the DTFT

By Don Johnson

Introduction

This module will look at some of the basic properties of the Discrete-Time Fourier Transform (DTFT).

Note:
We will be discussing these properties for aperiodic, discrete-time signals but understand that very similar properties hold for continuous-time signals and periodic signals as well.

Discussion of Fourier Transform Properties

Linearity

The combined addition and scalar multiplication properties in the table above demonstrate the basic property of linearity. What you should see is that if one takes the Fourier transform of a linear combination of signals then it will be the same as the linear combination of the Fourier transforms of each of the individual signals. This is crucial when using a table of transforms to find the transform of a more complicated signal.

Example 1

We will begin with the following signal:

zn=a f1 n+b f2 n z n a f1 n b f2 n
1
Now, after we take the Fourier transform, shown in the equation below, notice that the linear combination of the terms is unaffected by the transform.
Zω=a F1 ω+b F2 ω Z ω a F1 ω b F2 ω
2

Symmetry

Symmetry is a property that can make life quite easy when solving problems involving Fourier transforms. Basically what this property says is that since a rectangular function in time is a sinc function in frequency, then a sinc function in time will be a rectangular function in frequency. This is a direct result of the similarity between the forward DTFT and the inverse DTFT. The only difference is the scaling by 2π2 and a frequency reversal.

Time Scaling

This property deals with the effect on the frequency-domain representation of a signal if the time variable is altered. The most important concept to understand for the time scaling property is that signals that are narrow in time will be broad in frequency and vice versa. The simplest example of this is a delta function, a unit pulse with a very small duration, in time that becomes an infinite-length constant function in frequency.

The table above shows this idea for the general transformation from the time-domain to the frequency-domain of a signal. You should be able to easily notice that these equations show the relationship mentioned previously: if the time variable is increased then the frequency range will be decreased.

Time Shifting

Time shifting shows that a shift in time is equivalent to a linear phase shift in frequency. Since the frequency content 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:

Example 2

We will begin by letting zn=fnη z n f n η . Now let us take the Fourier transform with the previous expression substituted in for zn z n .

Zω=fnηe(iωn)d n Z ω n f n η ω n
3
Now let us make a simple change of variables, where σ=nη σ n η . Through the calculations below, you can see that only the variable in the exponential are altered thus only changing the phase in the frequency domain.
Zω=fσe(iω(σ+η)n)d η =e(iωη)fσe(iωσ)d σ =e(iωη)Fω Z ω η f σ ω σ η n ω η σ f σ ω σ ω η F ω
4

Convolution

Convolution is one of the big reasons for converting signals to the frequency domain, since convolution in time becomes multiplication 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 is involved.

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 discrete-time convolution module for a more in depth explanation and derivation.

yn= f1 n f2 n= η = f1 η f2 nη y n f1 n f2 n η f1 η f2 n η
5

Time Differentiation

Since LTI systems can be represented in terms of differential equations, it is apparent with this property that converting to the frequency domain may allow us to convert these complicated differential equations to simpler equations involving multiplication and addition. This is often looked at in more detail during the study of the Z Transform.

Parseval's Relation

n =|fn|2=ππ|Fω|2d ω n f n 2 ω F ω 2
6
Parseval's relation tells us that the energy of a signal is equal to the energy of its Fourier transform.
Figure 1

Modulation (Frequency Shift)

Modulation is absolutely imperative to communications applications. Being able to shift a signal to a different frequency, allows us to take advantage of different parts of the electromagnetic spectrum is what allows us to transmit television, 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 went through the steps in the previous, time-shift proof, below we will just show the initial and final step to this proof:

zt=12πFωφeiωtd ω z t 1 2 ω F ω φ ω t
7
Now we would simply reduce this equation through another change of variables and simplify the terms. Then we will prove the property expressed in the table above:
zt=fteiφt z t f t φ t
8

Properties Demonstration

An interactive example demonstration of the properties is included below:

Figure 2: Interactive Signal Processing Laboratory Virtual Instrument created using NI's Labview.

Summary Table of DTFT Properties

Sequence Domain Frequency Domain
Linearity a1s1n+a2s2n a1 s1 n a2 s2 n a1S1ei2πf+a2S2ei2πf a1 S1 2f a2 S2 2f
Conjugate Symmetry sn sn real Sei2πf=Se(i2πf)¯ S 2f S 2f
Even Symmetry sn=sn sn sn Sei2πf=Se(i2πf) S 2f S 2f
Odd Symmetry sn=sn sn s n Sei2πf=Se(i2πf) S 2f S 2f
Time Delay snn0 s n n0 e(i2πfn0)Sei2πf 2 f n0 S 2f
Multiplication by n nsn n sn 1(2iπ)dSei2πfdf 1 2 f S 2f
Sum n=sn n sn Sei2π0 S 20
Value at Origin s0 s0 1212Sei2πfdf f 12 12 S 2f
Parseval's Theorem n=|sn|2 n sn 2 1212|Sei2πf|2df f 12 12 S 2f 2
Complex Modulation ei2πf0nsn 2 f0n sn Sei2π(ff0) S 2 f f0
Amplitude Modulation sncos2πf0n sn 2 f0n Sei2π(ff0)+Sei2π(f+f0)2 S 2 f f0 S 2 f f0 2
snsin2πf0n sn 2 f0n Sei2π(ff0)Sei2π(f+f0)2i S 2 f f0 S 2 f f0 2
Table 1: Discrete-Time Fourier Transform Properties