DISCRETE FOURIER TRANSFORM
|
|
- Ann Perkins
- 6 years ago
- Views:
Transcription
1 DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains a finite number of samples equal to the number of samples N in the given signal. Computationally efficient algorithms for implementing the DFT go by the generic name of fast Fourier transforms (FFTs). This chapter describes the DFT and its properties, and its relationship to DTFT. 2. Definition of DFT and its Inverse Lest us consider a discrete time signal x (n) having a finite duration, say in the range 0 n. The DTFT of the signal is Σ X ( ω) = n-0 x (n)e-jwn (1) Let us sample X using a total of N equally spaced samples in the range : ω (0,2π), so the sampling interval is 2π That is, we sample X(ω) using the frequencies. N ω= ωk = 2πk, 0 k. -jwn (2) Thus X (k) = Σ x (n)e n-0 The result is, by definition the DFT. That is, X (k) = Σ n-0 x (n)ej2πkn (2) Equation (0.2) is known as N-point DFT analysis equation. Fig 0.1 shows the Fourier transform of a discrete time signal and its DFT samples. N
2 x(w) 0 π 2π w Fig.1 Sampling of X(w) to get x(k) While working with DFT, it is customary to introduce a complex quantity W N = e-j2π /N Also, it is very common to represent the DFT operation N=1 X(k) = DFT ( x(n)) = Σ x(n) W N kn, 0 n The complex quantity Wn is periodic with a period equal to N. That is, W N a+n = e -j+2π/n(a+n) = e -j2π /N n = W N a where a is any integer. Figs. 0.2(a) and (b) shows the sequence for 0 n in the z-plane for N being even and odd respectively (a) (b) Fig.2 The Sequence for even N (b) The sequence for odd N. The sequence W k N N for 0 n lies on a circle of unit radius in the complex plane and the phases are equally spaced, beginning at zero. The formula given in the lemma to follow is a useful tool in deriving and analyzing various DFT oriented results.
3 2.1. Lemma Σ Wkn = N δ (k) = { N, k = 0 (3) n-0 N 0, k 0 Proof : Σ an = 1 - a N : a 1 n a We know that Applying the above result to the left side of equation (3.3), we get Σ (W k N ) n = 1- W k N N = 1- e-j2π k N N n= 0 1- W k N N 1- e-j2π k N N : k 0 = e- j2π k N N = 0, k 0 when k = 0, the left side of equation (3.3) becomes Σ W 0xn N = Σ 1 = N n= 0 n =0 Hence, we may write 2.2 Inverse DFT N, k = 0 Σ W 0xn N = 0, k 0 = N δ (k), 0 k The DFT values (X(k), 0 k ), uniquely define the sequence x(n) through the inverse DFT formula (IDFT) : x (n) = IDFT (X(k) = 1 Σ X(k) W N -kn, 0 k The above equation is known as the synthesis equation.
4 Proof : 1 Σ X(k) W N -kn = 1 Σ [Σ x(m) W N km ] = WN -kn m=0 = 1 Σ x(m) [Σ W N -(n-m)k ] m=0 It can be shown that Σ W (n-m)k N = N, n = m 0, n m Hence, 1 Σ x(m) Nδ (n-m) N = 1 x Nx (m) ( sifting property) N m=n = x(n) 2.3 Periodicity of X (k) and x (n) The N-point DFT and N-point IDFT are implicit period N. Even though x (n) and X (k) are sequences of length N each, they can be shown to be periodic with a period N because the exponentials W N ±kn in the defining equations of DFT and IDFT are periodic with a period N. For this reason, x (n) and X (k) are called implicit periodic sequences. We reiterate the fact that for finite length sequences in DFT and IDFT analysis periodicity means implicit periodicity. This can be proved as follows : X (k) = Σ x(n) W N kn N-p=0 X (k+n) = Σ x(n) W N (k+n)n Since, W Nn N = e -j2πnnn = 1, we get X (k+n) = Σ x(n) W -kn N = X (k)
5 Similarly, x (n) Σ X (k) W N -kn k=0 x (n+n) = 1 Σ X(k) W N -k(n+n) = 1 Σ X(k) W N -kn W N -kn Since, W N -kn = e -j2π/n kn = e -j2πk = 1, we get x(n+n) = 1 Σ X(k) W -kn N = x (n) Since, DFT and its inverse are both periodic with period N, it is sufficient to compute the results for one period (0 to ). We want to emphasize that both x (n) and X (k) have a starting index of zero. A very important implication of x (n), being periodic is, if we wish to find DFT of a periodic signal, we extract one period of the periodic signal and then compute its DFT. Example 1 Compute the 8 point DFt of the sequence x (n) given below : x (n) = (1,1,1,1,0,0,0,0) Solution The complex basis functions, W for 0 n 7 lie on a circle of unit radius as shown in Fig. Ex.3 W8 6 W8 5 W8 7 W Re(z) W83 W81 W8 2 Fig. 3 Sequence W 8 0 for 0 n 8.
6 Since N = 8 we get W = e j2π/8 Thus, W 8 0 = 1 W 1 8 = e -jπ/4 = 1 j 1 W 2 8 = e -jπ/2 = j W 3 8 = e -j3π/4 = 1 j 1 W 4 8 = -W 0 8 = -1 By definition, the DFT of x (n) is X ( k) = DFTI (x (n)) = W kn 8 = 1+1 x W8 k + W 8-2k + W 8 3k. = 1 + W8 k + W 8 2k + W 8 3k k = 0, 1 7 X(0) = = 4 X(1) = 1+ W8 1 + W W 3 = 1 j X(2) = 1+ W8 2 + W 8 4+ W 8 6 = 0 X(3) = 1+ W8 3 + W 8 6+ W 8 1 = 1 j0.414 X(4) = 1 + W8 4 + W 8 0+ W8 4 = 0 X(5) = 1+ W8 5 + W W 8 7 = 1+j0.414 X(6) = 1+ W8 6 + W W 8 2 = 0. X(7) = 1+ W8 7 + W8 6 + W 8 5 = 1+j2.414 Please note the periodic property : W N a = WN a+n where a is any integer. Example 2 : Compute the DFT of the sequence defined by x (n) = (-1) n for a. = N= 3 b. N = 4, c. N odd, d. N even. Solution X (k) = DFT (x-n) = Σ (-1) n W N nk n-0
7 Σ (-1) n [W k] N n = 1 (1) N for W k -1 N 1+ W k N a. N = 3 X(k) = 2 = 2 0 k 2 1+ W k N 1+ cos (2kπ/3) j sin ((2πk/3) b. N = 4 X (k) = 0 for W 4 k -1 or k 2 With k = 2 we get X(2) Σ (-1) n W 4 2n = 1 - W W W 4 6 = 1 (-1) + (-1) 2 (-1) 2 = 4 Hence, c. We know that X (k) = 48(k-2) W 4 2n e -j2π / N k If N = 2k, we get W N k = -1. Since N is odd no k exists. This means to say that W k N -1 for all k from 0 to. Therefore, X(k) = 2 0 k 1+ W k N d. N even W N k = - 1, if k = N/2. X ( k) = 0 for k N/2 With k = 2, we get And x (N/2) = Σ [- W N k] n =Σ [1] = N Hence X (k) = N δ (k-n/2)
8 Example 3. Compute the inverse DFT of the sequence, X(k) = (2,1+j,0,1 j) Solution x (n) = IDFT (X(k)) 1 Σ x(n) W N -kn, 0 n N -1 N Please note that : W N -kn = [ WN kn]* Since, N = 4, we get x (n) = 1 Σ X(k) W 4 -kn, 0 n 3 4 = 1 [X(0) W 4-0xn + X(1) W 4 -n + X (2) W 4-2n + X (3) W 4-3n ] 4 = 1 [2 + (1+j) W 4 -n +0 + (1-j) + X (3) W 4-3n] 4 Hence, x (0) = 1 [2 + (1+j) +(1-j)] = 1 4 x (1) = 1 [2 + (1+j) W (1-j) W 4-3] = 1 4 x (2) = 1 [2 + (1+j) W (1-j) W -6 4 ] = 1 4 Because of periodicity, W -6 4 = W -2 4 Hence, x (2) = 1 [2 + (1+j) (-1) + (1-j) (-1)] = 0 4 x (3) = 1 [2 + (1+j) W 4-3 +(1-j) W 4-9] = 1 4 Because of periodicity, W 4-9 = W 4-5 = W 4-1
9 Hence, x (3) = 1 [2 + (1+j) W (1-j) W 4-1] 4 = 1 [2 + (1+j) (-j) (-j) + (1-j) ] = 1 4 Hence, x(n) = (1,0,0,1) 3. Matrix Relation for Computing DFT The defining relation for DFT of a finite length sequence x (n) is X (k) = Σ x(n) W n kn, 0.1, Let us evaluate X (k) for different values of k in the range (0, ) as given below : X (0) = W N 0 x (0) + W N 0 x (1) + + W N 0 x () X (1) = W N 0 x (0) + W N 1 x (1) + + W N () x () X (2) = W N 0 x (0) + W N 2 x (1) + + W N 2() x () X () = W N 0 x (0) + W N () x (1) +.. =+ W N () () x () Putting the N DFT equations in N unknowns in the matrix form, we get X = W N x Here X and x are (N x 1) matrices, and Wn is an (N x N) square matrix called the DFT matrix. The full matrix form is described by X(0) W N 0 W N 0 W N 0 W N 0 x(0) X(1) W N 0 W N 1 W N 2 W N () x(1) X(2) = W 0 N W 2 N W 4 N W kn x(2) N : : : : : : X() W 0 N W N W 2() N W ()() N x() The elements W N kn of W N are called complex basis functions or twiddle factors. Example : Compute the 4-point DFT of the sequence, x(n) = (1,2,1,0). Solution With N = 4, W 4 = e We know that -j2 π /4 = -j.
10 X = W N x X(0) W 0 4 W 0 4 W 0 4 W 0 4 x(0) X(1) W 0 4 W 1 4 W 2 4 W 3 4 x(1) X(2) = W 0 4 W 2 4 W 4 4 W 6 4 x(2) X(3) W 0 4 W 3 4 W 6 4 W 0 4 x(3) Exploiting the periodic property W N 0 = W N n+n where a is any integer the above matrix relation becomes. X(0) W 4 0 W 4 0 W 4 0 W 4 0 x(0) X(1) W 4 0 W 4 1 W4 2 W 4 3 x(1) X(2) = W 4 0 W 4 2 W 4 0 W 4 2 x(2) X(3) W 4 0 W 4 3 W 4 2 W 4 1 x(3) X(0) X(1) 1 -j -1 j 2 X(2) = X(3) 1 j -1 -j 0 Hence, X(k) = (4, -j2, 0, j2) 4. Matrix Relation for Computing IDFT We know that x = W 1 N X Premultiplying both the sides of the above equation by we get W N -1 -X = W N -1 W N x Or W N -1 X = x x = W N -1 X In the above equation (.8) x = W N -1 is called IDFT matrix. The defining equation for finding IDFT of a sequence X (k) is
11 X (n) = 1 Σ X(k) W, 0 n = 1 X Σ (k) [W N kn ]* The first set of N IDFT equation in N unknowns may be expressed in the matrix form as x = 1 W* N X N Where W* N denotes the complex conjugate of W N. Comparision of equation (3.8) and (3.9) leads us to conclude that W N -1 = 1/N W* N This very important result shows that W -1 N requires only conjugation of Wn multiplied by 1/N. an obvious computational advantage. The matrix relations (.7) and (.9) together define DFT as a linear transformation. 5. Using the DFT to Find the IDFT We know that x* (n) = 1 Σ X(k) W N -kn, n= 0,1. Taking complex conjugates on both the sides of the above equation, we get x*(n) = 1 Σ X(k) W -kn N *
12 x*(n) = 1 Σ X*(k) W N -kn * (10) N k =0 The right hand side of equation (3.10) is recognized as the DFT of X* (k), so we can rewrite equation (3.10) as follows : x*(n) = 1 DFT (X*(k)) N Taking complex conjugates on both the sides of equation (11), we get x*(n) = 1 [DFT (X*(k))] N The above results suggests the DFT algorithm itself can be used to find IDFT. In practice, this is indeed what is done. 6. Properties of DFT In the following section, we shall discuss some of the important properties of the DFt. They are strikingly similar to other frequency domain transforms, but must always be used in keeping with implied periodicity for both DFT and IDFT in time and frequency domains. 6.1 Linearity DFT (ax 1 (n) + bx 2 (n)j = ax 1 (k) + bx 2 (k), k = 0, N =1 If X 1 (k) and X 2 (k) are the DFTs of the sequence x 1 (n) and x 2 (n), respectively, both of lengths N. Proof : We know that DFT [x(n)] = Σ x(n) W N kn Letting x (n) = ax 1 (n) + bx 2 (n) we get DFT = ax 1 (n) + bx 2 (n) = Σ (ax 1 (n) +bx 2 (n)] W N kn = a Σ x 1 (n) W N kn + b Σ x 1 (n) W N kn
13 = ax 1 (k) + bx 2 (k), 0 k Sometimes we represent the linearity property as given below DFT ax 1 (n) + bx 2 (n) ax 1 (k) + bx 2 (k) Example : Find the 4- point DFT of the sequence X(n) = cos ( π n) + sin ( π n) 4 4 Use linearity property. Solution Given N = 4, W N = e j2π /n W = e We know that, W 4 0 = 1 Hence, W 4 0 = 1 Let W 4 1 = e = -j W 3 4 = e = -1 x 1 (n) = cos (π /4 n ) x 2 (n) = sin (π /4 n ) jπ /2 and Then, the values of x (n) and x2 (n) for 0 <n <3 tabulated below : N x 1 (n) = cos (π /4 n ) x 2 (n) = sin (π /4 n ) X 1 (k) = DFT (x 1 (n)) 3 Σ x 1 (n) W 4 kn, k = 0,1,2,3 X 1 (k) = W 4 k +0 1 W 4 3k
14 Hence, X 1 (0) = = 1 X 1 (1) = W W 3 4 = 1 j1.414 X 1 (2) = W W 6 4 Similarly, = W W 4 2 = 1 X 1 (3) = W W 9 4 = W W 1 4 X 2 (k) = DFT (x 2 (n)) 3 Σ x 2 (n) W kn 4 X 2 (k) = 1 W k 4 + W 2k W 3k 4 Hence, X 2 (0) = = X 2 (1) = 1 W W W 3 4 = -1 X 2 (2) = 1 W W W 9 4 = 1 W W W 9 4 = X 2 (3) = 1 W W W 4 9 = 1 W W W 1 4 = -1 Finally, applying the linearity property, we get X (k) = DFT ( x 1 (n) + x 2 (n)) = X 1 (k) + X 2 (k) = ( X 1 (0) + X 2 (0), X 1 (1) + X 2 (1). X 1 (2), X 2 (2), X 1 (3) + X 2 (3) ) = ( j j1.414) k=0
15 It may be noted that the arrow, explicitly represents the position index of k = 0 or n = 0 of a given sequence. The absence of this arrow also implicitly means that the first element in a sequence always has the index k = 0 or n = 0. Example Compute DFT (x(n)) of the sequence given below using the linearity property. x (n) = cosh an, 0 n Solution Given x(n) = cosh an, 0 n Then the N point DFT of the sequence x (n) is X (k) = DFT [x(n)] = DFT ( cosh an) = DFT 1 e an + 1 e- an 2 2 Applying linearity property, we get X (k) = 1 DFT [e an ] + 1 DFT [e -an ], 0 n 2 2 We know from Example 3.5, that DFT (b N ) = b N -1, 0 k b W k N -1 Hence, X (k) = 1 e a(n) e a(n) e a(n) W k N -1 e -a W k N - 1 = W N -kn ( e a() + e -a() - e - a + e a ] - e an - e an +2 2[1- W k N (e a e a ) + W k N ] = 1 cosh Na + WN k [cosh ( )a cosh a], 0 k 6.2 Circular time shift 1-2 W N k cosha + W N k If DFT [x(n)] = X (k). Then DFt [x(n-m))] = X(k), 0 n Proof : x (n) = N=1 1 Σ [ X (k) W N -kn
16 N=1 x (n-m) = 1 Σ [ X (k) W N k(n-m) Since, the time shift is circular, we can write the above equation as N=1 x (n-m) = 1 Σ [ X (k) W N km ] W N -kn x (n-m) N = IDFt [ X(k) W N km] or DFT [x(n-m) N ] = W N km X (k) In terms of the transform pair, we can write the above equation is DFT x (n-m) N W N km X (k) Example Find the 4- point DFT of the sequence, x(n) = (1, -1, 1, -1) Also, using time shift property, find the DFT of the sequence, y(n) = x (n-2) 4. Solution Given N = 4 We know that W 4 0 = 1, W 4 1 = -j W 2 4 = -1, W 3 4 = j Hence, X (k) = DFT (x (n) ) 3 = Σ x(n) W kn 4, 0 k 3 = 1 W 0k 4 x 1 x W k 4 +1 x W 2k 4-1 x W 3k 4 = 1- W 4 1+W 2k 4 - W 3k 4 X(0) = = 0 X(1) = 1 - W 4 1+ W 4 2- W 3 4 = 0 X(2) = 1 - W W W 6 4 = 1- W W W 4 2 = 4 X(3) = 1 - W W 4 6- W 4 9 Given y (n) = x(n-2) 4 = 1- W W W 4 1 = 0 Applying circular time shift property, we get Y(k) = W 4 2k X (k), k = 0,1,2,3 Y(0) = W 4 0 X(0) = 0
17 Y(1) = W 4 2 X (1) = 0 Y(2) = W 4 4 = W 4 0 x(2) = 4 Y(3) = W 4 6 x (3) = W 4 2 x (3) = 0 Hence, Y(k) = (0,0,4,0) k-0 Example Suppose x(n) is a sequence defined on 0-7 only as ( 0,1,2,3,4,5,6,7), a. Illustrate x(n-2) is b. If DFT (x(n)) = X (k), what is the DFT (x (n-2)s) Solution a. Given To generate x (n-2) move the last 2 samples of x (n) to the beginning. That is, x (n-2) = (6,7,0,1,2,3,4,5) s(n-2)g n It should be noted that x (n-2) is implicity periodic with a period N = 8. b. Let y(n)=x(n-2) 8 Applying circular time shift property, we get Y(k) = W 3 2k X(k) Example : Let X (k) donate a 6-point DFT of a length 6 real sequence, x(n). The sequence is shown in Fig. Ex 3.17, without computing the IDFT, determine the length -6 sequence, y(n) whose 6-point DFT is given by, Y (k) = W 3 2k X(k) x(n) Fig. Sequence x(n)
18 Solution We may write W 3 2k = e- j 2π/3n x2k = e- j 2π/3n x2k Hence, W 3 2k = W6 4k It is given in the problem that Y(k) = W 3 j 2k X(k) Y(k) = W 6 4k X(k) We know that DFT (x(n=m) N = W N mk X(k) IDFT W N mk X(k) = x(n-m) N Hence, y(n) = x(n-4) 6 Since, x(n) = (1,-1,2,3,0,0) We get x(n-4) is by moving the last 4 samples of x(n) to the beginning y(n) = x(n-4) 6 = (2,3,0,0,1-1) Circular frequency shift ( Multiplication by exponential in time-domain) If DFT (x(n)) = X (k), then DFT = X (k-1) N. Proof : X (k) = DFT (x (n)) = Σ x(n) W N kn, 0 k X(k-1) = Σx(n) W N (k-1)n Since, the shift is frequency is circular, we may write the above equation as X(k-1) 8 = Σ { x(n) W N -ln } W N kn Hence, DFT {x(n) W N -ln } = X (k=1) N Example Compute the 4-point DFT of the sequence x (n) = (1,0,1,0), Also, find y (n) if Y (k) = X (k-2) 4.
19 Solution Given N = 4. Also W 4 0 = 1, W4 l =-j, W 4 2 =-1, W4 3 =j, The DFT of the sequence, x (n) is 3 X(k) = Σ x(n) W 4 kn, 0 k 3 = 1x W 4 0k x W4 2k =0 = 1 +W 4 2k X(0) = 1+1= 2 X(1) = 1+W2 4 = 0 X(2) = 1+W0 4 = 2 X(3) = 1+W2 4 = 0 X(0) = 1+1= 2 X(k) = X(k-2)) 4 Given Y(k) = X(k-2) 4 We know that, DFT (W N -ln x (n)) = X(k-l)N That is, Hence, y(n) = W N -ln x (n) DFT Y(k) = X(k-1)N y(n) = W 4-2n x (n) y(0) = W4-0 x (0) = 1 y(1) = W 4-2 x (1) = 0 y (2) = W4-4 x (2) = W 4-0 x (2) = 1x 1 =1 y(3) = W 4-6 x (3) = W4-2 x (3) = 0 That is, y(n) = (1,0,1,0)
20 Circular convolution Unlike DFT convolution in DFT in circular consider two sequence x(n) and y(n) the circular convolution of x(n) and y(n) in given by Let f (n) = x (n) x y(n) x(n+n) = 1 Σ x(n-m) N h (m) 0 n m=0 = Σ x(m) h (n-m) n Point to be noted here in that x(n) and y(n) should be of same length Example : Let x (n) = 1,1,1 y (n) = 1,-2,2 Retain x (n) as it is and circularly fold y (n) i.e. y(n) = 1,2,-2. N x(m) y(n-m) N f(n) 0 1,1,1 1,2,-2 1 x 1+1x2+1x-2 = 1 1 1,1,1-2,1,2 1 x x1 + 1x2 = 1 2 1,1,1 2,-2,1 1 x 2, +1x-2 + 1x1 = 1 h (n) = 1,1,1
21 Summary 1) x (k) = Σ x(n) e-jwn = Σ x(n) Wn kn 2) x (n) = 1 Σ x(n) Wn kn 0 n 3) Periodicity of W n kn W 4 8 W 5 8 -W 7 8 = W3 8 W 6 8 W 2 8 W 7 8 W 0 8 =W4 6 W 1 8 = -W5 8 = W 8 8 4) DFT { ax 1 (n) + bx 2 (n) } = ax 1 (k) + bx 2 (k) 5) DFT {x(n-m) N } = W N mk x (k) 6) DFT {W n -ln x(n) } = x(k-l)n 7) X (k) = X y (N-k) 8) DFT {x(n-n)} = x(n-k) 9) DFT { xe (n) } = 1 DFT {x(n) + 1 DFT { x(-n) N )} 2 = 1 x (k) + 1 x (-k) N ) DFT { x1 (n) x2(n) } = 1 x 1(k) x2 (k) N W α N = W α+n N
8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationFrequency-domain representation of discrete-time signals
4 Frequency-domain representation of discrete-time signals So far we have been looing at signals as a function of time or an index in time. Just lie continuous-time signals, we can view a time signal as
More informationVII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.
1 VII. Discrete Fourier Transform (DFT) Chapter-8 A. Modulo Arithmetic (n) N is n modulo N, n is an integer variable. (n) N = n m N 0 n m N N-1, pick m Ex. (k) 4 W N = e -j2π/n 2 Note that W N k = 0 but
More informationINTRODUCTION TO THE DFS AND THE DFT
ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationMAHALAKSHMI ENGINEERING COLLEGE-TRICHY
DIGITAL SIGNAL PROCESSING DEPT./SEM.: ECE&EEE /V DISCRETE FOURIER TRANFORM AND FFT PART-A 1. Define DFT of a discrete time sequence? AUC MAY 06 The DFT is used to convert a finite discrete time sequence
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
More informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
More informationELEG 305: Digital Signal Processing
ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.
More information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
More informationSignals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions
8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether
More informationFundamentals of the DFT (fft) Algorithms
Fundamentals of the DFT (fft) Algorithms D. Sundararajan November 6, 9 Contents 1 The PM DIF DFT Algorithm 1.1 Half-wave symmetry of periodic waveforms.............. 1. The DFT definition and the half-wave
More informationDigital Signal Processing
DIGITAL SIGNAL PROCESSING SUBJECT CODE : NO. OF LECTURE HRS/WEEK : 04 TOTAL NO. OF LECTURE HRS. : 52 IA MARKS : 25 EXAM HOURS : 03 EXAMMARKS : 100 UNIT - 1 DISCRETE FOURIER TRANSFORMS (DFT): FREQUENCY
More informationFourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)
Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time
More information1.3 Frequency Analysis A Review of Complex Numbers
3 CHAPTER. ANALYSIS OF DISCRETE-TIME LINEAR TIME-INVARIANT SYSTEMS I y z R θ x R Figure.8. A complex number z can be represented in Cartesian coordinates x, y or polar coordinates R, θ..3 Frequency Analysis.3.
More informationCMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation
CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationChapter 6: Applications of Fourier Representation Houshou Chen
Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier
More informationLectures on Spectra of Discrete-Time Signals
Lectures on Spectra of Discrete-Time Signals Principal questions to be addressed: What, in a general sense, is the "spectrum" of a discrete-time signal? How does one assess the spectrum of a discrete-time
More informationHow to manipulate Frequencies in Discrete-time Domain? Two Main Approaches
How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous
More informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
More informationLinear Convolution Using FFT
Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:305:45 CBC C222 Lecture 8 Frequency Analysis 14/02/18 http://www.ee.unlv.edu/~b1morris/ee482/
More informationEDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015
EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT March 11, 2015 Transform concept We want to analyze the signal represent it as built of some building blocks (well known signals), possibly
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 18: Applications of FFT Algorithms & Linear Filtering DFT Computation; Implementation of Discrete Time Systems Kenneth E. Barner Department of Electrical and
More informationGeneralizing the DTFT!
The Transform Generaliing the DTFT! The forward DTFT is defined by X e jω ( ) = x n e jωn in which n= Ω is discrete-time radian frequency, a real variable. The quantity e jωn is then a complex sinusoid
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More information[ ], [ ] [ ] [ ] = [ ] [ ] [ ]{ [ 1] [ 2]
4. he discrete Fourier transform (DF). Application goal We study the discrete Fourier transform (DF) and its applications: spectral analysis and linear operations as convolution and correlation. We use
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More informationSIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals
SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More informationLAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
More informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationDigital Signal Processing Chapter 10. Fourier Analysis of Discrete- Time Signals and Systems CHI. CES Engineering. Prof. Yasser Mostafa Kadah
Digital Signal Processing Chapter 10 Fourier Analysis of Discrete- Time Signals and Systems Prof. Yasser Mostafa Kadah CHI CES Engineering Discrete-Time Fourier Transform Sampled time domain signal has
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 5 based on slides by J.M. Kahn Info Last time Finished DTFT Ch. 2 z-transforms Ch. 3 Today: DFT Ch. 8 Reminders: HW Due tonight The effects of sampling What is going
More informationDiscrete Fourier transform
Discrete Fourier transform Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/ January 2, 216 Signal
More informationSignals & Systems Handout #4
Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
More informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationSummary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!
Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship
More informationWEEK10 Fast Fourier Transform (FFT) (Theory and Implementation)
WEEK10 Fast Fourier Transform (FFT) (Theory and Implementation) Learning Objectives DFT algorithm. Conversion of DFT to FFT algorithm. Implementation of the FFT algorithm. Chapter 19, Slide 2 DFT Algorithm
More informationPart 3d: Spectra of Discrete-Time Signals
c D. Neuhoff and J. Fessler, June 9, 23, 2:8 student version) 3d. Part 3d: Spectra of DiscreteTime Signals Outline A. Definition of spectrum for discretetime signals B. Periodicity of discretetime sinusoids
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More informationChapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter
Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More informationECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet
ECE58 Final Exam Fall 7 Digital Signal Processing I December 7 Cover Sheet Test Duration: hours. Open Book but Closed Notes. Three double-sided 8.5 x crib sheets allowed This test contains five problems.
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More informationProblem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:
EE 438 Homework 4. Corrections in Problems 2(a)(iii) and (iv) and Problem 3(c): Sunday, 9/9, 10pm. EW DUE DATE: Monday, Sept 17 at 5pm (you see, that suggestion box does work!) Problem 1. Suppose we calculate
More informationLecture 10, Multirate Signal Processing Transforms as Filter Banks. Equivalent Analysis Filters of a DFT
Lecture 10, Multirate Signal Processing Transforms as Filter Banks Equivalent Analysis Filters of a DFT From the definitions in lecture 2 we know that a DFT of a block of signal x is defined as X (k)=
More informationDigital Signal Processing Module 6 Discrete Fourier Transform (DFT)
Objective: Digital Signal Processing Module 6 Discrete Fourier Transform (DFT) 1. To analyze finite duration sequences using Discrete Fourier Transform. 2. To understand the characteristics and importance
More informationGenerating Functions (Revised Edition)
Math 700 Fall 06 Notes Generating Functions (Revised Edition What is a generating function? An ordinary generating function for a sequence (a n n 0 is the power series A(x = a nx n. The exponential generating
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: April 11, 2012 Comments, questions or bug reports? Please contact verghese at mit.edu CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have
More informationMusic 270a: Complex Exponentials and Spectrum Representation
Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential
More informationContents. Digital Signal Processing, Part II: Power Spectrum Estimation
Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2
More informationEE 438 Essential Definitions and Relations
May 2004 EE 438 Essential Definitions and Relations CT Metrics. Energy E x = x(t) 2 dt 2. Power P x = lim T 2T T / 2 T / 2 x(t) 2 dt 3. root mean squared value x rms = P x 4. Area A x = x(t) dt 5. Average
More informationDigital Signal Processing Lab 3: Discrete Fourier Transform
Digital Signal Processing Lab 3: Discrete Fourier Transform Discrete Time Fourier Transform (DTFT) The discrete-time Fourier transform (DTFT) of a sequence x[n] is given by (3.1) which is a continuous
More informationDigital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung
Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input
More informationHW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1
HW3 Solutions Pr..8 (a) The DTFT of c[n] is C(e jω ) = = =.5 n e jωn + n=.5e jω + n= m=.5 n e jωn.5 m e jωm.5e jω +.5e jω.75 =.5 cos(ω) }{{}.5e jω /(.5e jω ) C(e jω ) is the power spectral density. (b)
More informationLecture 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationOLA and FBS Duality Review
MUS421/EE367B Lecture 10A Review of OverLap-Add (OLA) and Filter-Bank Summation (FBS) Interpretations of Short-Time Fourier Analysis, Modification, and Resynthesis Julius O. Smith III (jos@ccrma.stanford.edu)
More informationEE 438 Supplementary Notes on Fourier Series and Linear Algebra.
EE 38 Supplementary Notes on Fourier Series and Linear Algebra. Discrete-Time Fourier Series. How to write a vector s as a sum where {g,...,g m } are pairwise orthogonal? s m a k g k, k Answer: project
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Prof. Mark Fowler Note Set #21 Using the DFT to Implement FIR Filters Reading Assignment: Sect. 7.3 of Proakis & Manolakis Motivation: DTFT View of Filtering There are
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 2B D. T. Fourier Transform M. Lustig, EECS UC Berkeley Something Fun gotenna http://www.gotenna.com/# Text messaging radio Bluetooth phone interface MURS VHF radio
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationDefinition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More informationDiscrete-Time Signals and Systems
ECE 46 Lec Viewgraph of 35 Discrete-Time Signals and Systems Sequences: x { x[ n] }, < n
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
More informationFourier series for continuous and discrete time signals
8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 5 FFT and Divide and Conquer Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 56 Outline DFT: evaluate a polynomial
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing III. DSP - Digital Fourier Series and Transforms Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher:
More informationTwo-Dimensional Signal Processing and Image De-noising
Two-Dimensional Signal Processing and Image De-noising Alec Koppel, Mark Eisen, Alejandro Ribeiro March 14, 2016 Before we considered (one-dimensional) discrete signals of the form x : [0, N 1] C where
More information2D Discrete Fourier Transform (DFT)
2D Discrete Fourier Transform (DFT) Outline Circular and linear convolutions 2D DFT 2D DCT Properties Other formulations Examples 2 2D Discrete Fourier Transform Fourier transform of a 2D signal defined
More informationFourier Transform with Rotations on Circles and Ellipses in Signal and Image Processing
Fourier Transform with Rotations on Circles and Ellipses in Signal and Image Processing Artyom M. Grigoryan Department of Electrical and Computer Engineering University of Texas at San Antonio One UTSA
More informationZ-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.
84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4
More information