Scribd
Upload
77 views32 pages

DFT Notes

DFT notes

Uploaded by

PRO Gamer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
77 views32 pages

DFT Notes

DFT notes

Uploaded by

PRO Gamer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 32

Digital Signal Processing

(ECE-326)

Course Topics
UNIT – III

Relation between DTFT, DFT, and Z-transform, circular convolution, DFT properties,
Orthogonal transform: Discrete Cosine Transform (DCT).
Discrete Fourier Transform (DFT)
Figure

▪ xp(n) is the reconstruction of the periodic signal from the spectrum X(ω) (IDFT).
• If x(n) has a finite duration then xp(n) is a periodic repetition of x(n) and xp(n) over a single period
is
Discrete Fourier Transform (DFT)

➢ Let x[n] be a finite-duration sequence of length N.


Relationship Between Frequency Bin k and Its Associated Frequency

• Amplitude, Phase, and Power Spectrum


Problems
Q. 1 (a) Find the DFT of the four-point sequence. x(n) = {1, 2, 3, 4} Solution: (b)
(b) Evaluate its inverse DFT to determine the time domain sequence x(n).
Solution:
(a)
Problems

Q. 1
Q. 2
Problems

Solution: Calculated DFT coefficients

Amplitude spectrum Phase spectrum


Power density spectrum
DFT as a linear transformation

Twiddle factor
Problems
Q. Find the DFT of the four-point sequence.
x(n) = {1, 2, 3, 4} using matrix method

1
2
= 3
4

10
−2 + 2𝑗
=
−2
−2 − 2𝑗
Problems

1. Find the 4 Point DFT of x(n) = cos(nπ/4 )


Practice set
Problems on the DFT

1. Compute the DFT of the following sequences.

a) x = [ 1, 0, -1, 0]
b) x = [ 1, 1, 1, 1, 1, 1, 1, 1]
c) x(n) = cos (𝜋𝑛/4), n= 0, 1, 2------7.

2. Determine the DFT of the sequence for N=8,


1
, −2 ≤ 𝑛 ≤ 2
h(n) = 2
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
▪ Also plot the magnitude and phase response for N=8

3. Compute the DFT of the following finite-length sequence of length N as x(n) = u(n) − u(n − N)

4.
Properties of the DFT
Properties of the DFT

Periodicity

➢ The DFT spectrum is periodic with


period N (which is expected since the
DTFT spectrum is periodic as well,
but with period 2π)

Linearity
Circular Shifted Sequence

Fig. Circular Shifted Sequence


Circular Shifted Sequence

Practice set
Time reversal

➢ The time reversal of an N-point sequence


x(n) is obtained by wrapping the sequence
x(n) around the circle in the clockwise
direction.
Circular Convolution
Problems

Example of Circular Convolution


Problems

Using DFT and IDFT


Circular Convolution as Linear Convolution

Linear convolution
Practice set

Q. 1 Find the linear convolution of the sequences x(n) and h(n) using DFT.
x(n) = {1, 0, 2}, and h(n) = {1, 1}

Q.2 Determine the circular convolution of two rectangular pulse


Discrete Cosine Transform (DCT)
Discrete Cosine Transform

➢ The basis functions of DCT are real. (DFT has complex basis functions.)

➢ the first thing to note is that there are various versions of the DCT
– these are usually known as DCT-I to DCT-IV

➢ DCT has very good energy compaction properties.

➢ energy compaction: the ability to pack the energy of the spatial sequence into as few
frequency coefficients as possible.

➢ If compaction is high, we only have to transmit a few coefficients– instead of the whole
set of pixels
➢ — effective for data compression.

➢ The most popular is the DCT-II, also known as even symmetric DCT, or as “the DCT”
DFT Problems

x[n]

y[n] y[n]

y[n]

➢ note that in the DFT case, the extension introduces discontinuities.


➢ this does not happen for the DCT due to the symmetry of y[n]
➢ – the elimination of this artificial discontinuity, which contains a lot of high
frequencies,
➢ – is the reason why the DCT is much more efficient
DCT

➢ To form the Discrete Cosine Transform (DCT), replicate x[0 : N − 1] but in


reverse order

y[n]

y[n]

y[n]

➢ DCT is the way of calculating the DFT of y[n] symmetrically extended


Discrete Cosine Transform
Practice set
❖ Derive inverse discrete cosine transform (DCT) equation.
References

1. G. Proakis and D. G. Manolakis, Digital Signal Processing: Principles Algorithms and


Applications, Prentice Hall, 4th Ed.

2. A. V. Oppenheim, R. W. Schafer and J. R. Buck, Discrete-Time Signal Processing,


Pearson Prentice Hall, 2nd Ed.

3. S. K. Mitra, Digital Signal Processing, Tata McGraw Hill, 3rd Ed.

4. Li Tan, Digital Signal Processing, Fundamentals and Applications, Academic Press,


Elsevier, 2008.

31
Thank you for your attention

You might also like