Difference between revisions of "Signal Representation/Discrete-Time Signal Representation"
m (Text replacement - "Low Pass" to "Low-Pass") |
|||
Line 2: | Line 2: | ||
{{Header | {{Header | ||
|Untermenü=Time and Frequency-Discrete Signal Representation | |Untermenü=Time and Frequency-Discrete Signal Representation | ||
− | |Vorherige Seite=Equivalent Low Pass Signal and Its Spectral Function | + | |Vorherige Seite=Equivalent Low-Pass Signal and Its Spectral Function |
|Nächste Seite=Discrete Fourier Transform (DFT) | |Nächste Seite=Discrete Fourier Transform (DFT) | ||
}} | }} |
Revision as of 09:33, 4 May 2021
Contents
# OVERVIEW OF THE FIFTH MAIN CHAPTER #
A prerequisite for the system-theoretical investigation of digital systems or for their computer simulation is a suitable discrete-time signal description. This chapter clarifies the mathematical transition from time-continuous to time-discrete signals, starting from Fourier Transform and Its Inverse .
The chapter includes in detail:
- the time and frequency domain representation of discrete-time signals,
- the sampling theorem, which must be strictly observed in time discretization,
- the reconstruction of the analog signal from the time-discrete representation,
- the Discrete Fourier Transform (DFT) and its inverse (IDFT),
- the possibilities of error when applying DFT and IDFT,
- the application of spectral analysis to the improvement of metrological procedures, and.
- the FFT algorithm particularly suitable for computer implementation.
For more information on the subject, as well as tasks, simulations, and programming exercises, see
- Chapter 7: Discrete Fourier Transform, program dft,
- Chapter 8: Spectral Analysis, program stp, and
- Chapter 12: Pulse code modulation, program pcm
of the laboratory course „Simulation Methods in Communications Engineering”. This (former) LNT course at the TU Munich is based on
- the teaching software package LNTsim ⇒ link refers to the ZIP version of the program,
- the Lab Instruction - Part A ⇒ link refers to the PDF version; Chapter 7: page 119-144, Chapter 8: page 145-164, and
- the Lab Instruction - Part B ⇒ link refers to the PDF version; Chapter 12: page 271-294.
Principle and Motivation
Many message signals are analog and thus simultaneously time-continuous and continuous in value. If such an analog signal is to be transmitted by means of a digital system, the following preprocessing steps are required:
- the sampling of the message signal x(t), which is expediently - but not necessarily - performed at equidistant times ⇒ time discretization,
- the quantization of the samples, so as to limit the number M of possible values to a finite value ⇒ value discretization.
Quantization is not discussed in detail until the chapter Pulse Code Modulation of the book "Modulation Methods".
In the following, we use the following nomenclature to describe the sampling:
- let the continuous-time signal be x(t).
- Let the time-discretized signal sampled at equidistant intervals TA be xA(t).
- outside the sampling time points ν⋅TA always holds xA(t)=0.
- The iterating variable ν be an integer: ν∈Z={...,–3,–2,–1,0,+1,+2,+3,...}.
- In contrast, at the equidistant sampling times with the constant K, the result is:
- xA(ν⋅TA)=K⋅x(ν⋅TA).
The constant depends on the type of time discretization. For the above sketch K=1 holds.
Time Domain Representation
Definition: Throughout LNTwww, the sampling shall be understood as the multiplication of the time-continuous signal x(t) by the Dirac pulse pδ(t):
- xA(t)=x(t)⋅pδ(t).
AIt should be noted that other forms of description are found in the literature. However, to the authors, the form chosen here appears to be the most appropriate in terms of spectral representation and derivation of the Discrete Fourier Transform (DFT).
Definition: The Dirac comb (in the time domain) consists of infinitely many Dirac pulses, each equally spaced TA and all with equal pulse weight TA:
- pδ(t)=+∞∑ν=−∞TA⋅δ(t−ν⋅TA).
Based on this definition, the sampled signal has the following properties:
- The sampled signal at the considered time (ν⋅TA) is equal TA⋅x(ν⋅TA)−δ(0).
- Since the Dirac function δ(t) is infinite at time t=0 actually all signal values xA(ν⋅TA) are also infinite.
- Thus, the factor K introduced on the last page is actually infinite as well.
- Two samples xA(ν1⋅TA) and xA(ν2⋅TA) however, differ in the same proportion as the signal values x(ν1⋅TA) and x(ν2⋅TA).
- The samples of x(t) appear in the momentum weights of the Dirac functions:
- xA(t)=+∞∑ν=−∞TA⋅x(ν⋅TA)⋅δ(t−ν⋅TA).
- The additional multiplication by TA is necessary so that x(t) and xA(t) have the same unit. Note here that δ(t) itself has the unit "1/s".
The following pages will show that these equations, which take some getting used to, do lead to reasonable results, if they are applied consistently.
Dirac Comb in Time and Frequency Domain
Theorem: Developing the Dirac comb into a Fourier Series and transforming it into the frequency domain using the Shift Theorem gives the following correspondence:
- pδ(t)=+∞∑ν=−∞TA⋅δ(t−ν⋅TA)∘−−−∙Pδ(f)=+∞∑μ=−∞δ(f−μ⋅fA).
Here fA=1/TA gives the distance between two adjacent dirac lines in the frequency domain.
Proof: The derivation of the spectral function given here Pδ(f) is done in several steps:
(1) Since pδ(t) is periodic with the constant distance TA between two dirac lines, the [[[Signal_Representation/Fourier_Series#Komplexe_Fourierreihe|complex Fourier Series]] can be applied:
- pδ(t)=+∞∑μ=−∞Dμ⋅ej⋅2π⋅μ⋅t/TAmitDμ=1TA⋅∫+TA/2−TA/2pδ(t)⋅e−j⋅2π⋅μ⋅t/TAdt.
(2) In the range from −TA/2 to +TA/2 holds for the Dirac comb in the time domain: pδ(t)=TA⋅δ(t). Thus one can write for the complex Fourier coefficients:
- Dμ=∫+TA/2−TA/2δ(t)⋅e−j⋅2π⋅μ⋅t/TAdt.
(3) Considering that for t≠0 the Dirac momentum is zero and for t=0 the complex angular factor is equal to 1, it holds further:
- Dμ=∫+TA/2−TA/2δ(t)dt=1⇒pδ(t)=+∞∑μ=−∞ej⋅2π⋅μ⋅t/TA.
(4) The shifting theorem in the frequency domain is fA=1/TA:
- ej⋅2π⋅μ⋅fA⋅t∘−−−∙δ(f−μ⋅fA).
(5) If you apply the result to each individual summand, you finally get:
- Pδ(f)=+∞∑μ=−∞δ(f−μ⋅fA).
The result states:
- The Dirac comb pδ(t) in the time domain consists of infinitely many Dirac impulses, each at the same distance TA and all with the same pulse weight TA.
- The Fourier transform of pδ(t) again gives a Dirac comb, but now in the frequency range ⇒ Pδ(f).
- Pδ(f) also consists of infinitely many Dirac pulses, but now in the respective distance fA=1/TA and all with momentum weight 1.
- The distances of the diraclines in the time and frequency domain representation thus follow the reciprocity theorem:
- TA⋅fA=1.
Example 1: The graph illustrates the above statements for
- TA=50µs,
- fA=1/TA=20kHz .
One can also see from this sketch the different momentum weights of pδ(t) and Pδ(f).
Frequency Domain Representation
The spectrum of the sampled signal xA(t) is obtained by applying the convolution theorem in the frequency domain.This states that multiplication in the time domain corresponds to convolution in the spectral domain:
- xA(t)=x(t)⋅pδ(t)∘−−−∙XA(f)=X(f)⋆Pδ(f).
From the spectrum X(f) by convolution with the diracline shifted by μ⋅fA we get:
- X(f)⋆δ(f−μ⋅fA)=X(f−μ⋅fA).
Applying this result to all diraclines of the Dirac pulse, we finally obtain:
- XA(f)=X(f)⋆+∞∑μ=−∞δ(f−μ⋅fA)=+∞∑μ=−∞X(f−μ⋅fA).
The sampling of the analogue time signal x(t) at equidistant intervals TA leads in the spectral domain to a periodic continuation of X(f) with frequency spacing of fA=1/TA.
Example 2: The upper graph shows (schematically!) the spectrum X(f) of an analogue signal x(t), which includes frequencies up to 5 kHz .
Sampling the signal at the sampling rate fA = 20 kHz, i.e. at the respective distance TA=50µs we obtain the periodic spectrum XA(f) sketched below.
- Since the Dirac functions are infinitely narrow, the sampled signal xA(t) also contains arbitrary high-frequency components.
- Accordingly, the spectral function XA(f) of the sampled signal is extended to infinity.
Signal Reconstruction
Signal sampling is not an end in itself in a digital transmission system; it must be reversed at some point. Consider, for example, the following system:
- The analogue signal x(t) with bandwidth BNF is sampled as described above.
- At the output of an ideal transmission system, the likewise time-discrete signal yA(t)=xA(t) is present.
- The question now is how the block signal reconstruction is to be designed so that also y(t)=x(t) applies.
The solution is relatively simple if one considers the spectral functions: One obtains from YA(f) the spectrum Y(f)=X(f) by a low-pass with the Frequency Response H(f), which
- passes the low frequencies unaltered:
- H(f)=1f¨ur|f|≤BNF,
- suppresses the high frequencies completely:
- H(f)=0f¨ur|f|≥fA−BNF.
Further it can be seen from the graph that the frequency response H(f) in the range of BNF to fA−BNF can be arbitrarily shaped,
- for example, linearly sloping (dashed line)
- or also rectangular,
as long as both of the above conditions are met.
The Sampling Theorem
The complete reconstruction of the analogue signal y(t) from the sampled signal yA(t)=xA(t) is only possible if the sampling rate fA corresponding to the bandwidth BNF of the message signal has been chosen correctly.
From the graph of the last page , it can be seen that the following condition must be fulfilled:
- fA−BNF>BNF⇒fA>2⋅BNF.
Sampling Theorem: If an analogue signal x(t) has spectral components in the range |f|<BNF, it can only be completely reconstructed from its sampled signal if the sampling rate is sufficiently large:
- fA≥2⋅BNF.
Accordingly, the following must apply to the distance between two samples:
- TA≤12⋅BNF.
If the largest possible value ⇒ TA=1/(2BNF) is used for sampling,
- then, in order to reconstruct the analogue signal from its sampled values,
- one must use an ideal, rectangular low-pass filter with cut-off frequency fG=fA/2=1/(2TA) .
Example 3: The graph above shows the spectrum ± 5 kHz of an analogue signal limited to X(f) below the spectrum XA(f) of the signal sampled at distance TA= 100 µs ⇒ fA= 10 kHz.
Additionally drawn is the frequency response H(f) of the low-pass filter for signal reconstruction, whose cut-off frequency must be fG=fA/2=5 kHz .
- With any other fG value, the result would be Y(f)≠X(f).
- For fG<5 kHz the upper X(f) portions are missing.
- At fG>5 kHz there are unwanted spectral components in Y(f) due to convolution operations.
If the sampling at the transmitter had been done with a sampling rate fA<10 kHz ⇒ TA>100µs, the analogue signal y(t)=x(t) would not be reconstructible from the samples yA(t) in any case.
Note: There is an interactive applet on the topic covered here: Sampling of Analogue Signals and Signal Reconstruction
Exercises For the Chapter
Exercise 5.1: Sampling Theorem
Exercise 5.1Z: Sampling of Harmonic Oscillations