Textbook notes on Discree Fourier Transform离散傅立叶变换的课本注释.docVIP

Chapter 11.04 Discrete Fourier Transform Introduction Recalled the exponential form of Fourier series (see Equations 18 and 20 from Chapter 11.02), (18, Ch. 11.02) (20, Ch. 11.02) While the above integral can be used to compute , it is more preferable to have a discretized formula version to compute . Furthermore, the Discrete Fourier Transform (or DFT) [1–5] will also facilitate the development of much more efficient algorithms for Fast Fourier Transform (or FFT), to be discussed in Chapters 11.05 and 11.06. Derivations of DFT Formulas If time “” is discretized at Then Equation (18, of Chapter 11.02) becomes (1) To simplify the notation, define (2) Then, Equations (1) can be written as (3) In the above formula, “” is an integer counter. However, and do NOT have to be integer numbers. Multiplying both sides of Equation (3) by, and performing the summation on “”, one obtains ( note: l = integer number) (4) (5) (6) Switching the order of summations on the right-hand-side of Equation (6), one obtains (7) Define (8) There are 2 possibilities for () to be considered in Equation (8) Case(1): (-l ) is a multiple integer of , such as -l ) = mN; or = l + mN where Thus, Equation (8) becomes: (9) Hence: (10) Case(2): (-l ) is NOT a multiple integer of In this case, from Equation (8) one has (11) Define: (12) because (-l ) is “NOT” a multiple integer of (13) Then, Equation (11) can be expressed as (14) From mathematical handbooks, the right side of Equation (14) represents the “geometric series”, and can be expressed as if