信号与系统课件chapter5.pptVIP

CHAPTER 5 THE DISCRETE-TIME FOURIER TRANSFORM5.0 INTRODUCTION Discrete-time Fourier transform and inverse Fourier transform. Similarities and differences between continuous-time and discrete-time Fourier transforms. 5.1 REPRESENTATION OF APERIODIC SIGNALS: THE DISCRETE-TIME FOURIER TRANSFORM As , … … –N –N1 0 N2 N n –N1 0 N2 x[n] n Defining a function: Thus, Consequently, As , discrete-time Fourier transform discrete-time inverse Fourier transform Differences between the continuous-time and discrete-time Fourier transform are: periodicity of the discrete-time transform and the finite interval of integration in the synthesis equation. In discrete time, Low frequencies are the values of ω near even multiple of π ; high frequencies are those values of ω near odd multiples of π. –2π–π 0 π 2π ω –2π –π 0 π 2π ω 0 n x1[n] 0 n x2[n] Example 5.1 Consider the signal 1/(1–α) 1/(1+α) –2π –π 0 π 2π ω –2π –π 0 π 2π ω 1 α 0 0 α -1 1/(1+α) 1/(1–α) –2π –π 0 π 2π ω –2π –π 0 π 2πω Example 5.2 Consider the signal 0 x[n] n (1+α)/(1–α) (1–α)/(1+α) –2π 0 2π ω for 0 α 1, Example 5.3 Consider the rectangular pulse –N10 N1 x[n] 1 n 5 –2π –π 0 π 2π ω Convergence Issues of the Discrete-Time Fourier Transform If x[n] is an infinite duration signal, we must consider the question of convergence of the infinite summation in the analysis equation. The analysis equation will converge if x[n] is absolutely summable; that is In contrast to the situation for the analysis equation, there are generally no convergence issues associated with the synthesis equation. Consider the unit sample x[n] = δ[n] Approximat