eele 4310 digital signal processing dsp
play

EELE 4310: Digital Signal Processing (DSP) Chapter # 8 : Efficient - PowerPoint PPT Presentation

May 26, 2023 •125 likes •1.25k views

EELE 4310: Digital Signal Processing (DSP) Chapter # 8 : Efficient Computation of the DFT: Fast Fourier Transform Algorithms Spring, 2012/2013 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 1 / 15 Outline Efficient

  1. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  2. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  3. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  4. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  5. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  6. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  7. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  8. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  9. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 8 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 5 / 15

  10. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  11. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  12. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  13. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  14. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  15. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  16. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  17. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  18. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  19. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  20. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  21. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  22. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 9 Ex. Using the decimation in time FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } Check that DFT of x ( n ) = { 2 , 1 , 2 , 1 } is X ( k ) = { 6 , 0 , 2 , 0 } . EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 6 / 15

  23. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 10 Consider the case where N = 8, the first decimation yields the sequence x (0) , x (2) , x (4) , x (6) , x (1) , x (3) , x (5) , x (7). The second decimation results in the sequence x (0) , x (4) , x (2) , x (6) , x (1) , x (5) , x (3) , x (7). This shuffling of the input sequence has a well-defined order. By expressing the index n in the sequence x ( n ) in a binary form, we note that the order of the decimated data sequence is obtained by reading the binary representation of the index n in reversed order. Ex. the data point x (3) ≡ x (011) is placed in the position m = 110 or m = 6 in the decimated array. Therefore, the data x ( n ) after decimation is stored in bit-reversed order. If the input data is left in natural order, the output DFT sequence will occur in bit-reversed order. EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 7 / 15

  24. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 10 Consider the case where N = 8, the first decimation yields the sequence x (0) , x (2) , x (4) , x (6) , x (1) , x (3) , x (5) , x (7). The second decimation results in the sequence x (0) , x (4) , x (2) , x (6) , x (1) , x (5) , x (3) , x (7). This shuffling of the input sequence has a well-defined order. By expressing the index n in the sequence x ( n ) in a binary form, we note that the order of the decimated data sequence is obtained by reading the binary representation of the index n in reversed order. Ex. the data point x (3) ≡ x (011) is placed in the position m = 110 or m = 6 in the decimated array. Therefore, the data x ( n ) after decimation is stored in bit-reversed order. If the input data is left in natural order, the output DFT sequence will occur in bit-reversed order. EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 7 / 15

  25. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 10 Consider the case where N = 8, the first decimation yields the sequence x (0) , x (2) , x (4) , x (6) , x (1) , x (3) , x (5) , x (7). The second decimation results in the sequence x (0) , x (4) , x (2) , x (6) , x (1) , x (5) , x (3) , x (7). This shuffling of the input sequence has a well-defined order. By expressing the index n in the sequence x ( n ) in a binary form, we note that the order of the decimated data sequence is obtained by reading the binary representation of the index n in reversed order. Ex. the data point x (3) ≡ x (011) is placed in the position m = 110 or m = 6 in the decimated array. Therefore, the data x ( n ) after decimation is stored in bit-reversed order. If the input data is left in natural order, the output DFT sequence will occur in bit-reversed order. EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 7 / 15

  26. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 10 Consider the case where N = 8, the first decimation yields the sequence x (0) , x (2) , x (4) , x (6) , x (1) , x (3) , x (5) , x (7). The second decimation results in the sequence x (0) , x (4) , x (2) , x (6) , x (1) , x (5) , x (3) , x (7). This shuffling of the input sequence has a well-defined order. By expressing the index n in the sequence x ( n ) in a binary form, we note that the order of the decimated data sequence is obtained by reading the binary representation of the index n in reversed order. Ex. the data point x (3) ≡ x (011) is placed in the position m = 110 or m = 6 in the decimated array. Therefore, the data x ( n ) after decimation is stored in bit-reversed order. If the input data is left in natural order, the output DFT sequence will occur in bit-reversed order. EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 7 / 15

  27. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 10 Consider the case where N = 8, the first decimation yields the sequence x (0) , x (2) , x (4) , x (6) , x (1) , x (3) , x (5) , x (7). The second decimation results in the sequence x (0) , x (4) , x (2) , x (6) , x (1) , x (5) , x (3) , x (7). This shuffling of the input sequence has a well-defined order. By expressing the index n in the sequence x ( n ) in a binary form, we note that the order of the decimated data sequence is obtained by reading the binary representation of the index n in reversed order. Ex. the data point x (3) ≡ x (011) is placed in the position m = 110 or m = 6 in the decimated array. Therefore, the data x ( n ) after decimation is stored in bit-reversed order. If the input data is left in natural order, the output DFT sequence will occur in bit-reversed order. EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 7 / 15

  28. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 10 Consider the case where N = 8, the first decimation yields the sequence x (0) , x (2) , x (4) , x (6) , x (1) , x (3) , x (5) , x (7). The second decimation results in the sequence x (0) , x (4) , x (2) , x (6) , x (1) , x (5) , x (3) , x (7). This shuffling of the input sequence has a well-defined order. By expressing the index n in the sequence x ( n ) in a binary form, we note that the order of the decimated data sequence is obtained by reading the binary representation of the index n in reversed order. Ex. the data point x (3) ≡ x (011) is placed in the position m = 110 or m = 6 in the decimated array. Therefore, the data x ( n ) after decimation is stored in bit-reversed order. If the input data is left in natural order, the output DFT sequence will occur in bit-reversed order. EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 7 / 15

  29. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 10 Consider the case where N = 8, the first decimation yields the sequence x (0) , x (2) , x (4) , x (6) , x (1) , x (3) , x (5) , x (7). The second decimation results in the sequence x (0) , x (4) , x (2) , x (6) , x (1) , x (5) , x (3) , x (7). This shuffling of the input sequence has a well-defined order. By expressing the index n in the sequence x ( n ) in a binary form, we note that the order of the decimated data sequence is obtained by reading the binary representation of the index n in reversed order. Ex. the data point x (3) ≡ x (011) is placed in the position m = 110 or m = 6 in the decimated array. Therefore, the data x ( n ) after decimation is stored in bit-reversed order. If the input data is left in natural order, the output DFT sequence will occur in bit-reversed order. EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 7 / 15

  30. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... 11 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 8 / 15

  31. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  32. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  33. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  34. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  35. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  36. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  37. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N X ( k ) = � ( N / 2) − 1 � x ( n ) + ( − 1) k x ( n + N � W kn 2 ) n =0 N EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  38. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N X ( k ) = � ( N / 2) − 1 � x ( n ) + ( − 1) k x ( n + N � W kn 2 ) n =0 N By splitting (decimate) X ( k ) into even and odd numbered samples, we obtain, EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  39. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N X ( k ) = � ( N / 2) − 1 � x ( n ) + ( − 1) k x ( n + N � W kn 2 ) n =0 N By splitting (decimate) X ( k ) into even and odd numbered samples, we obtain, X (2 k ) = � ( N / 2) − 1 � x ( n ) + x ( n + N � W kn 2 ) n =0 N / 2 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  40. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N X ( k ) = � ( N / 2) − 1 � x ( n ) + ( − 1) k x ( n + N � W kn 2 ) n =0 N By splitting (decimate) X ( k ) into even and odd numbered samples, we obtain, X (2 k ) = � ( N / 2) − 1 � x ( n ) + x ( n + N � W kn 2 ) n =0 N / 2 = � ( N / 2) − 1 g 1 ( n ) W kn n =0 N / 2 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15

  41. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N X ( k ) = � ( N / 2) − 1 � x ( n ) + ( − 1) k x ( n + N � W kn 2 ) n =0 N By splitting (decimate) X ( k ) into even and odd numbered samples, we obtain, X (2 k ) = � ( N / 2) − 1 � x ( n ) + x ( n + N � W kn 2 ) n =0 N / 2 = � ( N / 2) − 1 g 1 ( n ) W kn n =0 N / 2 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15 and,

  42. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N X ( k ) = � ( N / 2) − 1 � x ( n ) + ( − 1) k x ( n + N � W kn 2 ) n =0 N By splitting (decimate) X ( k ) into even and odd numbered samples, we obtain, X (2 k ) = � ( N / 2) − 1 � x ( n ) + x ( n + N � W kn 2 ) n =0 N / 2 = � ( N / 2) − 1 g 1 ( n ) W kn n =0 N / 2 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15 x ( n ) − x ( n + N ) and, X (2 k + 1) = � ( N / 2) − 1 �� W n � W kn �

  43. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 1 The decimation in frequency FFT algorithm is obtained by using divide-and-conquer approach with choice of M = 2 and L = N / 2. The N-point DFT of the sequence x ( n ) is X ( k ) = � N − 1 n =0 x ( n ) W nk N , , k = 0 , 1 , · · · , N − 1 = � ( N / 2) − 1 N + � N − 1 x ( n ) W kn n = N / 2 x ( n ) W kn n =0 N = � ( N / 2) − 1 N + W Nk / 2 � ( N / 2) − 1 x ( n + N x ( n ) W kn 2 ) W kn n =0 n =0 N N e − j π � k = ( − 1) k , then = e − j 2 π Nk / 2 N = e − j π k = Since W Nk / 2 � N X ( k ) = � ( N / 2) − 1 � x ( n ) + ( − 1) k x ( n + N � W kn 2 ) n =0 N By splitting (decimate) X ( k ) into even and odd numbered samples, we obtain, X (2 k ) = � ( N / 2) − 1 � x ( n ) + x ( n + N � W kn 2 ) n =0 N / 2 = � ( N / 2) − 1 g 1 ( n ) W kn n =0 N / 2 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 9 / 15 x ( n ) − x ( n + N ) and, X (2 k + 1) = � ( N / 2) − 1 �� W n � W kn �

  44. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 2 and, The basic computation of the decimation in frequency FFT algorithm involves the following butterfly operation EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 10 / 15

  45. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 2 and, X (2 k + 1) = � ( N / 2) − 1 x ( n ) − x ( n + N W n W kn �� � � 2 ) n =0 N N / 2 The basic computation of the decimation in frequency FFT algorithm involves the following butterfly operation EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 10 / 15

  46. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 2 and, X (2 k + 1) = � ( N / 2) − 1 x ( n ) − x ( n + N W n W kn �� � � 2 ) n =0 N N / 2 = � ( N / 2) − 1 g 2 ( n ) W kn n =0 N / 2 The basic computation of the decimation in frequency FFT algorithm involves the following butterfly operation EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 10 / 15

  47. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 2 and, X (2 k + 1) = � ( N / 2) − 1 x ( n ) − x ( n + N W n W kn �� � � 2 ) n =0 N N / 2 = � ( N / 2) − 1 g 2 ( n ) W kn n =0 N / 2 The basic computation of the decimation in frequency FFT algorithm involves the following butterfly operation EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 10 / 15

  48. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 2 and, X (2 k + 1) = � ( N / 2) − 1 x ( n ) − x ( n + N W n W kn �� � � 2 ) n =0 N N / 2 = � ( N / 2) − 1 g 2 ( n ) W kn n =0 N / 2 The basic computation of the decimation in frequency FFT algorithm involves the following butterfly operation EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 10 / 15

  49. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  50. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  51. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  52. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  53. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  54. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  55. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  56. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  57. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  58. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  59. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  60. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  61. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  62. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  63. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  64. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  65. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  66. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 3 EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 11 / 15

  67. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 4 Ex. Using the decimation in frequency FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 12 / 15

  68. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 4 Ex. Using the decimation in frequency FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 12 / 15

  69. Efficient Computation of the DFT: FFT Algorithms Radix-2 FFT Algorithms ... Decimation in Frequency ... 4 Ex. Using the decimation in frequency FFT algorithm, compute the 4-point DFT of the sequence x ( n ) = { 5 , 0 , − 3 , 4 } EELE 4310: Digital Signal Processing (DSP) - Ch.8 Dr. Musbah Shaat 12 / 15

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Signal Processing - Introduction Signal Processing Analogue/digital filters: extensively used

Signal Processing - Introduction Signal Processing Analogue/digital filters: extensively used

Instrumentation (and Signal Processing Process Control) Fall 1393 Bonab University Signal Processing - Introduction Signal Processing Analogue/digital filters: extensively used in sensor signal processing Pre-processing

894 views • 32 slides
Advanced Digital Signal Processing Part 5: Multi-Rate Digital Signal Processing Gerhard Schmidt

Advanced Digital Signal Processing Part 5: Multi-Rate Digital Signal Processing Gerhard Schmidt

Advanced Digital Signal Processing Part 5: Multi-Rate Digital Signal Processing Gerhard Schmidt Christian-Albrechts-Universitt zu Kiel Faculty of Engineering Institute of Electrical and Information Engineering Digital Signal Processing and

964 views • 55 slides
Digital Signal Processing Solutions Digital Signal Processing Solutions SIGNAL PROCESSING

Digital Signal Processing Solutions Digital Signal Processing Solutions SIGNAL PROCESSING

Digital Signal Processing Solutions Digital Signal Processing Solutions SIGNAL PROCESSING DOMAIN HARDWARE SOFTWARE PARADIGM PARADIGM ASIC DSP PLD/FPGA GPP (Custom & COTS) 1 Hardware Paradigm Hardware Paradigm

397 views • 14 slides
VLSI VLSI - Digital Signal Processing Digital Signal Processing - - - Hsie-Chia

VLSI VLSI - Digital Signal Processing Digital Signal Processing - - - Hsie-Chia

VLSI VLSI - Digital Signal Processing Digital Signal Processing - - - Hsie-Chia Chang E-mail : hcchang@mail.nctu.edu.tw Fall 2006 Course I nformation Course I nformation Mission This course will cover the most important

305 views • 8 slides
Advanced Digital Signal Processing Part 5: Digital Filters Gerhard Schmidt

Advanced Digital Signal Processing Part 5: Digital Filters Gerhard Schmidt

Advanced Digital Signal Processing Part 5: Digital Filters Gerhard Schmidt Christian-Albrechts-Universitt zu Kiel Faculty of Engineering Institute of Electrical and Information Engineering Digital Signal Processing and System Theory Digital

1.74k views • 146 slides
Introduction to Digital Signal Processing Paolo Prandoni LCAV - EPFL Introduction to Digital

Introduction to Digital Signal Processing Paolo Prandoni LCAV - EPFL Introduction to Digital

Introduction to Digital Signal Processing Paolo Prandoni LCAV - EPFL Introduction to Digital Signal Processing p. 1/2 Inside DSP . . . Digital Brings experimental data & abstract models together Makes math very simple i.e. implementable

1.05k views • 29 slides
Advanced Digital Signal Processing Part 4: DFT and FFT Gerhard Schmidt

Advanced Digital Signal Processing Part 4: DFT and FFT Gerhard Schmidt

Advanced Digital Signal Processing Part 4: DFT and FFT Gerhard Schmidt Christian-Albrechts-Universitt zu Kiel Faculty of Engineering Institute of Electrical and Information Engineering Digital Signal Processing and System Theory DFT and FFT

986 views • 73 slides
VLSI Digital Signal Processing Systems Keshab K. Parhi VLSI Digital Signal Processing Systems

VLSI Digital Signal Processing Systems Keshab K. Parhi VLSI Digital Signal Processing Systems

VLSI Digital Signal Processing Systems Keshab K. Parhi VLSI Digital Signal Processing Systems Textbook: K.K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation, John Wiley, 1999 Buy Textbook:

1.26k views • 25 slides
Digital Signal Processing amplify or filter out embedded information detect patterns

Digital Signal Processing amplify or filter out embedded information detect patterns

Signal processing Signals may have to be transformed in order to Digital Signal Processing amplify or filter out embedded information detect patterns Markus Kuhn prepare the signal to survive a transmission channel prevent

998 views • 54 slides
Digital Signal Processing amplify or filter out embedded information detect patterns

Digital Signal Processing amplify or filter out embedded information detect patterns

Signal processing Signals may have to be transformed in order to Digital Signal Processing amplify or filter out embedded information detect patterns Markus Kuhn prepare the signal to survive a transmission channel prevent

953 views • 53 slides
Digital Signal Processing amplify or filter out embedded information detect patterns

Digital Signal Processing amplify or filter out embedded information detect patterns

Signal processing Signals may have to be transformed in order to Digital Signal Processing amplify or filter out embedded information detect patterns Markus Kuhn prepare the signal to survive a transmission channel prevent

780 views • 52 slides
Advanced Digital Signal Processing Part 1: Introduction Gerhard Schmidt

Advanced Digital Signal Processing Part 1: Introduction Gerhard Schmidt

Advanced Digital Signal Processing Part 1: Introduction Gerhard Schmidt Christian-Albrechts-Universitt zu Kiel Faculty of Engineering Institute of Electrical Engineering and Information Engineering Digital Signal Processing and System Theory

483 views • 11 slides
Advanced Digital Signal Processing Part 2: Digital Processing of Continuous-Time Signals Gerhard

Advanced Digital Signal Processing Part 2: Digital Processing of Continuous-Time Signals Gerhard

Advanced Digital Signal Processing Part 2: Digital Processing of Continuous-Time Signals Gerhard Schmidt Christian-Albrechts-Universitt zu Kiel Faculty of Engineering Institute of Electrical Engineering and Information Engineering Digital

586 views • 35 slides
Advanced Digital Signal Processing Part 3: Efficient FIR Structures Gerhard Schmidt

Advanced Digital Signal Processing Part 3: Efficient FIR Structures Gerhard Schmidt

Advanced Digital Signal Processing Part 3: Efficient FIR Structures Gerhard Schmidt Christian-Albrechts-Universitt zu Kiel Faculty of Engineering Institute of Electrical and Information Engineering Digital Signal Processing and System Theory

214 views • 7 slides
Speech Signal Representations Part 1: Digital Signal Processing Hsin-min Wang References: 1 X.

Speech Signal Representations Part 1: Digital Signal Processing Hsin-min Wang References: 1 X.

Speech Signal Representations Part 1: Digital Signal Processing Hsin-min Wang References: 1 X. Huang et al., Spoken Language Processing, Chapters 5-6 2 J. R. Deller et al., Discrete-Time Processing of Speech Signals, Chapters 4-6 3 J. W.

1.05k views • 60 slides
Digital Signal Processing Markus Kuhn Computer Laboratory

Digital Signal Processing Markus Kuhn Computer Laboratory

Digital Signal Processing Markus Kuhn Computer Laboratory http://www.cl.cam.ac.uk/teaching/0809/DSP/ Lent 2009 Part II Signals flow of information measured quantity that varies with time (or position) electrical signal received

1.36k views • 104 slides
Cengage & McGraw-Hill Merger Announcement Providing Students with More Affordable Access to

Cengage & McGraw-Hill Merger Announcement Providing Students with More Affordable Access to

Cengage & McGraw-Hill Merger Announcement Providing Students with More Affordable Access to Superior Course Materials and Platforms May 1, 2019 Cautionary Note Regarding Forward-Looking Statements This presentation contains

283 views • 14 slides
based Virtual Teaching for Dual Language Learners in Transitional Kindergarten Presenters:

based Virtual Teaching for Dual Language Learners in Transitional Kindergarten Presenters:

Elevating Assets- based Virtual Teaching for Dual Language Learners in Transitional Kindergarten Presenters: Tina Renzullo and M. Lourdes Salazar June 3, 2020 Transitional Kindergarten Teachers Moderator: Elvira G. Armas, Ed.D. Hosted

448 views • 31 slides
Trust, but Verify: What the Digital and Transparency Revolutions in Social Science Mean

Trust, but Verify: What the Digital and Transparency Revolutions in Social Science Mean

8/2/2015 University of Chicago Peking University Summer Institute on International Relations Theory and Methods (Beijing, August 2015) Trust, but Verify: What the Digital and Transparency Revolutions in Social Science Mean for You

333 views • 16 slides
Patenting of Software and Electronic Technologies in the United States Susan Perng Pan

Patenting of Software and Electronic Technologies in the United States Susan Perng Pan

Patenting of Software and Electronic Technologies in the United States Susan Perng Pan International Intellectual Property Rights Conference Bangalore, India, January 29-30, 2010 Legal Foundation for Patents in the U.S. is Broad and Strong

487 views • 32 slides
DRT IARPA MERCURY Proposers Day Presentation March 5 th , 2015 IARPA MERCURY Proposers Day

DRT IARPA MERCURY Proposers Day Presentation March 5 th , 2015 IARPA MERCURY Proposers Day

DRT IARPA MERCURY Proposers Day Presentation March 5 th , 2015 IARPA MERCURY Proposers Day DRTs capabilities are ITAR Controlled . This presentation is based on information that has been approved for public release and

331 views • 11 slides
SDR in ORBIT: Spectrum Sensing WINLAB Summer Internship 2015 Team Christina Baaklini Michael

SDR in ORBIT: Spectrum Sensing WINLAB Summer Internship 2015 Team Christina Baaklini Michael

SDR in ORBIT: Spectrum Sensing WINLAB Summer Internship 2015 Team Christina Baaklini Michael Collins Nick Cooper Nicole DiLeo Electrical and Computer Electrical and Computer High School Student Electrical and Computer Engineering

305 views • 17 slides
DSPJockey Brian Bourn, Abhinav Mishra Addisu Petros, Vanshil Shah COMS 4115 Programming

DSPJockey Brian Bourn, Abhinav Mishra Addisu Petros, Vanshil Shah COMS 4115 Programming

DSPJockey Brian Bourn, Abhinav Mishra Addisu Petros, Vanshil Shah COMS 4115 Programming Languages & Translators Prof. Stephen Edwards December 17, 2014 Motivation Digital Signal Processing used in fields of Electrical Engineering,

423 views • 14 slides
25 + Years in Silicon Wireless Ran Yan UCSB: 1986 - 1990 Have a GREAT Team Be

25 + Years in Silicon Wireless Ran Yan UCSB: 1986 - 1990 Have a GREAT Team Be

25 + Years in Silicon Wireless Ran Yan UCSB: 1986 - 1990 Have a GREAT Team Be Persistent 2 Silicon Wireless: Device Wireless + Low-Power = Mobile Internet ! Silicon Wireless: Circuit Wireless LAN (WiFi) worldwide sales: <

234 views • 6 slides

More recommend