D tutorialspoint Page of Fourier Transforms The main drawback of Fourier series is, it is only applicable to periodic signals. There are some naturally produced signals such as nonperiodic or aperiodic, which we cannot represent using Fourier series. To overcome this shortcoming, Fourier developed a mathematical model to transform signals between time (or spatial) domain to frequency domain & vice versa, which is called ‘Fourier transform’. Fourier transform has many applications in physics and engineering such as analysis of LTI systems, RADAR, astronomy, signal processing etc. Deriving Fourier transform from Fourier series Consider a periodic signal f(t) with period T. The complex Fourier series representation of f(t) is given as f) = YS ape™* but you know that 1 ptotT = a= 7h Fe shot dt Substitute in equation 2. => f(t) =DE_ HIP F(the edt enka co Ty Ita Lett = r a —j2mkd. mkA. = De wolf P(e PA ftdt] eP7hASt Af In the limit as T' > 00, Af approaches differential df, kA f becomes a continuous variable f, and summation becomes integration hitps:wwutrialspointcomvsignals_and_systemsifourer_transtorms.htm ueD tutorialspoint f(t) = limp sco {re olf. F(t)e PON det] conan ay} = [if see Ptaterenag 1) = [~ PlwjeMaw Where Flu] = [f%, f(t)e ?"!*dt] Fourier transform of a signal =U f feet f(t) = Flu Inverse Fourier Transform is f(t) = [ ” Fluledw Fourier Transform of Basic Functions Let us go through Fourier Transform of basic functions: FT of GATE Function X(t) Aa >t Te 1/2 Plul = arse“) hitps:wwutrialspointcomvsignals_and_systemsifourer_transtorms.htm aeD tutorialspoint Page Sot FT of Impulse Function FT \w(t)] = [f° 6(Qe** de] = et lpe FT of Unit Step Function: = 18 (w) + 1/50 Ul FT of Exponentials etu(t) 3s 1/(a + jw) e-tu(t) @ 1/(a + jw) FT ealt rr et ET, 5(4) — wp) FT of Signum Function er sgn(t) <> 2 Explore our latest online courses and learn new skills at your own pace. Enroll and become a certified expert to boost your career, Conditions for Existence of Fourier Transform Any function f(t) can be represented by using Fourier transform only when the function satisfies Dirichlet’s conditions. i.e. = The function f(t) has finite number of maxima and minima. = There must be finite number of discontinuities in the signal f(t),in the given interval of time. = It must be absolutely integrable in the given interval of time i.e. hitps:wwutrialspointcomvsignals_and_systemsifourer_transtorms.htm aieD tutorialspoint Paget LP \F)| dt < 00 Discrete Time Fourier Transforms (DTFT) The discrete-time Fourier transform (DTFT) or the Fourier transform of a discrete-time sequence x[n] is a representation of the sequence in terms of the complex exponential sequence e/*" The DTFT sequence x{[n] is given by X(w) = BE _.2(ne™ ...... (1) Here, X(w) is a complex function of real frequency variable w and it can be written as X(w) = Xre(w) + JXimg(w) Where Xre(0), Ximg(w) are real and imaginary parts of X(w) respectively. | X(w)| cos 6(w) = | X(w)|sind(w) And X(w) can also be represented as X(w) = | X(w) |e) Where O(w) = argX(. X(w)|,0(w) are called magnitude and phase spectrums of X(w) Inverse Discrete-Time Fourier Transform Convergence Condition: The infinite series in equation 1 may be converges or may not. x(n) is absolutely summable. when > |2(n)| <0 An absolutely summable sequence has always a finite energy but a finite-energy sequence is not necessarily to be absolutely summable, hitps:wwutrialspointconvsignals_and_systemsifourer_transtorms.htm 418