Scribd Logo
Upload

Welcome to Scribd!

  • Unit V Final

    Uploaded by

    p.arunagiri
    14 views21 pages

    Original Title

    Unit V final

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    14 views21 pages

    Unit V Final

    Uploaded by

    p.arunagiri

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 21

    UNIT V

    DISCRETE FOURIER TRANSFORM

    EC T43-SIGNALS AND SYSTEMS ECE


    DISCRETE FOURIER TRANSFORM

    One of the main advantages of discrete-time signals is that they can be processed and
    represented in digital computers. However, when we examine the definition of the Fourier
    transform of discrete-time signal

    DTFT

    We notice that such a characterization in frequency domain depends on the continuous


    variable
    This implies that the Fourier transform is not suitable for the processing of discrete-time
    signals in digital computers.

    As a consequence we need a transform depending on a discrete-frequency variable. This can


    be obtaining from the Fourier transform itself in very simple way, by sampling uniformly the
    continuous-frequency variable . In this way, we obtain a mapping of a signal depending on a
    discrete-time variable to a transform depending a discrete-frequency variable , such a mapping
    is referred to as the discrete Fourier transform (DFT).

    DFT is given by

    for

    IDFT

    for

    Twiddle factor

    Most approaches for improving the efficiency of computation of DFT, exploits the symmetry and periodicity property

    of i.e.

    EC T43-SIGNALS AND SYSTEMS ECE


    Properties of the DFT
    1. Linearity :

    2. Time Shift:

    3. Frequency Shift:

    4. Duality:

    DFT of x(m)

    5. Circular convolution

    Circular convolution

    6. Multiplication

    7. Parseval’s Theorem

    Summary of Properties of the Discrete Fourier Transform

    Property Periodic signal Fourier Series Coefficients

    EC T43-SIGNALS AND SYSTEMS ECE


    Linearity

    Time Shifting

    Conjugation

    Time Reversal
    Frequency Shifting

    First Difference

    Conjugate x[n] real


    Symmetry for Real
    Signals
    Real & Even x[n] real and even real and even
    Signals
    Real & Odd signals x[n] real and odd purely imaginary and odd
    Even-Odd
    Decomposition
    Of Real Signals

    Parseval’s Relation

    EC T43-SIGNALS AND SYSTEMS ECE


    PROBLEMS

    Example 1. : Find DFT of { 1 0 0 1}.

    The DFT of the sequence { 1, 0, 0, 1} will be evaluated

    x(0) = 1, x(T)= 0, x(2T) = 0, x(3T) = 1 , N=4

    We desire to find X(k) for k = 0,1,2,3.

    For k = 0

    k=1

    k=2

    k=3

    Ans: X(k) = { 2 , (1+j) , 0, (1-j) }

    Example 2: What is the DFT of the signal[n]?


    x[n] = [n]
    X[k] = = k[0] = .
    This means that all frequencies are equally strong present in the impulse signal. So its frequency
    spectrum is flat.

    Example 3: What is the DFT of a shifted impulse [n-1]?

    x[n] = [n-1]

    X[k] = = k[-1] = e-ik0 with 0 = 

    In this case again all frequencies X[k] are equally strong (they have the same modulus ), but now

    EC T43-SIGNALS AND SYSTEMS ECE


    the frequency spectrum consists of complex numbers.

    Example 4: What is the DFT of cos(50) with 0 = ?

    x[n] = cos(n 50).

    We could calculate X[k] in the same way as in the previous examples, but we can also directly find
    X[k] because we may write cos(50) as:

    x[n] = cos(n50) = ein50 + e-in505[n] + -5[n].

    As k+N[n] = k[n] we obtain:

    x[n] = 5[n] + N-5[n].


    So X[5] = and X[N-5] = and all other frequencies are zero:
    X[k] = 0, for 0 k < N and k  5 and k  N-5.
    Example 5: What is the DFT of a shifted signal x[n-n0]?

    Denote the DFT of the shifted signal by X'[k] and of the original signal by X[k].

    X'[k] ===
    = X[k] e-ik0n0 = X[k] k[-n0] with 0 = 

    Example 6 : Compute the DFT of sequence

    Example 7: What is the relationship between Z transform and the Discrete


    Fourier transform?
    Ans. Let us consider a sequence x(n) having z-transform with ROC that includes the

    EC T43-SIGNALS AND SYSTEMS ECE


    unit circle. If X(z) is sampled at the N equally spaced points on the unit circle. If X(z) is
    sampled at N equally spaced pomts on the unit circle.

    We obtain

    Expression is (2) identical to the Fourier transform X(w) evaluated at the N. equally spaced.
    Frequencies

    If the sequence x(n) has a finite duration of length N or less, the sequence can be recovered from
    its N-point DFT. Hence its Z-transform is uniquely determined by its N-point DFI’. Consequently,
    X(z) can be expressed as a function of the DFT {X(k)} as follows

    When evaluated on the unit circle (3) yields the Fourier transform of the finite duration sequence
    in terms of its DFT in the form:

    This expression for Fourier transform is a polynomial interpolation formula for X(w) expressed in
    terms of the, values {x(k)) of the polynomial at a set of equally spaced discrete frequencies

    EC T43-SIGNALS AND SYSTEMS ECE


    Example 8 : Perform circular, convolution of two sequences

    Ans. Circular convolution is

    EC T43-SIGNALS AND SYSTEMS ECE


    FFT algorithms –advantages over direct computation of DFT – radix 2
    algorithms
    What are the advantages of FFT algorithm?
    Fast fourier transform reduces the computation time. In DFT computation, number of
    multiplication is N2 and the number of addition is N(N-1). In FFT algorithm, number of
    multiplication is only N/2(log2N) . Hence FFT reduces the number of elements (adder, multiplier
    Z &delay elements). This is achieved by effectively utilizing the symmetric and periodicity
    properties of Fourier transform.

    (Preparation for Mathematical Derivation of FFT)


    1. DFT Algorithm

    Denote , then

    Properties of :
    (1)
    (2)

    (3)

    RADIX 2

    The FFT algorithm is most efficient in calculating N point DFT. If the number of point N can
    be expressed as a power of 2 ie N= 2 M where M is an integer , then this algorithm is known
    as radix-2 FFT algorithm.

    Two-Point DFT

    EC T43-SIGNALS AND SYSTEMS ECE


    x(0), x(1):

    Four-point DFT

    x(0), x(1), x(2), x(3)

    EC T43-SIGNALS AND SYSTEMS ECE


    Two – point DFT

    If we denote z(0) = x(0), z(1) = x(2) => Z(0) = z(0) + z(1) = x(0) + x(2)
    Z(1) = z(0) - z(1) = x(0) - x(2)

    v(0) = x(1), v(1) = x(3) => V(0) = v(0) + v(1) = x(1) + x(3)
    V(1) = v(0) - v(1) = x(1) - x(3)

    Four – point DFT Two-point DFT

     X(0) = Z(0) + V(0)


    X(1) = Z(1) + (-j)V(1)
    X(2) = Z(0) - V(0)
    X(3) = Z(1) + jV(1)

    Decimation-in-Time FFT Algorithm

    x(0), x(1), … , x(N-1)

    EC T43-SIGNALS AND SYSTEMS ECE


    =>

    ( G(k): N/2 point DFT output (even indexed), H(k) : N/2 point DFT
    output (odd indexed))

    Question: X(k) needs G(k), H(k), k=… N-1


    How do we obtain G(k), H(k), for k > N/2-1 ?
    G(k) = G(N/2+k) k <= N/2-1
    H(k) = H(N/2+k) k <= N/2-1

    EC T43-SIGNALS AND SYSTEMS ECE


    Future Decimation
    g(0), g(1), …, g(N/2-1) G(k)
    h(0), h(1), …, h(N/2-1) H(k)

    even indexed g odd indexed g


    (N/4 point) (N/4 point)

    =>

    Similarly,

    EC T43-SIGNALS AND SYSTEMS ECE


    even indexed odd indexed
    h (N/4 point) h (N/4 point)

    For 8 – point

    EC T43-SIGNALS AND SYSTEMS ECE


    Decimation-in-Frequency FFT Algorithm

    x(0), x(1), … , x(N-1)

    let m = n-N/2 (n = N/2+m) n = N/2 => m = N/2-N/2 = 0


    n = N-1 => m = N-1-N/2 = N/2-1

    EC T43-SIGNALS AND SYSTEMS ECE


    N/2 point DFT

    X(k) : N-point DFT of x(0), …, x(N)  two N/2 point DFT

    EC T43-SIGNALS AND SYSTEMS ECE


    One N/2 point DFT => two N/4 point DFT
    … two point DFTs

    EC T43-SIGNALS AND SYSTEMS ECE


    Efficiency of FFT
    N – point DFT : 4N(N-1) real multiplications
    4N(N-1) real additions
    N – point FFT : 2Nlog2N real multiplications
    (N = 2m) 3Nlog2N real additions
    Computation ration

    EC T43-SIGNALS AND SYSTEMS ECE


    Example 1 Eight-Point FFT Using Decimation-in-Frequency of
    x(n) = {1 1 1 1 0 0 0 0}

    x(0) = x(1) = x(2) = x(3)= 1, and x(4) = x(5) = x(6) = x(7) = 0.

    Eight-point FFT flow graph using decimation-in-frequency.

    1. At stage 1:

    where x,(0), x,(1), . . . , x,(7) represent the intermediate output sequence afterthe first
    iteration that becomes the input to the second stage.
    2. At stage 2:

    EC T43-SIGNALS AND SYSTEMS ECE


    The resulting intermediate, second-stage output sequence x,,(0), x,,(1), . . .
    X,,(7) becomes the input sequence to the third stage.
    3. At stage 3:

    Answer

    X(k) = { 4 , 1-j2.41 , 0 , 1 – j0.41 , 0 , 1 + j0.41 , 0 , 1 + j2. 41 }

    DIT radix-2 FFT DIF radix-2 FFT


    1.When the input is bit reversed order, the 1.When the input is normal order, the output
    output will be in normal order . will be in bit reversed order .
    2.In each stage of computation the phase factor 2.In each stage of computation the phase factor
    are multiplied before add and subtract operation are multiplied after add and subtract operation

    3.The value of N should be expressed such 3.The value of N should be expressed such that
    m
    that N=2 and this algorithm consists of m N=2 m and this algorithm consists of m stage of
    stage of computation. computation.
    4.Total number of arthemetric operations is 4.Total number of arithmetic operations is
    N log N complex addition and N/2logN N log N complex addition and N/2logN

    EC T43-SIGNALS AND SYSTEMS ECE


    complex multiplications. complex multiplications

    COMPUTATION OF IDFT USING FFT

    The inverse DFT of an N point sequence X (K); K=0, 1…N-1 is defined as


    N-1
    x (n) =1/N ∑ X (K) e+j2‫ה‬nk/N for n=0, 1,2,…N-1
    K=0
    Take complex conjugate and multiply by N, we get
    N-1
    Nx *(n) = ∑X *(K) e+j2‫ה‬nk/N for n=0, 1, 2 …N-1
    K=0
    The desired output sequence x (n) can then be obtained by complex conjugating the DFT and
    divided by N
    N-1
    x (n) =1/N [ ∑X* (K) e+j2‫ה‬nk/N ]* K=0

    EC T43-SIGNALS AND SYSTEMS ECE

    You might also like