Scribd Logo
Upload

Welcome to Scribd!

  • 129 views

    Decimation in Time

    Uploaded by

    Grisel Morales
    FFT Decimation in Time splits x (n) into the even indexed x (2m) and the odd indexed y (2m + 1) each n / 2 long. Inverse discrete Fourier can be calculated using the same method but after dividing x by n.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Decimation in Time

    Uploaded by

    Grisel Morales
    129 views9 pages
    FFT Decimation in Time splits x (n) into the even indexed x (2m) and the odd indexed y (2m + 1) each n / 2 long. Inverse discrete Fourier can be calculated using the same method but after dividing x by n.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    FFT Decimation in Time splits x (n) into the even indexed x (2m) and the odd indexed y (2m + 1) each n / 2 long. Inverse discrete Fourier can be calculated using the same method but after dividing x by n.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    129 views9 pages

    Decimation in Time

    Uploaded by

    Grisel Morales
    FFT Decimation in Time splits x (n) into the even indexed x (2m) and the odd indexed y (2m + 1) each n / 2 long. Inverse discrete Fourier can be calculated using the same method but after dividing x by n.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 9

    FFT Decimation in Time

    Spring 2009
    Ammar Abu-Hudrouss Islamic University Gaza

    Decimation in Time
    In this method we split x (n) into the even indexed x (2m) and the odd indexed x (2m + 1) each N/2 long. DFT can be expressed as:
    N / 2 1 N / 2 1

    X (k )

    m0

    x ( 2 m )W

    2 mk N

    m0

    x ( 2 m 1)W
    N / 2 1

    k ( 2 m 1) N

    N / 2 1

    X (k )

    x ( 2 m )W

    mk N /2

    k N

    m 0

    m0

    km x ( 2 m 1 ) W N /2

    (1)

    K = 0,1,2,3,4,..,N-1
    We have used the fact
    2 mk WN e j 2 mk 2 / N e j 2mk /( N / 2 ) WNmk /2

    Digital Signal Processing


    Slide

    Decimation in Time
    Define new functions as

    G (K) is a DFT for the even samples of x (n), or


    N / 2 1

    G (k )

    m0

    x(2m)W
    N / 2 1

    mk N /2

    k 0,1,2,...., N / 2 1

    H (K) is a DFT for the odd samples of x(n), or


    H (k )
    m0

    x(2m 1)W

    km N /2

    k 0,1,2,3,..., N / 2 1

    Then equation (1) for the first N/2 points can be expressed as
    k X ( k ) G ( k ) WN H (k )

    k 0,1,2,...., N / 2 1

    Digital Signal Processing


    Slide

    Decimation in Time
    But
    ( N / 2 k ) WN WNk

    G (k ) G ( N / 2 k ), H (k ) H ( k N / 2)
    Then

    k 0,1,2,..., N / 2 1 k 0,1,2,...., N / 2 1

    X ( k N / 2 ) G ( k ) W Nk H ( k )

    k N / 2, N / 2 1,...., N

    This can be expressed in the following diagram

    Digital Signal Processing


    Slide

    Decimation in Time
    x(0) x(2) x(4) x(6) x(1) x(3) x(5) x(7) 4-point DFT 4-point DFT G(0) G(1) G(2) G(3) H(0) H(1) H(2) H(3)
    W 80 W81
    W82

    X(0) X(1) X(2) X(3)


    -1 -1 -1 -1

    X(4) X(5) X(6) X(7)

    W 83

    Digital Signal Processing


    Slide

    Decimation in Time
    x(0) x(4) x(2) x(6) x(1) x(5) x(3) x(7) 2-point DFT 2-point DFT 2-point DFT 2-point DFT
    W80 W80

    X(0) X(1)
    -1
    W82

    X(2) X(3)
    W 80 W81
    W82

    -1 -1 -1 -1 -1

    X(4) X(5) X(6) X(7)

    -1
    W82

    W 83
    -1

    Digital Signal Processing


    Slide

    Decimation in Time
    x(0) x(4) x(2) x(6) x(1) x(5) x(3) x(7)
    W80 W80

    X(0)
    W80

    -1
    W80

    X(1)
    -1
    W82

    X(2) X(3)
    W 80 W81
    -1 -1 -1 -1

    -1

    -1

    X(4) X(5) X(6) X(7)

    W80

    -1

    W80

    W82

    -1
    W82

    W 83
    -1

    -1

    Digital Signal Processing


    Slide

    Decimation in Time
    Example Given a sequence x(n) where x(0) = 1, x(1) = 2, x(2) = 3, x(3) = 4 and x(n) = 0 elsewhere ,find DFT for the first four points Solution
    x(0)=1 x(2)=3 x(1)=2 x(3)=4
    W40 1

    4
    W40 1

    X(0 )= 10 X(1)= -2+2j


    W40 1

    -2
    -1

    6
    -1

    1 -2 W4 j

    -1 -1

    X(2)= -2 X(3)= -2-2j

    Digital Signal Processing


    Slide

    Inverse Fourier Transform


    The inverse discrete Fourier can be calculated using the same method but after changing the variable W N and multiplying the result by 1/N Example Given a sequence X(n) given in the previous example. Find the IFFT using decimation in time method Solution
    X(0) =10
    ~

    8
    W40 1

    4 8
    ~

    1/4 1/4 1/4 1/4

    x(0) = 1 x(1) = 3 x(2) = 2 x(3) = 4

    X(2) =-2 X(1) = -2+2j

    12
    -1

    -4 W40 1
    ~

    12
    -1

    X(3) = -2-2j

    W40 1

    j4
    -1

    W41 j

    16
    -1

    Digital Signal Processing


    Slide

    You might also like