How is DTFT related to DFT?
The DTFT itself is a continuous function of frequency, but discrete samples of it can be readily calculated via the discrete Fourier transform (DFT) (see § Sampling the DTFT), which is by far the most common method of modern Fourier analysis. Both transforms are invertible.
Is DTFT same as DFT?
DFT (Discrete Fourier Transform) is a practical version of the DTFT, that is computed for a finite-length discrete signal. The DFT becomes equal to the DTFT as the length of the sample becomes infinite and the DTFT converges to the continuous Fourier transform in the limit of the sampling frequency going to infinity.
What is the difference between DTFS and DTFT?
The DTFS is used to represent periodic discrete-time signals in the frequency domain. It's continuous-time counterpart studied previously is the Fourier Series (FS). The DTFT is used to represent non-periodic discrete-time signals in the frequency domain.