Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Z Transform1

    Uploaded by

    Rachit Jhunjhunwala
    This document discusses various topics related to Z-transforms including: how the Z-transform simplifies analysis of LTI systems by representing convolution as multiplication in the Z-domain; determining the region of convergence for rational Z-transforms; and the relationship between the discrete Fourier transform and Z-transform. It also discusses how the FFT algorithm reduces memory requirements through in-place computation and reuse of storage locations. Finally, it mentions several miscellaneous topics like the twiddle factor, aliasing, properties of FIR and IIR filters, and circular convolution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Z Transform1

    Uploaded by

    Rachit Jhunjhunwala
    13 views38 pages
    This document discusses various topics related to Z-transforms including: how the Z-transform simplifies analysis of LTI systems by representing convolution as multiplication in the Z-domain; determining the region of convergence for rational Z-transforms; and the relationship between the discrete Fourier transform and Z-transform. It also discusses how the FFT algorithm reduces memory requirements through in-place computation and reuse of storage locations. Finally, it mentions several miscellaneous topics like the twiddle factor, aliasing, properties of FIR and IIR filters, and circular convolution.

    Original Title

    Z-transform1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses various topics related to Z-transforms including: how the Z-transform simplifies analysis of LTI systems by representing convolution as multiplication in the Z-domain; determining the region of convergence for rational Z-transforms; and the relationship between the discrete Fourier transform and Z-transform. It also discusses how the FFT algorithm reduces memory requirements through in-place computation and reuse of storage locations. Finally, it mentions several miscellaneous topics like the twiddle factor, aliasing, properties of FIR and IIR filters, and circular convolution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views38 pages

    Z Transform1

    Uploaded by

    Rachit Jhunjhunwala
    This document discusses various topics related to Z-transforms including: how the Z-transform simplifies analysis of LTI systems by representing convolution as multiplication in the Z-domain; determining the region of convergence for rational Z-transforms; and the relationship between the discrete Fourier transform and Z-transform. It also discusses how the FFT algorithm reduces memory requirements through in-place computation and reuse of storage locations. Finally, it mentions several miscellaneous topics like the twiddle factor, aliasing, properties of FIR and IIR filters, and circular convolution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 38

    Z Transform, Inverse Z transform, Some

    related Filter Questions, Miscellaneous Topics


    Z-Transform
    • in the z-domain (complex z-plane) the convolution of two time-domain
    signals is equivalent to multiplication of their corresponding z-transforms.
    This property greatly simplifies the analysis of the response of an LTI
    system to various signals.
    • In addition. the z-transform provides us with a means of characterizing an
    LTI system, and its response to various signals, by its pole-zero locations.
    Rational Z transform
    Inverse Z transform
    Successively divide to
    eliminate the lowest
    power of z-1
    The rational z transform of x(n) is given by
    # Determine the ROC of the system whose system function is given below
    Relation between DFT and Z Transform
    Recall DIT FFT Algorithm
    • Pdf page 526- 527(Proakis 4th edition)
    • Q) How does FFT algorithm help to reduce the memory requirement and help in place
    computation.
    Solution:

    (a,b) are complex numbers and for storing them four storage locations are required. Two locations
    are required for storing the real part and two locations for the imaginary part of complex numbers
    a and b. After computation of the Radix two butterfly it generates output as (A,B) which are again
    two complex numbers. For storing A and B again four storage locations are required. But for storing
    A and B new storage locations are not required. They can be stored in the same storage locations
    used by complex numbers a and b, since after butterfly operation a and b are no longer required. That is
    only 4 storage locations are required for the two point radix 2 FFT. Therefore for N point DIF FFT only 2N
    storage locations are required. The storage locations are reused at every stage. This is how FFT helps in
    place computation
    Miscellaneous Topics
    • # Read about the twidle factor and its properties, Read about
    aliasing, Read about Properties of FIR filter and IIR filter, Read
    about Circular convolution with sequences having (i) equal
    sample size and (ii) unequal sample size.

    • # Test whether the sequence is circularly


    even or odd.
    Solution: Hint

    You might also like