1.11k likes | 1.12k Vues
This lecture discusses the application of discrete Fourier transforms in geoinformatics, highlighting the challenges in real-world data analysis and the impact of discrete data. It covers the relationship between functions and discrete values, Fourier series expansion, the Discrete Fourier Transform (DFT), the inverse DFT, aliasing, the Discrete Time Fourier Transform (DTFT), and the discrete convolution theorem.
E N D
SignalsandSpectral Methods in Geoinformatics Lecture 4: Discrete Fourier Transforms
Spectral methods for discrete data or from mathematical “convenience” to the difficulties of real applications
DATA FOR ALL VALUES DATA IN A FINITE INTERVAL Fourier transform Fourier series CONTINUOUS DATA The only realistic case for real applications DISCRETE DATA
Discrete data in a finite interval
Discrete data in a finite interval 0 1 2 3 4 5 Ν-1 Ν not taken into account ! If not, i.e. when (removal of linear trend)
Discrete data in a finite interval Relation between functionand discrete values Fourier series expansion in the interval [0, Τ]:
Discrete data in a finite interval Relation between functionand discrete values Fourier series expansion in the interval [0, Τ]: The known discrete values impose restrictions on the possible values of the Fourierseries coefficients, since they must satisfy the following N conditions
Discrete data in a finite interval Set: where:
The DiscreteFourier Transform (DFT) = sum of terms with frequencies The coefficientFm corresponds tocmaffected by the coefficientscm+jΝ of all corresponding higher frequencies aliasing
The DiscreteFourier Transform (DFT) System of Ν equations with Ν unknowns and unique solution:
The DiscreteFourier Transform (DFT) DFT = Discrete Fourier Transform invDFT = Inverse Discrete Fourier Transform
Proof of Forij : Fori = j :
The DiscreteFourier Transform (DFT) DFT numbers frequencies inv-DFT
Discrete data on an infinite interval
Discrete data on an infinite interval Unknown function Known discrete values 0 3 2 1 1 2 3
Discrete data on an infinite interval aliasing For frequenciesωΝ/2 < ω < ωΝ/2, smaller in absolute value than theNyquist value ωΝ the discrete spectrum FΔt(ω) differs from the corresponding continuous spectrumF(ω), due to the superimposition of the spectra of all “higher” frequencies F(ωkωΝ) outside the intervalωΝ/2 < ω < ωΝ/2(aliasing)
Discrete data on an infinite interval (relation with the continuous Fourier transform) InverseDiscrete-Time Fourier transform (invDTFT)
Discrete data on an infinite interval (relation with the continuous Fourier transform) InverseDiscrete-Time Fourier transform (invDTFT) Discrete Time Fourier Transform (DTFT)
Discrete data on an infinite interval Proof of theDTFT:
Discrete data on an infinite interval Proof that theDTFT satisfies theinvDTFT (already defined) Proof of theDTFT:
Discrete data on an infinite interval Usual simplification:
Discrete data on an infinite interval Usual simplification: Notation:
Discrete convolution definition: notation: property:
Discrete convolution Mathematical mapping: The valuegn of the discrete functiong for any particular n follows by multiplying eachvaluefk of the discrete functionf with a factor (weight) hn-k which depends on the “distance”n-k between the particularn and the varyingk(-∞<k<+∞). Thus each valuegn of the functiong is a “weighted mean”of the values fk with weightshn-k defined by the functionhn.
Discrete convolution sum of “columns”
Discrete convolution sum of “columns”