Session 2

Session Name: Discrete Fourier Transform and its Properties Author Name: C.Jeyalakshmi Department: Electronics and Communication Subject/Course: Digital Signal Processing

Session Objectives
At the end of this session, the learner will be able to: Differentiate between DTFT and DFT. List the advantages and applications of DFT. List the Important properties of DFT. List the Draw backs of DFT.

Teaching Learning Material

PowerPoint presentation Black Board and Chalk

Page 2 Ver 1:.01

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Session Plan
Time (in min) Content Learning Aid and Methodology Faculty Approach Typical Student Activity Skill and Competency Developed Remembering Intrapersonal Spatial intelligence Remembering Understanding Linguistic Intrapersonal Interpersonal Understanding Intrapersonal Interpersonal

15

Introduction to DFT and IDFT

Do and explain

Conducts

Participates

10

Applications of DFT

Demonstration Using matlab

Interaction

Participates

20

Properties of DFT

PPT

Explains

Listens

05

Conclusion

Question and Answer

Conducts

Participates

Remembering Understanding Interpersonal intrapersonal

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Page 3

Session Inputs
Discrete Fourier transform
Generally transform means change from the existing place to some other convenient place to work. Inverse transform means again coming to the original place or form. The learners already have knowledge about continuous Fourier transform. Let us introduce discrete by do and explain method and make them understand the difference between Discrete time Fourier transform and Discrete Fourier transform.

Suggested Activity: Do and Explain Take a bar chocolate, asks the learner to make as many pieces as he likes but at equal time interval say 1sec. Now explain bar chocolate is the continuous time signal and pieces taken are the infinite no. of samples for which Fourier transform is taken. This is the discrete time Fourier transform. Instead of this, if we take only finite no. of pieces i.e. samples like 4,8,16 then finding Fourier transform for that is called discrete Fourier transform. By doing so, analysis of the signal will be easier than DTFT.

X(t) Continuous signal

X(n) Discrete but uncountable

X(n) = 0 to N-1 Finite no. of samples

Page 4 Ver 1:.01

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Discrete Time Fourier Transform These signals are only defined at discrete points between positive and negative infinity, and do not repeat themselves in a periodic fashion. This type of Fourier transform is called the Discrete Time Fourier Transform. Discrete Fourier Transform These are discrete signals that repeat themselves in a periodic fashion from negative to positive infinity. This class of Fourier Transform is sometimes called the Discrete Fourier Series, but is most often called the Discrete Fourier Transform. Is there any waveform that has its own Fourier Transform? The answer is yes, and it is the Gaussian Sequence of N complex numbers x0xN1 is transformed into the sequence of N complex numbers X0, ..., XN1 by the DFT according to the formula:

The inverse discrete Fourier transform (IDFT) is given by

Applications of DFT
Now learners are familiar about DTFT and DFT and we make them to know importance of that and various applications of it such as in speech, image processing using matlab.

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Page 5

The shape of the time domain waveform is not important in the signals; the key information is in the frequency, phase and amplitude of the component sinusoids. The DFT is used to extract this information. Using that we can enhance, compress the signals. The Fourier transform can be used to perform correlation, which is closely related to convolution. Correlation can be used to locate features within an image; in this context correlation is often called template matching. Template is created for matching by extracting the letter "a" from the image

Properties of DFT
Having discussed about DFT it is better to learn their properties through power point presentation. Learners are asked to follow the steps used. Suggested Activity: Power point presentation To explain the linearity and periodicity property of DFT, equations are written in PPT and the relevant figures are shown which will make the learners clear about the concepts. The Fourier Transform is linear, that is, it possesses the properties of Homogeneity and additivity, while nonlinear is any system that does not obey at least one of these. If the amplitude is changed in one domain, it is changed by the same amount in the other domain. i.e. scaling in one domain corresponds to scaling in the other domain.

Page 6 Ver 1:.01

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Additivity of the Fourier transform means that addition in one domain corresponds to addition in the other domain. Scaling: (Homogeneity) To show that a system H obeys the scaling property is to show that H (K f(t) ) = K ( H (f(t) ) i.e if we multiply a constant with the input, then at the output we should also get the same amount of multiplication

Additivity:
A system H obeys the superposition property of linearity

H(f1(t) +f2(t)) =H(f1(t)) +H(f2(t))

i.e by combining the two signals and taking response is equal to individual response of the signals.

Periodicity:
Let us consider total no of samples from 0 to 127. Now Sample 127 occurs next to sample 0, just as sample 43 occurs next to sample 44. This is referred to as being circular, and is identical to viewing the signal as being periodic.

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Page 7

X (nk) = x(n) e.g 0,1, 2, 3, 4 ,5 ..127, 0,1,2,3,4 ..127, 0,1,2,3,4 . 127 etc

Advantages and Applications of DFT The Discrete Fourier Transform (DFT) is one of the most important tools in Digital Signal Processing. First, the DFT can calculate a signal's frequency spectrum. This is a direct examination of information encoded in the frequency, phase, and amplitude of the component sinusoids. For example, human speech and hearing use signals with this type of encoding. Second, the DFT can find a system's frequency response from the system's impulse response, and vice versa. This allows systems to be analyzed in the frequency domain, just as convolution allows systems to be analyzed in the time domain. Third, the DFT can be used as an intermediate step in more elaborate signal processing techniques. The classic example of this is FFT convolution, an algorithm for convolving signals that is hundreds of times faster than conventional methods.

Page 8 Ver 1:.01

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Conclusion
We can conclude the session by posing question to the students.

Suggested Activity: Question and answers 1. Which domain would you use for analyzing any signal? 2. State two properties of DFT? 3. I want to visualize the low frequency portion of my voice signal. What can we do for that? 4. If we want to calculate the DFT for more than 8 points, is it possible or we can go for some other method? 5. Differentiate convolution and correlation

By taking the fourier transform we can analyze the signal easily. But even for 8 point DFT no. of multiplications and additions are more. So it is better to use faster algorithm other than DFT which leads to fast Fourier algorithm. Correlation and convolution are same functions in DSP except in only one aspect that is the folding function is not done for correlation.

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Page 9

Summary
In this session, we learnt to: Define DTFT and DFT o These signals are only defined at discrete points between positive and negative infinity, and do not repeat themselves in a periodic fashion. This type of Fourier transform is called the Discrete Time Fourier Transform. o These are discrete signals that repeat themselves in a periodic fashion from negative to positive infinity. This class of Fourier Transform is sometimes called the Discrete Fourier Series, but is most often called the Discrete Fourier Transform. List Advantages and applications of DFT o The Discrete Fourier Transform (DFT) is one of the most important tools in Digital Signal Processing. o First, the DFT can calculate a signal's frequency spectrum. This is a direct examination of information encoded in the frequency, phase, and amplitude of the component sinusoids. For example, human speech and hearing use signals with this type of encoding. State some properties of DFT o Linearity (homogeneity and additivity), Periodicity, convolution and multiplication property, Time variant and invariant property

Page 10 Ver 1:.01

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Assignment
1. State the other properties of DFT which is not discussed here and derive it using appropriate equation. 2. Do four and eight point DFT using twiddle factor matrix and make them realize, calculating 8 point DFT is how much tedious using DFT

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College

Page 11

References
http://www.teacentre.ca/Rooibos_HazelnutChocolate.JPG http://polishlinux.org/reviews/gimp/chocolate/chocolate.png www.dspguide.com.

Page 12 Ver 1:.01

Discrete Fourier Transform and its Properties C.Jeyalakshmi, Trichy Engineering College