The document discusses the Discrete Time Fourier Transform (DTFT) which is used to analyze non-periodic discrete time signals. It includes definitions of DTFT and its inverse, as well as properties such as periodicity and convolution. For more detailed information, a link to further resources is provided.

1. DETERMINATION OF
DTFT

2. What is DTFT
The discrete time signals are analyzed with the help of
discrete time Fourier series (DTFS) called discrete time Fourier
transform (DTFT)
The DTFT is used for the analysis of non periodic signals. Let
us consider the discrete time signal x (n), its DTFT is denoted as
X(Ω) given as,
DTFT: X (Ω) = e –jΩn
 The inverse DTFT is given as,
Inverse DTFT: x (n) = 1/ 2π e –jΩn dΩ

3. Dtft of Cosine

4. Properties of DTFT

6. periodicity
shifting

7. Convolution
symmetry

8. Parseval’s theorem

9. DTFT vs. DFT and CTFT

10. Hey Friend,
This was just a summary on Determination of DTFT. For more
detailed information on this topic, please type the link given below or
copy it from the description of this PPT and open it in a new browser
window.
www.transtutors.com/homework-help/digital-signal-processing/frequency-
analysis-dtft/determine-dtft-example.aspx