Understanding the discrete time Fourier transformation

In summary, When performing a Fourier transform on a time discrete signal, we have to apply the DTFT. The DTFT sums up all the samples multiplied by a complex exponential function, where the angular frequency is the rate of change of phase of each Fourier component. This can also be described in terms of ordinary frequency, but the angular frequency is used for convenience. The Fourier transform shows how much of each frequency is present in the input signal, and for a DFT, the frequencies with non-zero components are limited to harmonics. The sampling rate is relevant because it determines the highest frequency that can be accurately shown in the Fourier transform without aliasing.
  • #1
Luk
Let's consider a signal which is continuous in both time and amplitude. Now we consider the amplitude of this signal at specific time instants only. This is my understanding of sampling a signal in time domain.

When performing a Fourier transform on a time discrete signal, we have to apply the DTFT. The DTFT sums upp all the samples multiplied by a complex exponential function. In this complex exponential function we multiply an angular frequency with the index k. Well, I'm not sure what this is all suppossed to tell me. But I especially can't get my head around the angular frequency, which is somehow normalized on the sampling rate. What does this mean?
 
Engineering news on Phys.org
  • #2
Luk said:
Let's consider a signal which is continuous in both time and amplitude. Now we consider the amplitude of this signal at specific time instants only. This is my understanding of sampling a signal in time domain.

When performing a Fourier transform on a time discrete signal, we have to apply the DTFT. The DTFT sums upp all the samples multiplied by a complex exponential function. In this complex exponential function we multiply an angular frequency with the index k. Well, I'm not sure what this is all suppossed to tell me. But I especially can't get my head around the angular frequency, which is somehow normalized on the sampling rate. What does this mean?
Give these videos a try, they might have the answer you need.

https://greatscottgadgets.com/sdr

I watched them quite a while ago and found the concepts very well explained and easy to follow.
 
  • #3
Luk said:
But I especially can't get my head around the angular frequency
There is nothing magic about 'angular frequency'. You can describe a signal that's varying sinusoidally in time in terms of frequency f (the number of cycles per second) so
A = A0 sin(2πft) (or any other time dependent waveform)
OR in terms of the angular frequency, which is the number of radians of phase per second
A=A0 sin(ωt)
They are totally equivalent but a page full of 2π's is hard to read. So, to repeat, the angle that's referred to in 'angular frequency' is the rate of change (in radians) of phase of each of the Fourier components of the signal. Harmonics still have the same integer ratios for ω as for f.

If you can accept that any signal that's described in the temporal domain (i.e. scope trace) can also be described in the frequency domain. (Ordinary frequencies at this stage). If the waveform is repeated then the Fourier Transform consists of harmonics of the fundamental repeat frequency. If you only have time to analyse a finite length extracted out of the waveform then you have to assume that it repeats itself and you 'loop' the waveform. The only Fourier transform you can do on this signal is called a Discrete Fourier Transform and it introduces errors (artefacts) because of the truncation. You can improve on this by 'windowing' the waveform but that's another matter.
 
  • #4
Luk said:
I'm not sure what this is all suppossed to tell me
One way it's possible to look at the FT is that the transform shows how the input time function correlates (that +/-∞ integral) with any chosen frequency. i.e it shows how much of that part of the frequency spectrum is present in the input waveform. The output is a string of values, resulting from that correlation, carried out for all frequencies. For a DFT, the only frequencies with non- zero components can only be harmonics.
You also ask about the relevance to the sampling rate. The rate of the samples (fs for the calculation will be an integer multiple of the repeat, fundamental, frequency f0 (2nf in the case of an FFT) so the highest frequency that's recorded with no aliasing will be fs/2 (Nyquist criterion)
 

What is the discrete time Fourier transformation?

The discrete time Fourier transformation (DTFT) is a mathematical technique used to understand the frequency content of a discrete, time-limited signal. It represents the signal as a sum of complex sinusoids at different frequencies, each with a magnitude and phase.

How is the DTFT different from the Fourier transform?

The DTFT is a discrete version of the continuous Fourier transform, which is used for signals that are continuous in both time and frequency. The DTFT is used for signals that are discrete in time, such as digital signals. It is also periodic in frequency, while the Fourier transform is not.

What is the relationship between the DTFT and the discrete Fourier transform (DFT)?

The DFT is a discrete version of the DTFT and is calculated using a finite number of samples. The DFT is a practical implementation of the DTFT and is used to analyze digital signals on a computer. It is commonly used in signal processing and data analysis.

What are the applications of the DTFT?

The DTFT is used in various fields, including signal processing, telecommunications, and data analysis. It is particularly useful for analyzing digital signals, such as audio, images, and data streams. It is also used for designing filters, analyzing the frequency response of systems, and solving differential equations.

What are some limitations of the DTFT?

The DTFT is only defined for signals that are discrete and time-limited. It is also sensitive to noise and can be affected by sampling errors. Additionally, the DTFT does not provide any information about the signal outside of the analyzed time interval. It is also computationally intensive, making it less practical for real-time analysis of signals.

Similar threads

  • Electrical Engineering
Replies
4
Views
821
Replies
1
Views
1K
  • Electrical Engineering
Replies
4
Views
2K
  • Electrical Engineering
Replies
1
Views
1K
  • Electrical Engineering
Replies
31
Views
9K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
3K
  • Classical Physics
2
Replies
47
Views
2K
  • Electrical Engineering
Replies
3
Views
1K
Replies
5
Views
749
Replies
7
Views
3K
Back
Top