Professional Documents
Culture Documents
LAB
# 06
DISCRETE FOURIER TRANSFORMATION (DFT).
OBJECTIVE:
EXAMPLE:
Example # 01:
Coding:
Result:
HOME TASK:
Coding:
Result:
Task #3: Plot the magnitude and phase graphs of DFT function of Task #2
in separatewindow.
Coding:
Result:
Task #4: Plot ansequence. Where a=0.8 and define at n=0 to 35. Find its DFT,
plot itsmagnitude and phase graphs also.
Coding:
Result:
Task #5: Take IDFT of the results of Task #2 and verify that it gives you
the samesequence as mention in Task #1.
Coding:
Result:
Task #6: Design a DFT algorithm on MATLAB. The DFT is defined by the formula
Coding:
Result:
1.
Coding:
Result:
2.
Coding:
Result:
3.
Coding:
Result:
Conclusion
The DFT is one of the most powerful tools in digital signal processing which enables us to find
the spectrum of a finite-duration signal. There are many circumstances in which we need to
determine the frequency content of a time-domain signal. For example, we may have to analyze
the spectrum of the output of an LC oscillator to see how much noise is present in the produced
sine wave. This can be achieved by the discrete Fourier transform (DFT). The DFT is usually
considered as one of the two most powerful tools in digital signal processing (the other one being
digital filtering), and though we arrived at this topic introducing the problem of spectrum
estimation, the DFT has several other applications in DSP.