Scribd
Upload
71 views

Lecture 5

1. The document discusses the discrete Fourier transform (DFT) and its relation to the discrete-time Fourier transform (DTFT). The DFT is the sampled version of the DTFT. 2. It also discusses the fast Fourier transform (FFT) algorithm, which is an efficient way to calculate the DFT, especially for digital systems like MATLAB and DSPs. 3. Some key time-domain and frequency-domain concepts are also summarized, including baseband and passband signals, and how baseband signals are shifted to passband through modulation.

Uploaded by

api-3702538
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
71 views

Lecture 5

1. The document discusses the discrete Fourier transform (DFT) and its relation to the discrete-time Fourier transform (DTFT). The DFT is the sampled version of the DTFT. 2. It also discusses the fast Fourier transform (FFT) algorithm, which is an efficient way to calculate the DFT, especially for digital systems like MATLAB and DSPs. 3. Some key time-domain and frequency-domain concepts are also summarized, including baseband and passband signals, and how baseband signals are shifted to passband through modulation.

Uploaded by

api-3702538
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

DTFT Problems

Find DTFT of
COMMUNICATION SYSTEMS x[ n]
1 M /2 n M /2
0 elsewhere
Lecture # 5
Find DTFT of
14th Feb 2007 x[n] = an u[n-5]

Instructor
WASEEM KHAN

Centre for Advanced Studies in Engineering

Discrete Fourier Transform Discrete Fourier Transform


N 1
1 kn
DFT is the sampled version of DTFT. IDFT x[n ] X [ k ]W N
N k 0
Discrete in time DTFT
Discrete in frequency DFT Relating index k to frequency
k
Let x[n] be a finite-length sequence of length N, i.e. fk
x[n] = 0 outside the range 0 n N 1
NT s
The DFT of x[n], denoted as X [k], is defined by
N 1
where Ts = sampling period
X [k ] x[ n ]W Nkn , k 0 ,1,...., N 1
n 0
N/2 samples ( 2 ) are same as other N/2 (0 ).
2
j
where W N e N Relating DTFT to DFT
X(k) = X( )| = 2 k/N

Discrete Fourier Transform Discrete Fourier Transform

Question: For a sequence of length 1024,


DTFT
DFT
sampling frequency = 2kHz, what frequency
these values correspond to?
k = 0, 1, 2, 512, 1000

1
Fast Fourier Transform Some Time Domain and Frequency
Domain Concepts
FFT is an efficient and fast algorithm to calculate DFT, Narrower in time, wider in frequency
optimum for digital computer realization.
t F sin fT
rect
T f
Digital computing systems (Matlab, DSPs, etc.) employ
FFT algorithm to calculate DFT.

Amplitude
0

-T/2 0 T/2
-2 / T -1/ T 0 1/ T 2/ T
Time
Frequency (Hz)

Some Time Domain and Frequency Baseband and Bandpass signals


Domain Concepts The message signal generated by a source is called baseband
signal.
2

1.5
1
Baseband refers to the band of frequencies representing the
0.8
High frequency message signal.
1 0.6
contents in the
0.5
0.4
signal can be To comply with the channel, the baseband signal is sometimes
0.2

0 0
reduced by shifted to a band centred at a much higher frequency.
0 10 20 30 40 0 200 400 600 800 1000
Time (milliseconds) Frequency (Hz) avoiding sharp
transition pulses. The signal in high frequency band is called bandpass signal.
2

1.5
1
Baseband signal is shifted to passband through a process called
0.8
1 0.6 modulation.
0.4
0.5
0.2 The centre frequency of passband is called carrier frequency.
0 0
10 20 30 40 0 200 400 600 800 1000
Time (milliseconds) Frequency (Hz)

2
This document was created with Win2PDF available at http://www.daneprairie.com.
The unregistered version of Win2PDF is for evaluation or non-commercial use only.

You might also like